We investigate the influence of memory errors in the quantum repeater scheme for long-range quantum communication. We show that the communication distance is limited in standard operation mode due to memory errors resulting from unavoidable waiting times for classical signals. We show how to overcome these limitations by (i) improving local memory and (ii) introducing two operational modes of the quantum repeater. In both operational modes, the repeater is run blindly, i.e., without waiting for classical signals to arrive. In the first scheme, entanglement purification protocols based on one-way classical communication are used allowing to communicate over arbitrary distances. However, the error thresholds for noise in local control operations are very stringent. The second scheme makes use of entanglement purification protocols with two-way classical communication and inherits the favorable error thresholds of the repeater run in standard mode. One can increase the possible communication distance by an order of magnitude with reasonable overhead in physical resources. We outline the architecture of a quantum repeater that can possibly ensure intercontinental quantum communication.
We investigate the influence of memory errors in the quantum repeater scheme for long-range quantum communication. We show that the communication distance is limited in standard operation mode due to memory errors resulting from unavoidable waiting times for classical signals. We show how to overcome these limitations by (i) improving local memory and (ii) introducing two operational modes of the quantum repeater. In both operational modes, the repeater is run blindly, i.e., without waiting for classical signals to arrive. In the first scheme, entanglement purification protocols based on one-way classical communication are used allowing to communicate over arbitrary distances. However, the error thresholds for noise in local control operations are very stringent. The second scheme makes use of entanglement purification protocols with two-way classical communication and inherits the favorable error thresholds of the repeater run in standard mode. One can increase the possible communication distance by an order of magnitude with reasonable overhead in physical resources. We outline the architecture of a quantum repeater that can possibly ensure intercontinental quantum communication.
We study the use of entanglement purification for quantum communication over long distances. For distances much longer than the coherence length of a corresponding noisy quantum channel, the fidelity of transmission is usually so low that standard purification methods are not applicable. It is possible, however, to divide the channel into shorter segments that are purified separately and then connected by the method of entanglement swapping. This method can be much more efficient than schemes based on quantum error correction, as it makes explicit use of two-way classical communication. An important question is how the noise, introduced by imperfect local operations (that constitute the protocols of purification and the entanglement swapping), accumulates in such a compound channel, and how it can be kept below a certain noise level. To treat this problem, we first study the applicability and the efficiency of entanglement purification protocols in the situation of imperfect local operations. We then present a scheme that allows entanglement purification over arbitrary long channels and tolerates errors on the percent level. It requires a polynomial overhead in time, and an overhead in local resources that grows only logarithmically with the length of the channel.
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.
In quantum communication via noisy channels, the error probability scales exponentially with the length of the channel. We present a scheme of a quantum repeater that overcomes this limitation. The central idea is to connect a string of (imperfect) entangled pairs of particles by using a novel nested purification protocol, thereby creating a single distant pair of high fidelity. Our scheme tolerates general errors on the percent level, it works with a polynomial overhead in time and a logarithmic overhead in the number of particles that need to be controlled locally.
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 study a quantum repeater which is based on decoherence free quantum gates recently proposed by Klein {\it et al.} [Phys. Rev. A, {\bf 73}, 012332 (2006)]. A number of operations on the decoherence free subspace in this scheme makes use of an ancilla qubit, which undergoes dephasing and thus introduces decoherence to the system. We examine how this decoherence affects entanglement swapping and purification as well as the performance of a quantum repeater. We compare the decoherence free quantum repeater with a quantum repeater based on qubits that are subject to decoherence and show that it outperforms the latter when decoherence due to long waiting times of conventional qubits becomes significant. Thus, a quantum repeater based on decoherence free subspaces is a possibility to greatly improve quantum communication over long or even intercontinental distances.
We introduce an alternative type of quantum repeater for long-range quantum communication with improved scaling with the distance. We show that by employing hashing, a deterministic entanglement distillation protocol with one-way communication, one obtains a scalable scheme that allows one to reach arbitrary distances, with constant overhead in resources per repeater station, and ultrahigh rates. In practical terms, we show that, also with moderate resources of a few hundred qubits at each repeater station, one can reach intercontinental distances. At the same time, a measurement-based implementation allows one to tolerate high loss but also operational and memory errors of the order of several percent per qubit. This opens the way for long-distance communication of big quantum data.