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:2607.00998

Limitations of Error Model Approximations in Quantum Network Simulation

Julia Freund, Jorge Miguel-Ramiro, Julius Wallnöfer, Wolfgang Dür

quant-phSubmitted Jul 1, 2026• Announced Jul 2, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
18 pages, 11 figures

Related papers

Comparison of a quantum error-correction threshold for exact and approximate errors

Mauricio Gutiérrez, Kenneth R. Brown

Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit, more accurate approximations that still allow for efficient simulation can be obtained by including Clifford operators and Pauli operators conditional on measurement. We examine the feasibility of employing these expanded error approximations to obtain better threshold estimates. We calculate the level-1 pseudothreshold for the Steane [[7,1,3]] code for amplitude damping and dephasing along a non-Clifford axis. The expanded channels estimate the actual channel action more accurately than the Pauli channels before error correction. However, after error correction, the Pauli twirling approximation yields very accurate estimates of the performance of quantum error-correcting protocols in the presence of the actual noise channel.

arXiv:1501.00068•Physical Review A•Feb 27, 2015•51 citations

Resource estimation for entanglement routing in quantum networks

Manik Dawar, Ralf Riedinger, Nilesh Vyas +1 more

Quantum repeaters have promised efficient scaling of quantum networks for over two decades. Despite numerous platforms proclaiming functional repeaters, the realization of large-scale networks remains elusive, indicating that the resources required to do so were thus far underestimated. Here, we investigate the dependence of the resource scaling of networks on realistic experimental errors. Using a nested repeater protocol based on the purification protocol by Bennett [], we provide an analytical approximation of the polynomial degree of the resources consumed by entanglement routing. Our error model predicts substantially stricter thresholds for efficient network operation than previously suggested, requiring two-qubit gate errors below 1.3% for resource scaling with polynomial degree below 10. The analytical model presented here provides insight into the reason why previous experimental implementations of quantum repeaters failed to scale efficiently and inform the development of truly scalable systems, highlighting the need for high-fidelity local two-qubit gates. We employ our analytical approximation of the scaling exponent as a figure of merit to compare different platforms and find that trapped ions and color centers in diamond currently provide the best route towards large-scale networks.

arXiv:2410.10512•Physical Review A•Dec 23, 2025•6 citations

Realistic Simulation of Quantum Repeater with Encoding and Classical Error Correction

Sagar Patange, Caitao Zhan, Bikun Li +4 more

Quantum repeaters are essential for scalable long-distance quantum networking. As quantum information processing moves toward fault-tolerant and error-corrected operations, it becomes increasingly important to study quantum repeaters that also move beyond raw physical entanglement and towards logical entanglement. In this paper, we implement and simulate the quantum repeater with encoding and classical error correction (QRE-CEC) protocol in SeQUeNCe, a discrete-event simulator of quantum networks. The protocol distributes logical Bell pairs, performs encoded entanglement swapping, and uses classical error correction for the decoding of entanglement swapping measurement outcomes to determine Pauli-frame corrections. For this study, we extend SeQUeNCe with a stabilizer-based backend, add support for CSS code-based encoded operations, and integrate gate, measurement, idle decoherence, and state-initialization noise models. Our simulation results show that QRE-CEC suppresses all modeled errors to the second order. Also, QRE-CEC can distribute logical Bell pairs with 0.91 fidelity over a distance of 2000 km under the parameter regimes we study. Beyond protocol-level performance evaluation, our implementation exposes practical simulator and control-plane challenges that are typically abstracted away in theoretical studies.

quant-pharXiv:2605.06928•May 11, 2026•1 citation

Color code thresholds under circuit-level noise beyond the Pauli framework

Francesco Pio Barone, Daniel Jaschke, Ilaria Siloi +1 more

A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits. This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering stochastic Pauli noise models, as they are compatible with efficient classical simulation techniques. However, such noise models do not fully capture the variety of physical error mechanisms encountered in realistic quantum platforms. In this work, we extend circuit-level noise modeling beyond the Pauli framework by estimating the threshold of the hexagonal color code under more general noise models. Specifically, we consider two representative non-Pauli error channels: a systematic $X$-rotation model that introduces coherent over-rotations, and an amplitude damping channel that captures relaxation processes. These models are incorporated at the circuit level into color code circuits using a Tree Tensor Network ansatz. Our simulations demonstrate that tensor network simulations enable accurate threshold estimation under non-Pauli noise for color codes up to distance $d=7$ (73 qubits). Comparing our results with the Pauli twirling approximations of the noise models, we find that coherent over-rotations yield systematically higher error rates, deviating from the Pauli twirling approximation as the code distance increases.

quant-pharXiv:2511.05719•Quantum Science and Technology•Nov 11, 2025•4 citations

Accurate modeling of noise in quantum error correcting circuits

Mauricio Gutierrez Arguedas

A universal, scalable quantum computer will require the use of quantum error correction in order to achieve fault tolerance. The assessment and comparison of error-correcting strategies is performed by classical simulation. However, due to the prohibitive exponential scaling of general quantum circuits, simulations are restrained to specific subsets of quantum operations. This creates a gap between accuracy and efficiency which is particularly problematic when modeling noise, because most realistic noise models are not efficiently simulable on a classical computer. We have introduced extensions to the Pauli channel, the traditional error channel employed to model noise in simulations of quantum circuits. These expanded error channels are still computationally tractable to simulate, but result in more accurate approximations to realistic error channels at the single qubit level. Using the Steane [[7,1,3]] code, we have also investigated the behavior of these expanded channels at the logical error-corrected level. We have found that it depends strongly on whether the error is incoherent or coherent. In general, the Pauli channel will be an excellent approximation to incoherent channels, but an unsatisfactory one for coherent channels, especially because it severely underestimates the magnitude of the error. Finally, we also studied the honesty and accuracy of the expanded channels at the logical level. Our results suggest that these measures can be employed to generate lower and upper bounds to a quantum code's threshold under the influence of a specific error channel.

