Simulation Reproduces Quantum Experiment with 71 Percent Success Rate

SeQUeNCe.DQC simulates distributed quantum computing within the existing SeQUeNCe package. It compiles circuits into plans that account for network layouts and coordinated execution using established protocols. Validation accurately reproduced a two-node Grover experiment achieving a success rate of 71%; it demonstrated improved performance with hybrid compilation strategies. The new software, SeQUeNCe.DQC, simulates how multiple smaller quantum computers could work together.

This tool compiles complex calculations into plans suited for specific network layouts and coordinates their execution using existing communication methods. Validation accurately recreated a simulated experiment achieving 71% success; this demonstrates the potential of combined compilation approaches for improved performance in distributed systems. Researchers at the University of Wisconsin-Madison have unveiled SeQUeNCe.DQC, a new module designed to simulate distributed quantum computing within the existing SeQUeNCe package.

The tool tackles a key challenge in scaling up quantum computers by modelling how multiple smaller processors can work together, much like combining several small engines into one larger system for increased power. Validation involved accurately recreating a two-node experiment achieving 71% success, demonstrating improved performance with hybrid compilation strategies akin to choosing whether to physically move information or just instructions across a network.

SeQUeNCe.DQC surpasses prior Grover search benchmarks with topology-aware simulation

Using SeQUeNCe.DQC, simulated distributed Grover searches achieved a a seven percent increase in success probabilities; this surpassed the previously reported benchmark of 71%, a level unattainable without accurate modelling of network topologies. This advance unlocks detailed evaluation of compiler strategies and allowed University of Wisconsin team members to identify hybrid TeleGate/TeleData execution plans that outperform traditional gate teleportation methods limited by communication overheads.

The new module within the SeQUeNCe package accurately simulates two-node experiments and provides a platform for co-designing both quantum computing software *and* hardware architectures through realistic modelling of physical constraints like memory capacity and error rates.

A novel approach to compiler strategy enabled identification of hybrid execution plans combining TeleGate, a method transferring quantum states via pre-shared entanglement, with TeleData, which physically moves qubits between processors. These mixed strategies outperformed traditional gate teleportation alone, circumventing limitations imposed by communication overheads and allowing more efficient use of resources such as memory capacity. Accurately modelling two-node experiments using either density matrix or ket vector backends, the simulation platform captures how hardware error parameters, qubit infidelity and coherence times, impact performance.

Realistic communication modelling enables future codesign of distributed quantum systems

The team demonstrated improved hybrid compilation strategies within a two-node system; however, extrapolating these gains to larger networks remains an open question. Current validation relies heavily upon reproducing existing results rather than charting entirely new territory at scale. Despite current limitations in validating this approach on small systems, SeQUeNCe.DQC represents a step forward as it offers a key platform for exploring software interaction with emerging distributed quantum hardware.

SeQUeNCe.DQC from the University of Wisconsin-Madison establishes a platform enabling detailed exploration of distributed quantum computation, it moves beyond circuit simulation by modelling network architecture and communication costs’ impact upon performance. Reproducing a two-node experiment accurately served as a key step towards validating its accuracy, allowing assessment of how compiler choices influence success rates when dividing calculations across multiple processors.

The team’s focus on modelling realistic overhead, such as information transfer time between processors, is vital because it allows researchers to co-design both systems simultaneously; this could fuel advances in distributed quantum computing over the next decade by unlocking new possibilities as we begin building larger, more complex systems.

SeQUeNCe.DQC is a new module that compiles quantum circuits for execution across multiple processing units and coordinates their operation using existing network protocols. By accurately modeling physical costs like qubit movement and memory capacity within a two-node trapped-ion system, SeQUeNCe.DQC provides tools to evaluate how software interacts with distributed quantum hardware architectures; the authors intend this platform to facilitate co-design of both components going forward. The simulation successfully reproduced an experiment achieving 71% success probability.

👉 More information
🗞 SeQUeNCe.DQC: Full-stack Simulation of Distributed Quantum Computing
✍️ Sanjay Suresh, Caitao Zhan, Joaquin Chung and Rajkumar Kettimuthu (University of Wisconsin)
🧠 ArXiv: https://arxiv.org/abs/2610.39476

Stay current

See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.

Avatar of Ivy Delaney

Ivy Delaney

Ivy Delaney has been working with neural networks and machine learning since the mid-nineties, back when a couple of hidden layers and a long afternoon of training counted as ambitious. She has watched the field go from academic curiosity to the thing quietly running underneath everything, and she brings that long view to quantum computing. For Quantum Zeitgeist she covers the ground where the two fields meet. That means quantum machine learning and the variational algorithms it leans on, and it also means the less glamorous but more interesting story of classical machine learning already doing real work inside quantum machines, decoding error-correcting codes, calibrating noisy hardware and learning the error models that simulators depend on. She writes about the hardware those algorithms have to run on too, and about the post-quantum cryptography scramble that the same hardware has set off. Her stories typically start with the paper, whether that is peer-reviewed work, conference proceedings or an arXiv preprint, with the source linked so you can hold a claim up against the research it came from. She is unimpressed by benchmarks that will not say what they beat, and by demonstrations that only work in the press release.

Latest Posts by Ivy Delaney: