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

arXiv:2610.09322

Cross-Validation of Open-Source Quantum Network Simulators

Joaquin Chung, Michal Hajdušek, Naphan Benchasattabuse, Robert J. Hayek, Alexander Kolar, Ansh Singal, Kento Samuel Soon, Kentaro Teramoto, Allen Zang, Caitao Zhan, Raj Kettimuthu, Rodney Van Meter

quant-phSubmitted Oct 7, 2026• Announced Oct 8, 2026• 1 citation
arXivHTMLPDF

Abstract

We present a comparative analysis of two open-source quantum network simulators, QuISP and SeQUeNCe, focusing on cross-validation of basic networking tasks to ensure consistency and accuracy in simulation outputs. Although both simulators are designed to study quantum network management policies and their dynamics under complex noise models, their differing underlying assumptions can lead to variations in simulation results. We highlight the discrepancies in how the two simulators handle connections, internal network node processing time, and classical communication, resulting in significant quantitative and qualitative differences in the time required to perform basic network tasks such as entanglement generation, purification, and swapping. We simulate common scenarios between the simulators to compare both the latency of resource distribution and the fidelity of the distributed resources. Our findings indicate that while the simulators differ in the time required to complete network tasks---a constant factor difference attributable to their respective connection models---they agree on the fidelity of the distributed resources under identical error parameters. This work demonstrates a crucial first step towards enhancing the reliability and reproducibility of quantum network simulations, as well as leading to full protocol development. Furthermore, our benchmarking methodology establishes a foundational set of tasks for the cross-validation of simulators to study future quantum networks.

AI Summary

Quantum-network simulators can produce different predictions for nominally similar configurations because their control protocols, timing assumptions, and noise conventions differ. This paper cross-validates the open-source simulators QuISP and SeQUeNCe, separating implementation consistency from differences in the networks they model. Four analytically tractable benchmarks test symmetric and asymmetric meet-in-the-middle entanglement generation, two-link entanglement swapping, and one round of BBPSSW purification without twirling. Generation tests request 1,000 Bell pairs over a 20 km link with 1–16 memories per node; swapping and purification use 40 km end-to-end separations. Closed-form timing and fidelity models, including stochastic waiting times for purification, are compared against simulation outputs. Gate-error and coherence-time conventions are explicitly translated between simulators. For symmetric generation, SeQUeNCe predicts completion times 4.16–4.33 times longer than QuISP, primarily because it repeats a three-way handshake for each generation attempt whereas QuISP amortizes connection setup. Moving the Bell-state analyzer away from the midpoint increases QuISP’s predicted generation time but leaves SeQUeNCe’s unchanged. Fidelity predictions agree for purification with perfect memories and generally agree for swapping with long-lived memories. Finite coherence times expose discrepancies associated with different waiting times and protocol schedules; QuISP generally predicts higher purification fidelity and throughput. Both simulators match their respective analytical models, and the comparison led to bug fixes. The study is limited to basic first-generation repeater scenarios. Larger networks, competing requests, other link architectures and repeater generations, and a fuller analysis of interacting communication and error-model differences remain future work.

Little sign of AI-generated textIncrementalOverclaims

Central claim may not hold: The abstract claims fidelity agreement under identical error parameters, whereas the results report finite-coherence-time fidelity differences in both swapping and purification, making agreement conditional rather than general. The reported symmetric-link completion-time ratio of 4.16–4.33 contradicts the stated timing equations, which predict a SeQUeNCe/QuISP ratio strictly below 4 for the specified parameters. The analytical purification output-fidelity expression omits decoherence during post-circuit result communication, despite the appendix defining the final resource as the state after that communication.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
18 pages, 9 figures, journal, 1 appendix

Related papers

Cross-Simulator Parity Validation of Quantum Network Entanglement Swapping: A Pre-Declared Validation Methodology with Two Independent Discrete-Event Simulators

David Vesterlund

We report three principal findings. First, two independent discrete-event quantum-network simulators—NetSquid 1.1.8 and SeQUeNCe 1.2.0—agree with an analytical Werner-swap oracle and with each other to machine precision in 160/160 state-level cases (max |ΔF| = 8.88×10−16) and in 50/50 protocol-level cases under matched source, channel, detector, heralding, retry, cutoff, BSM, readout, occupancy, latency, and goodput semantics. Second, when the shared harness is released and each simulator runs its own asynchronous event engine with independent random streams, mean output fidelity can be equivalent while the fidelity distributions differ strongly (Kolmogorov–Smirnov p≈10−27); a systematic timestamp-replay diagnosis localises this discrepancy to control/timing sampling rather than quantum-kernel disagreement. Third, a lightweight simulator (QMRB v0.2) with an incorrect Werner swap cross-term (/9 instead of /3) passes all counter-level parity checks but fails all 80 repeater fidelity comparisons with a mean error of 0.0235, demonstrating that modelform errors can be invisible at the counter level and silent until a fidelity threshold is crossed. To obtain these results we introduce a layered, pre-declared validation methodology comprising four layers: state-level parity, protocol-level parity, native-event parity, and model-form diagnosis. Each layer has an acceptance criterion frozen before execution. The methodology distinguishes implementation parity from model-form parity and from protocollevel parity, and reports explicit boundaries on what each layer does and does not establish.

