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:1508.02141 · Physical Review A

Analysis of quantum network coding for realistic repeater networks

Takahiko Satoh, Kaori Ishizaki, Shota Nagayama, Rodney Van Meter

Published Mar 1, 2016• 46 citations
arXivHTMLPDF

Abstract

Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quantum information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity $F<0.90$, even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.

DOI
10.1103/physreva.93.032302

Related papers

Analysis of measurement-based quantum network coding over repeater networks under noisy conditions

Takaaki Matsuo, Takahiko Satoh, Shota Nagayama +1 more

Quantum network coding is an effective solution for alleviating bottlenecks in quantum networks. We introduce a measurement-based quantum network coding scheme for quantum repeater networks (MQNC), and analyze its behavior based on results acquired from Monte Carlo simulation that includes various error sources over a butterfly network. By exploiting measurement-based quantum computing, operation on qubits for completing network coding proceeds in parallel. We show that such an approach offers advantages over other schemes in terms of the quantum circuit depth and therefore improves the communication fidelity without disturbing the aggregate throughput. The circuit depth of our protocol has been reduced by 56.5% compared to the quantum network coding scheme (QNC) introduced in 2012 by Satoh et al. For MQNC, we have found that the resulting entangled pairs' joint fidelity drops below 50% when the accuracy of local operations is lower than 98.9%, assuming that all initial Bell pairs across quantum repeaters have a fixed fidelity of 98%. Overall, MQNC showed substantially higher error tolerance compared to QNC and slightly better than buffer space multiplexing using step-by-step entanglement swapping, but not quite as strong as simultaneous entanglement swapping operations.

arXiv:1710.04827•Physical Review A•Jun 20, 2018•33 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

Interoperability in encoded quantum repeater networks

Shota Nagayama, Byung-Soo Choi, Simon J. Devitt +2 more

The future of quantum repeater networking will require interoperability between various error-correcting codes. A few specific code conversions and even a generalized method are known, however, no detailed analysis of these techniques in the context of quantum networking has been performed. In this paper we analyze a generalized procedure to create Bell pairs encoded heterogeneously between two separate codes used often in error-corrected quantum repeater network designs. We begin with a physical Bell pair and then encode each qubit in a different error-correcting code, using entanglement purification to increase the fidelity. We investigate three separate protocols for preparing the purified encoded Bell pair. We calculate the error probability of those schemes between the Steane [[7,1,3]] code, a distance-3 surface code, and single physical qubits by Monte Carlo simulation under a standard Pauli error model and estimate the resource efficiency of the procedures. A local gate error rate of ${10}^{\ensuremath{-}3}$ allows us to create high-fidelity logical Bell pairs between any of our chosen codes. We find that a postselected model, where any detected parity flips in code stabilizers result in a restart of the protocol, performs the best.

arXiv:1508.04599•Physical Review A•Apr 26, 2016•17 citations

Scheduling Compact Error Correcting Codes in Entanglement Distribution Networks

Keith Kenemer, Michelle Chalupnik, Michelle Fernandez +2 more

A fundamental challenge in generating and distributing high-fidelity entanglement in quantum repeater networks is the management and suppression of quantum errors. In this work, we develop an approach for extending the effective coherence time of shared entanglement between nodes by utilizing compact quantum error correcting (QEC) codes, which are scheduled and run locally on resource-constrained repeaters, to maximize the fidelity of the shared state, while also accounting for the incurred gate noise from QEC circuit operations. This local QEC approach stabilizes the distributed state via local operations, so independent execution on the nodes requires no additional synchronization or protocol overhead. Simulation results show significant improvements in the effective coherence time relative to idle decay, suggesting this approach could be useful in several quantum networking protocols such as entanglement generation, swapping, purification, and teleportation.

Workshop on Quantum Networks and Distributed Quantum Computing (QuNet)•Aug 16, 2023•0 citations

On the Analysis of Quantum Repeater Chains with Sequential Swaps

Matheus Guedes de Andrade, Emily A. Van Milligen, Leonardo Bacciottini +5 more

We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.

arXiv:2405.18252•May 28, 2024•16 citations

Design and Evaluation of Communication Protocols for Quantum Repeater Networks

Luciano Aparicio

When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.

•Sep 27, 2011•2 citations
Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quantum information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity F<0.90F<0.90F<0.90, even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.
Quantum network coding is an effective solution for alleviating bottlenecks in quantum networks. We introduce a measurement-based quantum network coding scheme for quantum repeater networks (MQNC), and analyze its behavior based on results acquired from Monte Carlo simulation that includes various error sources over a butterfly network. By exploiting measurement-based quantum computing, operation on qubits for completing network coding proceeds in parallel. We show that such an approach offers advantages over other schemes in terms of the quantum circuit depth and therefore improves the communication fidelity without disturbing the aggregate throughput. The circuit depth of our protocol has been reduced by 56.5% compared to the quantum network coding scheme (QNC) introduced in 2012 by Satoh et al. For MQNC, we have found that the resulting entangled pairs' joint fidelity drops below 50% when the accuracy of local operations is lower than 98.9%, assuming that all initial Bell pairs across quantum repeaters have a fixed fidelity of 98%. Overall, MQNC showed substantially higher error tolerance compared to QNC and slightly better than buffer space multiplexing using step-by-step entanglement swapping, but not quite as strong as simultaneous entanglement swapping operations.
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.
The future of quantum repeater networking will require interoperability between various error-correcting codes. A few specific code conversions and even a generalized method are known, however, no detailed analysis of these techniques in the context of quantum networking has been performed. In this paper we analyze a generalized procedure to create Bell pairs encoded heterogeneously between two separate codes used often in error-corrected quantum repeater network designs. We begin with a physical Bell pair and then encode each qubit in a different error-correcting code, using entanglement purification to increase the fidelity. We investigate three separate protocols for preparing the purified encoded Bell pair. We calculate the error probability of those schemes between the Steane [[7,1,3]] code, a distance-3 surface code, and single physical qubits by Monte Carlo simulation under a standard Pauli error model and estimate the resource efficiency of the procedures. A local gate error rate of ${10}^{\ensuremath{-}3}$ allows us to create high-fidelity logical Bell pairs between any of our chosen codes. We find that a postselected model, where any detected parity flips in code stabilizers result in a restart of the protocol, performs the best.
A fundamental challenge in generating and distributing high-fidelity entanglement in quantum repeater networks is the management and suppression of quantum errors. In this work, we develop an approach for extending the effective coherence time of shared entanglement between nodes by utilizing compact quantum error correcting (QEC) codes, which are scheduled and run locally on resource-constrained repeaters, to maximize the fidelity of the shared state, while also accounting for the incurred gate noise from QEC circuit operations. This local QEC approach stabilizes the distributed state via local operations, so independent execution on the nodes requires no additional synchronization or protocol overhead. Simulation results show significant improvements in the effective coherence time relative to idle decay, suggesting this approach could be useful in several quantum networking protocols such as entanglement generation, swapping, purification, and teleportation.
We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.