Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

dqc_simulator: an easy-to-use distributed quantum computing simulator

Kenny Campbell

Published Jan 1, 2026• 1 citation
Publisher
DOI
10.2139/ssrn.6614760

Related papers

QCSim, Quantum Computation Simulator

Paul E. Black

•Dec 1, 2003•0 citations

dqc_simulator: an easy-to-use distributed quantum computing simulator

Kenny Campbell

Distributed quantum computing (DQC) is a promising proposal for overcoming the scalability challenges of quantum computing. However, the evaluation of DQC hardware and software is difficult due to the relative dearth of classical simulation tools available for DQC devices. In this work, we introduce dqc_simulator, a novel simulation toolkit, written in Python, which automates many of the most challenging aspects of the DQC simulation workflow. dqc_simulator enables the easy simulation of both hardware and software, making it easy to create realistic and robust tests and benchmarks for the full DQC stack.

quant-pharXiv:2604.13909•Apr 16, 2026•0 citations

Simulation of Distributed Quantum Computing based on Teleportation

Benedikt Baier, Leo Sünkel, Wolfgang Kellerer

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.

International Conference on Communications•May 24, 2026•0 citations

HpQC: A New Efficient Quantum Computing Simulator

Haodong Bian, Jianqiang Huang, Runting Dong +2 more

Lecture notes in computer science•Jan 1, 2020•6 citations

QCMPI: A parallel environment for quantum computing

Frank Tabakin A, Bruno Juliá-Díaz

arXiv:0902.0699•Computer Physics Communications•Dec 1, 2008•27 citations

A Design Framework for the Simulation of Distributed Quantum Computing

Davide Ferrari, Michele Amoretti

The growing demand for large-scale quantum computers is pushing research on Distributed Quantum Computing (DQC). Recent experimental efforts have demonstrated some of the building blocks for such a design. DQC systems are clusters of quantum processing units (QPUs) connected by means of quantum network infrastructures. Their extension ranges from the single box to the geographical scale. Furthermore, they can be integrated with classical High Performance Computing systems. Simulation modeling of DQC architectures provides a safe way to test and explore different what-if scenarios. Many simulation tools have been developed to support the research community in designing and evaluating quantum computer and quantum network technologies, including hardware, protocols, and applications. However, a framework for DQC simulation putting equal emphasis on computational and networking aspects has never been proposed, so far. In this paper, a design framework for DQC simulation is presented, whose core component is an Execution Manager that schedules DQC jobs for running on networked quantum computers. Two metrics are proposed for evaluating the impact of the job scheduling algorithms with respect to QPU utilization and quantum network utilization, beyond the traditional concept of makespan. The discussion is supported by a DQC job scheduling example, where two different strategies are compared in terms of the proposed metrics.

arXiv:2306.11539•Jun 3, 2024•10 citations
Distributed quantum computing (DQC) is a promising proposal for overcoming the scalability challenges of quantum computing. However, the evaluation of DQC hardware and software is difficult due to the relative dearth of classical simulation tools available for DQC devices. In this work, we introduce dqc_simulator, a novel simulation toolkit, written in Python, which automates many of the most challenging aspects of the DQC simulation workflow. dqc_simulator enables the easy simulation of both hardware and software, making it easy to create realistic and robust tests and benchmarks for the full DQC stack.
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.
The growing demand for large-scale quantum computers is pushing research on Distributed Quantum Computing (DQC). Recent experimental efforts have demonstrated some of the building blocks for such a design. DQC systems are clusters of quantum processing units (QPUs) connected by means of quantum network infrastructures. Their extension ranges from the single box to the geographical scale. Furthermore, they can be integrated with classical High Performance Computing systems. Simulation modeling of DQC architectures provides a safe way to test and explore different what-if scenarios. Many simulation tools have been developed to support the research community in designing and evaluating quantum computer and quantum network technologies, including hardware, protocols, and applications. However, a framework for DQC simulation putting equal emphasis on computational and networking aspects has never been proposed, so far. In this paper, a design framework for DQC simulation is presented, whose core component is an Execution Manager that schedules DQC jobs for running on networked quantum computers. Two metrics are proposed for evaluating the impact of the job scheduling algorithms with respect to QPU utilization and quantum network utilization, beyond the traditional concept of makespan. The discussion is supported by a DQC job scheduling example, where two different strategies are compared in terms of the proposed metrics.