International Journal of Mathematic Exploration and Computer Education•Oct 19, 2026•0 citations

SeQUeNCe: a customizable discrete-event simulator of quantum networks

Xiaoliang Wu, Alexander Kolar, Joaquín Chung +4 more

Recent advances in quantum information science enabled the development of quantum communication network prototypes and created an opportunity to study full-stack quantum network architectures. This work develops SeQUeNCe, a comprehensive, customizable quantum network simulator. Our simulator consists of five modules: hardware models, entanglement management protocols, resource management, network management, and application. This framework is suitable for simulation of quantum network prototypes that capture the breadth of current and future hardware technologies and protocols. We implement a comprehensive suite of network protocols and demonstrate the use of SeQUeNCe by simulating a photonic quantum network with nine routers equipped with quantum memories. The simulation capabilities are illustrated in three use cases. We show the dependence of quantum network throughput on several key hardware parameters and study the impact of classical control message latency. We also investigate quantum memory usage efficiency in routers and demonstrate that redistributing memory according to anticipated load increases network capacity by 69.1% and throughput by 6.8%. We design SeQUeNCe to enable comparisons of alternative quantum network technologies, experiment planning, and validation and to aid with new protocol design. We are releasing SeQUeNCe as an open source tool and aim to generate community interest in extending it.

arXiv:2009.12000•Quantum Science and Technology•Sep 1, 2021•171 citations

Efficient simulation of noisy entanglement generation

Lorenzo Brevi, Federico Grasselli, Alessandro Caraceni +3 more

End-to-end entanglement distribution is a key capability of upcoming quantum networks, enabling applications like distributed quantum computing, quantum sensor networks, and secure communications. Hence, its realistic and efficient simulation is crucial for quantum network design and for assessing the ability of a network to run certain applications. This work provides tools to scale-up and improve the realism of entanglement generation simulations in quantum networks. This is achieved by deriving analytical results that directly return the success probability, the output state and corresponding fidelity of a selected entanglement generation protocol, while accounting for a variety of noise sources affecting the protocol. These results are then integrated and streamlined in an upgraded version of SeQUeNCe, one of the most popular quantum network simulators. The resulting simulator features increased scalability by reducing computation time by more than 60%, while allowing for a variety of realistic noise sources, including imperfect mode matching, dark counts, and imperfect memory initialization. The simulator is also benchmarked with real experimental data and is capable of replicating the average entanglement generation time and the final state fidelity of a selected experiment. Altogether, the results can enhance current quantum network simulation capabilities towards large-scale networks, paving the way for the future quantum internet.

quant-pharXiv:2606.18808•Advanced Quantum Technologies•Jun 18, 2026•0 citations

Limitations of Error Model Approximations in Quantum Network Simulation

Julia Freund, Jorge Miguel-Ramiro, Julius Wallnöfer +1 more

Efficient classical simulation of large-scale quantum networks frequently relies on noise approximations, which consider a restricted set of operators to describe noisy channels and operations. In this work, we demonstrate how such simplified error models, such as Pauli twirling or reset channels, can lead to severe quantitative and qualitative discrepancies in protocol performance predictions. We analyze, in particular, how small differences can accumulate in iterative and sequential protocols such as entanglement purification, entanglement swapping, and repeater chains. Our results reveal that neglected error contributions can lead to important performance under- and over-estimations, measurement-outcome dependency, and oscillations in the fidelity, which are entirely overlooked by the simplified error model approximations. These results show that rigorous validation of complete noise architectures is indispensable for accurately predicting operational thresholds in future quantum technologies.

quant-pharXiv:2607.00998•Jul 2, 2026•0 citations

QuISP: a Quantum Internet Simulation Package

Ryosuke Satoh, Michal Hajdušek, Naphan Benchasattabuse +8 more

We present an open-source event-driven simulation package called QuISP built on top of the OMNeT++ discrete event simulation framework. Behavior of quantum devices in small quantum networks has been the focus of recent studies, it is still an open question how they will work in networks of practical size. QuISP is designed to simulate large-scale quantum networks to investigate their behavior under realistic, noisy and heterogeneous configurations. Our confidence in the simulator is supported by comparing its output to analytic results for a small network. QuISP can handle thousands of qubits in hundreds of nodes on a laptop computer, preparing for full Quantum Internet simulation. This simulator promotes the development of protocols for larger and complex quantum networks.

