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.
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.
Quantum computing has made substantial progress in recent years; however, its scalability remains constrained on a monolithic quantum processing unit (QPU). Distributed quantum computing (DQC) offers a pathway by coordinating multiple QPUs to execute large-scale circuits. Yet, DQC still faces practical barriers, as its realization depends on advances in hardware-level components such as quantum transducers and high-fidelity entanglement-distribution modules. While these technologies continue to improve, mature DQC platforms remain unavailable. In the meantime, researchers need to assess the benefits of DQC and evaluate emerging DQC designs, but the software ecosystem lacks a circuit-level simulator that models heterogeneous backends, noisy connections, and distributed execution. To fill this gap, this paper proposes SimDisQ, the first end-to-end circuit-level DQC simulator, composed of a set of novel DQC-oriented automated simulation toolkits and communication noise models that can interoperate with existing toolkits in mainstream quantum software ecosystems. Leveraging circuit-level simulation capabilities, SimDisQ enables quantitative exploration of architectural design trade-offs, communication fidelity constraints, and new circuit optimization challenges introduced by DQC, providing a foundation for future research in this promising direction. Benchmarking experiments using SimDisQ respond to a couple of open questions in the community; for example, noisy simulation of superconducting and trapped-ion qubits, with a reasonable entanglement-distribution fidelity, reveal that heterogeneous QPUs can indeed yield higher execution fidelity.
Distributed quantum computing (DQC) seeks to scale beyond the limits of monolithic processors by interconnecting multiple quantum processing units (QPUs) through entanglement-based links. Realizing this vision requires the co-design of hardware and software across the domains of quantum networking, compilation, and scheduling, yet existing tools remain fragmented between monolithic circuit compilers and long-distance quantum network simulators. We present an open-source, topology-informed framework for the compilation and scheduling of distributed quantum programs. Given an input circuit and a description of the target network, the framework partitions and reconstructs the circuit into a distributed program that respects the specified inter- and intra-QPU topology, covers cross-QPU operations through gate and state teleportation, and schedules the result under either deterministic or stochastic entanglement-generation models. By accepting and emitting standard OpenQASM, the framework interoperates with existing monolithic toolchains, and its standardized module interfaces allow partitioning and scheduling strategies to be interchanged and benchmarked. Using this framework, we show that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution. These findings underscore the need for a co-design approach to distributed quantum computing, which our framework is designed to support.
Distributed quantum computing (DQC) uses quantum communication to pool the computational power of multiple quantum processors (QPU). Since qubits in a DQC system are not necessarily co-located, interactions between non-co-located qubits require quantum teleportation, which relies on entanglement to transfer qubit states between distant nodes. As DQC typically requires many teleportations, quantum networks must efficiently generate and distribute high-fidelity entanglement to enable these teleportations. However, since large-scale quantum networks are not yet available, simulations are essential to understand their impact on DQC performance. This paper presents a simulation-based evaluation of teleportation-based DQC under varying real-world network conditions and two distribution schemes. Network parameters such as maximum connection length, entanglement fidelity, and quantum memory coherence time are evaluated using two small-scale Grover circuits to show the impact on computational fidelity and execution delay. The results show that computation fidelity drops sharply below practical thresholds when entanglement fidelity falls below 0.95 or memory coherence is under 1s. Additionally, a runtime analysis shows a 32 times increase in simulation time when both circuit width and circuit depth are increased.
We describe the development of the NetQStack Simulator, a network-integrated simulation framework designed to evaluate distributed quantum computing (DQC) within data center environments. Our approach strictly models the network topology, classical control plane, and quantum data plane required to execute distributed quantum workloads. The simulator models classical and physical-layer protocol synchronization, schedules sub-circuit executions on individual Quantum Processing Units (QPUs), and routes entanglement generation requests across Bell State Measurement (BSM) nodes. With the ability to use external network-aware circuit partitioning software, and interface with an intelligent quantum network controller, this architecture enables researchers to execute fully distributed algorithms while rigorously evaluating the impact of network latency, routing heuristics, and control-plane overhead. Our early results demonstrate that a network-integrated approach provides useful insights when assessing the performance and scalability of distributed quantum algorithms.
Abstract Distributed quantum computing requires compiler infrastructure capable of partitioning quantum circuits across multiple quantum processing units (QPUs) and synthesizing entanglement-assisted communication channels. Existing quantum compilers—including Qiskit, t|ket⟩, and BQSKit—operate on single-QPU execution models and lack native support for multi-QPU intermediate representations. We present DQC, an MLIR-based distributed quantum compiler featuring a custom dqc dialect and a five-pass compilation pipeline: (1) interaction-graph-based qubit partitioning with weighted edge-cut minimization, (2) TeleGate synthesis replacing cross-QPU gates with EPR pair allocations and quantum teleportation sequences, (3) greedy operation reordering for communication pre-staging, (4) MPI dialect lowering for distributed runtime abstraction, and (5) LLVM IR emission targeting a quantum simulation runtime. We evaluate DQC on a distributed 4-qubit Quantum Fourier Transform and four additional benchmarks, demonstrating correct multi-QPU execution with verified quantum state output. To our knowledge, DQC is the first open-source MLIR-native compiler infrastructure targeting distributed quantum circuit execution with end-to-end compilation from high-level quantum IR to executable LLVM IR.
As distributed quantum computing (DQC) offers a leading path towards scalable quantum computation, the ability to benchmark distributed algorithms under realistic conditions becomes critical for system co-design. However, without access to physical systems, researchers lack tools to evaluate distribution protocols. We introduce Q-DICE (Quantum Distributed Interconnect Compiler and Emulator), a hardware-aware emulation environment for benchmarking distributed quantum circuits on classical simulators and on NISQ-era monolithic hardware. This work provides three core contributions: (1) a programmatic scheme to construct distributed QPU backends, utilizing two novel techniques - QPU slicing and stitching - to facilitate distributed circuit mapping, (2) a methodology for modeling nonlocal link noise using physically motivated Kraus operators and stochastic error channels, and (3) a boundary-aware circuit mapping algorithm enforcing distributed QPU topology constraints during transpilation. Together, these components constitute a distribution-aware compiler and noise-modeling engine that faithfully enforces the physical limitations of distributed quantum hardware within existing execution environments. We validate Q-DICE against a multitude of experimentally demonstrated quantum circuits, including a distributed Grover's search on optically linked trapped-ion hardware, achieving a worst-case fidelity deviation of 4% between simulated and experimental results. These findings demonstrate Q-DICE's capacity to accurately reproduce real distributed quantum system behavior across platforms, streamlining experimentation with distributed quantum algorithms and architectures.