We present a new control algorithm and system design for a network of quantum repeaters, and outline the end-to-end protocol architecture. Such a network will create long-distance quantum states, supporting quantum key distribution as well as distributed quantum computation. Quantum repeaters improve the reduction of quantum-communication throughput with distance from exponential to polynomial. Because a quantum state cannot be copied, a quantum repeater is not a signal amplifier. Rather, it executes algorithms for quantum teleportation in conjunction with a specialized type of quantum error correction calledpurificationto raise thefidelityof the quantum states. We introduce ourbandedpurification scheme, which is especially effective when the fidelity of coupled qubits is low, improving the prospects for experimental realization of such systems. The resulting throughput is calculated via detailed simulations of a long line composed of shorter hops. Our algorithmic improvements increase throughput by a factor of up to 50 compared to earlier approaches, for a broad range of physical characteristics.
We present a new control algorithm and system design for a network of quantum repeaters, and outline the end-to-end protocol architecture. Such a network will create long-distance quantum states, supporting quantum key distribution as well as distributed quantum computation. Quantum repeaters improve the reduction of quantum-communication throughput with distance from exponential to polynomial. Because a quantum state cannot be copied, a quantum repeater is not a signal amplifier. Rather, it executes algorithms for quantum teleportation in conjunction with a specialized type of quantum error correction calledpurificationto raise thefidelityof the quantum states. We introduce ourbandedpurification scheme, which is especially effective when the fidelity of coupled qubits is low, improving the prospects for experimental realization of such systems. The resulting throughput is calculated via detailed simulations of a long line composed of shorter hops. Our algorithmic improvements increase throughput by a factor of up to 50 compared to earlier approaches, for a broad range of physical characteristics.
Abstract: This chapter explores the engineering of quantum repeaters, a critical technology for enabling secure and scalable long-distance quantum communication. Quantum repeaters extend the range of quantum communication networks by preserving entanglement and mitigating signal loss over large distances. The chapter covers the key principles of entanglement swapping, quantum memory, and quantum error correction, which are essential for maintaining the integrity of quantum states. It also examines advanced repeater architectures, including multi-mode repeaters and entanglement purification techniques, to improve scalability and robustness. Case studies highlight real-world implementations of quantum repeaters in quantum key distribution (QKD) networks, demonstrating their role in achieving secure global communication. Keywords: quantum repeaters, long-distance quantum communication, entanglement swapping, quantum memory, quantum error correction, entanglement purification, multi-mode repeaters, quantum key distribution, QKD, scalable quantum networks, secure communication.
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.
Quantum communication holds the promise of achieving long-distance secure message transmission by exploiting quantum entanglement between remote locations. Quantum repeaters are indispensable to the realization of quantum networks for long-distance quantum communication. Similar to its classical analogue, a good quantum repeater should be able to compensate channel attenuation with a quantum amplifier, and to combat channel distortion through a quantum equaliser. This quantum repeater should also operate by an efficient and robust protocol. The first part of this project researches the continuous mode operation of a noiseless linear amplifier (NLA). We develop a dynamical model to describe the operation of the nondeterministic NLA in the regime of continuous-mode inputs. Both the quantum scissor based NLA and the photon addition-subtraction based NLA are analysed. Simulation results are also presented to confirm theoretical analysis. The second part proposes two quantum protocols. An atomic ensemble based quantum protocol is developed to generate distributed W-states. These generated distributed W-states could be considered as an entanglement resource between more than two distant nodes and would be useful in quantum communication and distributed quantum computation in the future. We also propose a protocol by which quantum key distribution can be achieved deterministically between multiple nodes.This deterministic quantum key distribution scheme may be used to guarantee secure communication for wireless sensor networks and Internet of Things. The last project analyses distortion of quantum channels and develops physically realisable modules to combat it. The minimum phase channel and non-minimum phase all pass channel are discussed separately.
In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metricEwas proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.
Most quantum communication tasks need to rely on the transmission of quantum signals over long distances. Unfortunately, transmission of such signals is most often limited by losses in the channel, the same issue that affects classical communication. Simple signal amplification provides an elegant solution for the classical world, but this is not possible in the quantum world, as the no-cloning theorem forbids such an operation and, thus, an alternative approach, a quantum repeater, is needed. Quantum repeaters enable one to create a known maximally entangled state between the end points of the network by first segmenting the network into pieces, creating entanglement between the segments, and then, connecting those entanglement to create the required long range entanglement. Quantum teleportation then allows an unknown quantum message to be transmitted between them using the long-range entangled state. This form of quantum communication will be at the heart of the future quantum Internet. In this review, we will detail various approaches to quantum repeaters, and discuss their expected performance and limitations.
Long-distance quantum communication faces significant challenges due to photon loss and operational errors in fiber optic channels. Quantum repeaters (QRs) offer a promising solution by extending the communication range and enabling secure exchange of quantum information over continental distances. This article provides an overview of the three generations of QRs, comparing their technological requirements and challenges. We introduce the basic techniques, such as entanglement swapping, distillation, and error correction, and discuss their relevance to each generation of QRs. In addition, we present a future direction that integrates superconducting qubits with optical fibers, enabled by recent advances in microwave-optical transduction. This new hybrid architecture offers promising prospects for scalable and efficient quantum networks. It is also applicable in quantum key distribution protocols, such as E91.