Quantum repeaters enable us to distribute entanglement between remote parties by relying on a network of quantum memory units that exhibit efficient coupling to light, scalability, and long coherence times. Entanglement is initially distributed between nearest neighbors and then extended to the far-end nodes using entanglement swapping techniques. For real-time applications, such as quantum key distribution, the above tasks must be repeated successively, according to a proper protocol, to generate entangled states at a certain rate. This paper studies a number of such protocols and the interplay between the rate of entanglement generation, the number of employed memories, and the coherence time of memory units.
Quantum repeaters enable us to distribute entanglement between remote parties by relying on a network of quantum memory units that exhibit efficient coupling to light, scalability, and long coherence times. Entanglement is initially distributed between nearest neighbors and then extended to the far-end nodes using entanglement swapping techniques. For real-time applications, such as quantum key distribution, the above tasks must be repeated successively, according to a proper protocol, to generate entangled states at a certain rate. This paper studies a number of such protocols and the interplay between the rate of entanglement generation, the number of employed memories, and the coherence time of memory units.
Memory dephasing and its impact on the rate of entanglement generation in quantum repeaters is addressed. For systems that rely on probabilistic schemes for entanglement distribution and connection, we estimate the maximum achievable rate per employed memory for our optimized partial nesting protocol, when a large number of memories are being used in each node. The above rate scales polynomially with distance, L, if quantum memories with infinitely long coherence times are available or if we employ a fully fault-tolerant scheme. For memories with finite coherence times and no fault-tolerant protection, the above rate optimistically degrades exponentially in L, regardless of the employed purification scheme. It decays, at best, exponentially in L if no purification is used.
Quantum communication between two remote locations often involves remote parties sharing an entangled quantum state. At present, entanglement distribution is usually performed using photons transmitted through optical fibers. However, the absorption of light in the fiber limits the communication distances to less than 200 km, even for optimal photon telecom wavelengths. To increase this distance, the quantum repeater idea was proposed. In the quantum repeater architecture, one divides communication distance into segments of the order of the attenuation length of the photons and places quantum memory nodes at the intermediate locations. Since the photon loss between intermediate locations is low, it is possible then to establish entanglement between intermediate quantum memory nodes. Once entanglement between adjacent nodes is established, one can extend it over larger distances using entanglement swapping.\n\nThe long coherence time of a quantum memory is a crucial requirement for the quantum repeater protocol. It is obvious that the coherence time of a quantum memory should be much longer that the time it takes for light to travel between remote locations. For a communication distance l = 1000 km, the corresponding time is t = l/c = 3.3 ms. One can show that for a simple repeater protocol and realistic success probabilities of entanglement generation, the required coherence time should be on the order of many seconds, while for the more complicated protocols that involve multiplexing and several quantum memory cells per intermediate node, the required coherence time is on the order of milliseconds.\n\nIn this thesis, I describe a quantum memory based on an ensemble of rubidium atoms confined in a one-dimensional optical lattice. The use of the magnetically- insensitive clock transition and suppression of atomic motion allows us to increase coherence time of the quantum memory by two-orders of magnitude compared to previous work. I also propose a method for determining the Zeeman content of atomic samples. In addition, I demonstrate the observation of quantum evolution under continuous measurement. The long quantum memory lifetime demonstrated in this work opens the way for scalable processing of quantum information and long distance quantum communication.
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.
This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.
We present a quantum repeater protocol for distributing entanglement over long distances, where a dedicated communication stage enables trial rates not limited by the travel time between repeater nodes. To accomplish this, each node contains several qubits that can couple to one single-photon emitter. Photons from the emitters in neighboring nodes generate heralded entanglement between qubits in these nodes. The protocol leaves the emitters disentangled from the rest of the system immediately after emitting the photons, thus allowing them to be reused to entangle other qubits without waiting for the repeater link round-trip time. This time multiplexing increases the protocol trial rate by up to an order of magnitude. The protocol is then combined with conventional deterministic entanglement swapping and heralded entanglement purification to extend the entanglement distance and reduce the entanglement error, respectively. We perform a complete protocol analysis by considering all relevant error sources, such as initialization, two-qubit gate, and qubit measurement errors, as well as the exponential decoherence of the qubits with time. The latter is particularly important since we analyze the protocol performance for a broad range of experimental parameters and obtain secret key rates ranging from 1 to 1000 Hz at a distance of 1000 km. Our results suggest that it is important to reach a qubit memory coherence time of around 1 s, and two-qubit gate and measurement errors on the order of 10 − 3 to obtain reasonable secret key rates over distances longer than achievable with direct transmission. While this work focuses on optimizing secret key rates, the protocol can also be used for Einstein-Podolsky-Rosen pair generation and is thus also relevant for, e.g., distributed quantum computing.
At the core of the quantum Internet lie quantum repeaters that enable remote end-to-end entanglement generation. Fundamentally, the entanglement generation rate and fidelity of quantum repeaters constitute the bottleneck for end-to-end performance. To achieve high rates, quantum repeaters employ quantum memory multiplexing. In a high-rate standard repeater, each memory sequentially generates an entanglement with its neighboring nodes and then applies entanglement swapping. This, however, results in low fidelity due to decoherence of the first-formed entanglement in the sequential generation process. By allocating different numbers of memories to simultaneously form entanglements with the left and right adjacent nodes, quantum repeaters reduce high waiting times and achieve high fidelity. In such a repeater, a mismatch problem arises due to the difference between the probabilistic number of generated entanglements on both sides. Consequently, some entanglements remain stored until opposite entanglements are available. The mismatch problem reduces the repeater rate and particularly the entanglement fidelity. In this paper, we consider the mismatch problem in an asymmetric repeater with different distances to its adjacent nodes. To mitigate the mismatch problem, we derive a dynamic optimal memory allocation. Under the optimal allocation, we derive statistical lower bounds on the achievable rate and fidelity. We demonstrate that the optimal allocation significantly improves the fidelity while maintaining a comparable rate to the standard repeater. In contrast, our results show that fixed memory allocation may be detrimental to the fidelity.