Distributed quantum computing simulator models execution strategies and success rates

SeQUeNCe.DQC: Full-stack Simulation of Distributed Quantum Computing

Networking and Internet ArchitectureDistributed, Parallel, and Cluster Computing

Summary

Building big quantum computers is hard, so scientists connect smaller quantum chips to work together. The authors created SeQUeNCe.DQC, a tool that turns regular quantum programs into plans that match the connections between these chips. They tested their tool by simulating an experiment and matched its success rates. They also showed how different ways of compiling and the computer’s layout affect how fast and well these programs run. This tool helps design better software and hardware for connected quantum computers.

What this means in practice

Authors

Sanjay Suresh, Caitao Zhan, Joaquin Chung, Rajkumar Kettimuthu

Abstract

Distributed quantum computing (DQC) connects multiple quantum processing units to overcome the scale limits of monolithic hardware. We introduce SeQUeNCe.DQC, a new top-level module within the SeQUeNCe package that compiles monolithic circuits into topology-aware execution plans and coordinates their execution using SeQUeNCe's existing quantum-network modules and protocols. We validate SeQUeNCe.DQC by reproducing a two-node trapped-ion Grover experiment in simulation and comparing success probabilities with the reported 71% benchmark. We then evaluate how compiler strategy, topology, and memory capacity jointly govern distributed circuit execution time and success rate. In these experiments, our hybrid compilers successfully identified mixed TeleGate/TeleData execution plans that outperformed pure gate-teleportation strategies. By capturing the physical overhead of distributed quantum primitives, SeQUeNCe.DQC provides a rigorous platform for co-designing DQC software and hardware architectures.