•Nov 16, 2015•0 citations

Cross-Validation of Open-Source Quantum Network Simulators

Joaquin Chung, Michal Hajdušek, Naphan Benchasattabuse +9 more

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.

quant-pharXiv:2610.09322•Oct 8, 2026•1 citation
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.
Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit, more accurate approximations that still allow for efficient simulation can be obtained by including Clifford operators and Pauli operators conditional on measurement. We examine the feasibility of employing these expanded error approximations to obtain better threshold estimates. We calculate the level-1 pseudothreshold for the Steane [[7,1,3]] code for amplitude damping and dephasing along a non-Clifford axis. The expanded channels estimate the actual channel action more accurately than the Pauli channels before error correction. However, after error correction, the Pauli twirling approximation yields very accurate estimates of the performance of quantum error-correcting protocols in the presence of the actual noise channel.
Quantum repeaters have promised efficient scaling of quantum networks for over two decades. Despite numerous platforms proclaiming functional repeaters, the realization of large-scale networks remains elusive, indicating that the resources required to do so were thus far underestimated. Here, we investigate the dependence of the resource scaling of networks on realistic experimental errors. Using a nested repeater protocol based on the purification protocol by Bennett [], we provide an analytical approximation of the polynomial degree of the resources consumed by entanglement routing. Our error model predicts substantially stricter thresholds for efficient network operation than previously suggested, requiring two-qubit gate errors below 1.3% for resource scaling with polynomial degree below 10. The analytical model presented here provides insight into the reason why previous experimental implementations of quantum repeaters failed to scale efficiently and inform the development of truly scalable systems, highlighting the need for high-fidelity local two-qubit gates. We employ our analytical approximation of the scaling exponent as a figure of merit to compare different platforms and find that trapped ions and color centers in diamond currently provide the best route towards large-scale networks.
Quantum repeaters are essential for scalable long-distance quantum networking. As quantum information processing moves toward fault-tolerant and error-corrected operations, it becomes increasingly important to study quantum repeaters that also move beyond raw physical entanglement and towards logical entanglement. In this paper, we implement and simulate the quantum repeater with encoding and classical error correction (QRE-CEC) protocol in SeQUeNCe, a discrete-event simulator of quantum networks. The protocol distributes logical Bell pairs, performs encoded entanglement swapping, and uses classical error correction for the decoding of entanglement swapping measurement outcomes to determine Pauli-frame corrections. For this study, we extend SeQUeNCe with a stabilizer-based backend, add support for CSS code-based encoded operations, and integrate gate, measurement, idle decoherence, and state-initialization noise models. Our simulation results show that QRE-CEC suppresses all modeled errors to the second order. Also, QRE-CEC can distribute logical Bell pairs with 0.91 fidelity over a distance of 2000 km under the parameter regimes we study. Beyond protocol-level performance evaluation, our implementation exposes practical simulator and control-plane challenges that are typically abstracted away in theoretical studies.
A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits. This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering stochastic Pauli noise models, as they are compatible with efficient classical simulation techniques. However, such noise models do not fully capture the variety of physical error mechanisms encountered in realistic quantum platforms. In this work, we extend circuit-level noise modeling beyond the Pauli framework by estimating the threshold of the hexagonal color code under more general noise models. Specifically, we consider two representative non-Pauli error channels: a systematic XXX-rotation model that introduces coherent over-rotations, and an amplitude damping channel that captures relaxation processes. These models are incorporated at the circuit level into color code circuits using a Tree Tensor Network ansatz. Our simulations demonstrate that tensor network simulations enable accurate threshold estimation under non-Pauli noise for color codes up to distance d=7d=7d=7 (73 qubits). Comparing our results with the Pauli twirling approximations of the noise models, we find that coherent over-rotations yield systematically higher error rates, deviating from the Pauli twirling approximation as the code distance increases.
A universal, scalable quantum computer will require the use of quantum error correction in order to achieve fault tolerance. The assessment and comparison of error-correcting strategies is performed by classical simulation. However, due to the prohibitive exponential scaling of general quantum circuits, simulations are restrained to specific subsets of quantum operations. This creates a gap between accuracy and efficiency which is particularly problematic when modeling noise, because most realistic noise models are not efficiently simulable on a classical computer. We have introduced extensions to the Pauli channel, the traditional error channel employed to model noise in simulations of quantum circuits. These expanded error channels are still computationally tractable to simulate, but result in more accurate approximations to realistic error channels at the single qubit level. Using the Steane [[7,1,3]] code, we have also investigated the behavior of these expanded channels at the logical error-corrected level. We have found that it depends strongly on whether the error is incoherent or coherent. In general, the Pauli channel will be an excellent approximation to incoherent channels, but an unsatisfactory one for coherent channels, especially because it severely underestimates the magnitude of the error. Finally, we also studied the honesty and accuracy of the expanded channels at the logical level. Our results suggest that these measures can be employed to generate lower and upper bounds to a quantum code's threshold under the influence of a specific error channel.
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.