arXiv:2112.07093•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•103 citations

Simulation of a Heterogeneous Quantum Network

Hayden Miller, Caitao Zhan, Michael Bishof +4 more

Quantum networks are expected to be heterogeneous systems, combining distinct qubit platforms, photon wavelengths, and device timescales to achieve scalable, multiuser connectivity. Building and iterating on such systems is costly and slow, which motivates hardware-faithful simulations that explore architecture design space and justify implementation decisions. This paper presents a framework for simulating heterogeneous quantum networks based on SeQUeNCe, a discrete-event simulator of quantum networks. We introduce faithful device models for two representative platforms - Ytterbium atoms and superconducting qubits - to implement entanglement generation and swapping protocols for time-bin encoded photons. Using extensive simulations that account for disparate clock rates and quantum frequency conversion and transduction losses/noise, we map the rate-fidelity trade space and identify the dominant bottlenecks unique to heterogeneous systems. The models are open source and extensible, enabling reproducible evaluation of future heterogeneous designs and protocols.

quant-pharXiv:2512.04211•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Dec 5, 2025•2 citations
We present a comparative analysis of two open-source quantum network simulators, QuISP and SeQUeNCe, focusing on cross-validation of basic networking tasks to ensure consistency and accuracy in simulation outputs. Although both simulators are designed to study quantum network management policies and their dynamics under complex noise models, their differing underlying assumptions can lead to variations in simulation results. We highlight the discrepancies in how the two simulators handle connections, internal network node processing time, and classical communication, resulting in significant quantitative and qualitative differences in the time required to perform basic network tasks such as entanglement generation, purification, and swapping. We simulate common scenarios between the simulators to compare both the latency of resource distribution and the fidelity of the distributed resources. Our findings indicate that while the simulators differ in the time required to complete network tasks---a constant factor difference attributable to their respective connection models---they agree on the fidelity of the distributed resources under identical error parameters. This work demonstrates a crucial first step towards enhancing the reliability and reproducibility of quantum network simulations, as well as leading to full protocol development. Furthermore, our benchmarking methodology establishes a foundational set of tasks for the cross-validation of simulators to study future quantum networks.
Quantum-network simulators can produce different predictions for nominally similar configurations because their control protocols, timing assumptions, and noise conventions differ. This paper cross-validates the open-source simulators QuISP and SeQUeNCe, separating implementation consistency from differences in the networks they model.
Four analytically tractable benchmarks test symmetric and asymmetric meet-in-the-middle entanglement generation, two-link entanglement swapping, and one round of BBPSSW purification without twirling. Generation tests request 1,000 Bell pairs over a 20 km link with 1–16 memories per node; swapping and purification use 40 km end-to-end separations. Closed-form timing and fidelity models, including stochastic waiting times for purification, are compared against simulation outputs. Gate-error and coherence-time conventions are explicitly translated between simulators.
For symmetric generation, SeQUeNCe predicts completion times 4.16–4.33 times longer than QuISP, primarily because it repeats a three-way handshake for each generation attempt whereas QuISP amortizes connection setup. Moving the Bell-state analyzer away from the midpoint increases QuISP’s predicted generation time but leaves SeQUeNCe’s unchanged. Fidelity predictions agree for purification with perfect memories and generally agree for swapping with long-lived memories. Finite coherence times expose discrepancies associated with different waiting times and protocol schedules; QuISP generally predicts higher purification fidelity and throughput. Both simulators match their respective analytical models, and the comparison led to bug fixes.
The study is limited to basic first-generation repeater scenarios. Larger networks, competing requests, other link architectures and repeater generations, and a fuller analysis of interacting communication and error-model differences remain future work.
We report three principal findings. First, two independent discrete-event quantum-network simulators—NetSquid 1.1.8 and SeQUeNCe 1.2.0—agree with an analytical Werner-swap oracle and with each other to machine precision in 160/160 state-level cases (max |ΔF| = 8.88×10−16) and in 50/50 protocol-level cases under matched source, channel, detector, heralding, retry, cutoff, BSM, readout, occupancy, latency, and goodput semantics. Second, when the shared harness is released and each simulator runs its own asynchronous event engine with independent random streams, mean output fidelity can be equivalent while the fidelity distributions differ strongly (Kolmogorov–Smirnov p≈10−27); a systematic timestamp-replay diagnosis localises this discrepancy to control/timing sampling rather than quantum-kernel disagreement. Third, a lightweight simulator (QMRB v0.2) with an incorrect Werner swap cross-term (/9 instead of /3) passes all counter-level parity checks but fails all 80 repeater fidelity comparisons with a mean error of 0.0235, demonstrating that modelform errors can be invisible at the counter level and silent until a fidelity threshold is crossed. To obtain these results we introduce a layered, pre-declared validation methodology comprising four layers: state-level parity, protocol-level parity, native-event parity, and model-form diagnosis. Each layer has an acceptance criterion frozen before execution. The methodology distinguishes implementation parity from model-form parity and from protocollevel parity, and reports explicit boundaries on what each layer does and does not establish.
Recent advances in quantum information science enabled the development of quantum communication network prototypes and created an opportunity to study full-stack quantum network architectures. This work develops SeQUeNCe, a comprehensive, customizable quantum network simulator. Our simulator consists of five modules: hardware models, entanglement management protocols, resource management, network management, and application. This framework is suitable for simulation of quantum network prototypes that capture the breadth of current and future hardware technologies and protocols. We implement a comprehensive suite of network protocols and demonstrate the use of SeQUeNCe by simulating a photonic quantum network with nine routers equipped with quantum memories. The simulation capabilities are illustrated in three use cases. We show the dependence of quantum network throughput on several key hardware parameters and study the impact of classical control message latency. We also investigate quantum memory usage efficiency in routers and demonstrate that redistributing memory according to anticipated load increases network capacity by 69.1% and throughput by 6.8%. We design SeQUeNCe to enable comparisons of alternative quantum network technologies, experiment planning, and validation and to aid with new protocol design. We are releasing SeQUeNCe as an open source tool and aim to generate community interest in extending it.
End-to-end entanglement distribution is a key capability of upcoming quantum networks, enabling applications like distributed quantum computing, quantum sensor networks, and secure communications. Hence, its realistic and efficient simulation is crucial for quantum network design and for assessing the ability of a network to run certain applications. This work provides tools to scale-up and improve the realism of entanglement generation simulations in quantum networks. This is achieved by deriving analytical results that directly return the success probability, the output state and corresponding fidelity of a selected entanglement generation protocol, while accounting for a variety of noise sources affecting the protocol. These results are then integrated and streamlined in an upgraded version of SeQUeNCe, one of the most popular quantum network simulators. The resulting simulator features increased scalability by reducing computation time by more than 60%, while allowing for a variety of realistic noise sources, including imperfect mode matching, dark counts, and imperfect memory initialization. The simulator is also benchmarked with real experimental data and is capable of replicating the average entanglement generation time and the final state fidelity of a selected experiment. Altogether, the results can enhance current quantum network simulation capabilities towards large-scale networks, paving the way for the future quantum internet.
Efficient classical simulation of large-scale quantum networks frequently relies on noise approximations, which consider a restricted set of operators to describe noisy channels and operations. In this work, we demonstrate how such simplified error models, such as Pauli twirling or reset channels, can lead to severe quantitative and qualitative discrepancies in protocol performance predictions. We analyze, in particular, how small differences can accumulate in iterative and sequential protocols such as entanglement purification, entanglement swapping, and repeater chains. Our results reveal that neglected error contributions can lead to important performance under- and over-estimations, measurement-outcome dependency, and oscillations in the fidelity, which are entirely overlooked by the simplified error model approximations. These results show that rigorous validation of complete noise architectures is indispensable for accurately predicting operational thresholds in future quantum technologies.
We present an open-source event-driven simulation package called QuISP built on top of the OMNeT++ discrete event simulation framework. Behavior of quantum devices in small quantum networks has been the focus of recent studies, it is still an open question how they will work in networks of practical size. QuISP is designed to simulate large-scale quantum networks to investigate their behavior under realistic, noisy and heterogeneous configurations. Our confidence in the simulator is supported by comparing its output to analytic results for a small network. QuISP can handle thousands of qubits in hundreds of nodes on a laptop computer, preparing for full Quantum Internet simulation. This simulator promotes the development of protocols for larger and complex quantum networks.
Quantum networks are expected to be heterogeneous systems, combining distinct qubit platforms, photon wavelengths, and device timescales to achieve scalable, multiuser connectivity. Building and iterating on such systems is costly and slow, which motivates hardware-faithful simulations that explore architecture design space and justify implementation decisions. This paper presents a framework for simulating heterogeneous quantum networks based on SeQUeNCe, a discrete-event simulator of quantum networks. We introduce faithful device models for two representative platforms - Ytterbium atoms and superconducting qubits - to implement entanglement generation and swapping protocols for time-bin encoded photons. Using extensive simulations that account for disparate clock rates and quantum frequency conversion and transduction losses/noise, we map the rate-fidelity trade space and identify the dominant bottlenecks unique to heterogeneous systems. The models are open source and extensible, enabling reproducible evaluation of future heterogeneous designs and protocols.