An important advance in repeater design has been the introduction of error correction-based connection architectures. The two principal ideas are the Calderbank-Shor-Steane (CSS) code-based approach [JIA 09] and the surface code-based approach [FOW 10]. This chapter gives a very brief introduction to quantum error correction (QEC) and then look at these two connection architectures. The two quantum error correction-based schemes presented here represents a significant advance in our capabilities, potentially altering the demands made of the underlying physical layer, especially memory time, and may simplify the network architecture by reducing the number of nodes that each repeater must communicate with. The chapter concludes that these approaches present different challenges in resource management than purify-and-swap repeaters.
An important advance in repeater design has been the introduction of error correction-based connection architectures. The two principal ideas are the Calderbank-Shor-Steane (CSS) code-based approach [JIA 09] and the surface code-based approach [FOW 10]. This chapter gives a very brief introduction to quantum error correction (QEC) and then look at these two connection architectures. The two quantum error correction-based schemes presented here represents a significant advance in our capabilities, potentially altering the demands made of the underlying physical layer, especially memory time, and may simplify the network architecture by reducing the number of nodes that each repeater must communicate with. The chapter concludes that these approaches present different challenges in resource management than purify-and-swap repeaters.
Abstract Quantum repeater is the key technology enabler for long-distance quantum communication. To date, most of the existing quantum repeater protocols are designed based on specific quantum codes or graph states. In this paper, we propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction, which can be adapted to any Calderbank–Shor–Steane code including the recently discovered quantum low-density parity check (QLDPC) codes. We present a decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network. This procedure not only outperforms the conventional protocols with independent repeaters but also simplifies the local quantum operations at repeaters. As an example, we numerically show that the [[48, 6, 8]] generalized bicycle code (as a small but efficient QLDPC code) has an equally good performance while reducing the resources by at least an order of magnitude.
This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.
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.
We consider 2nd generation (2G) Quantum Repeaters (QR) for creating long-distance entanglement in quantum networks. Combining a distance-dependent depolarizing error model with the non-local Bell-state purification procedure required by 2G QRs leads to an error model consisting of correlated and biased errors. To correct correlated errors, non-symmetric CSS codes with joint decoding between stations can be used. The dominating errors are biased, such that different repeater stations suffer from different types of errors. To mitigate this, different quantum codes can be used at the stations, optimized for the specific error model of the station. To comply with the 2G QR procedure, the codes used in neighboring stations must allow for the transversal implementation of non-local logical CNOT gates across the two stations, or alternatively, non-local CZ gates combined with logical Hadamards. We provide a complete characterization of pairs of Calderbank-Steane-Shor (CSS) codes that allow CNOT- or CZ-transversality, and examine an explicit family of mirrored CSS codes allowing CZ-transversality. We verify the Hadamard gate transversality using our framework and show the importance of the mapping matrix. Also, we conclude that using different QECCs can not achieve transversal universal computation with Clifford +T-gate set. Finally, we study the entanglement generation rate (EGR) in 2G QRs with limited quantum memory, minimizing the number of intermediate stations for a given fidelity and EGR. By simulation we observe that non-symmetric and mirrored structure QECCs outperform the conventional approach of using symmetric CSS codes at the repeater stations.
Error-correcting codes are the primary method of transmitting data in the classical world. The effects of contact with the atmosphere are expected to be so widespread in any quantum system utilized to do quantum learning and memory that quantum error correction will always be needed. Group theory is used extensively in both conventional and quantum error correction. For linear quantum error-correcting codes, this chapter outlines a nonconstructive framework that specifies requirements for every code in the category. CSS codes (Calderbank-Shor-Steane), which belong to the larger category of stabilizer codes, have an advantage over other stabilizer codes since they may be built from pairs of classical codes that are coupled in a novel way. The chapter describes how to design a CSS code stabilizer. The stabilizer perspective is described as an alternative to the CSS code architecture described.
Quantum error correction (QEC) stands as the foundational pillar enabling fault-tolerantquantum computing, addressing the fundamental challenge of quantum decoherence that has long impededscalable quantum information processing. This review provides a comprehensive examination of theprinciples, recent advances, and future directions in quantum error correction and fault-tolerant quantumcomputing. We begin by establishing the theoretical foundations, including the quantum error problem,the stabilizer formalism, and the fault-tolerant threshold theorem that delineates the boundary betweencomputable and uncomputable quantum systems. We then systematically review the landscape of quantumerror correction codes, from pioneering approaches including Shor and Steane codes to modern leadingcandidates such as the surface code, color codes, and recent developments in quantum low-density paritycheck (LDPC) codes. Our analysis extends to fault-tolerant architectures, encompassing transversal gateimplementations, magic state distillation, and lattice surgery protocols. We further evaluate experimentalprogress across leading physical platforms including superconducting circuits, trapped ions, and photonicsystems, highlighting landmark achievements from 2020 to 2025. The review also explores criticalapplications spanning quantum machine learning, quantum sensing, quantum cryptography, and quantumsimulation, demonstrating how robust error correction underpins advances across the entire quantumtechnology ecosystem. Finally, we identify persistent challenges including resource overhead reduction,scaling requirements, and integration with quantum networks, while outlining the most promising researchdirections. This review aims to serve as both an accessible introduction for researchers entering the fieldand a comprehensive reference for established practitioners seeking to understand the current state andtrajectory of quantum error correction research.