Quantum repeaters are an essential building block for realizing long-distance quantum communications. However, due to the fragile nature of quantum information, these repeaters suffer from loss and operational errors. Prior works have classified repeaters into three broad categories based on their use of probabilistic or near-deterministic methods to mitigate these errors. Besides differences in classical communication times, these approaches also vary in technological complexity, with near-deterministic methods requiring more advanced hardware. Recent increases in memory availability and advances in multiplexed entanglement generation motivate a fresh comparison of one-way and two-way repeater architectures. In this work, we present a two-way repeater protocol that combines multiplexing with application-aware distillation, designed for a setting where sufficient high-quality memory resources are available—reflecting architectural assumptions expected in large-scale network deployments. We introduce a recursive formulation to track the full probability distribution of Bell pairs in multiplexed two-way repeater architectures, enabling the performance analysis of multiplexed repeater schemes which use probabilistic n-to-k distillation. Using this framework, we compare the proposed two-way protocol with one-way schemes in parameter regimes previously believed to favour the latter, and find that the two-way architecture consistently outperforms one-way protocols while requiring lower technological and resource overheads. Quantum repeaters are a fundamental building block for long-distance quantum communication, yet they face challenges from loss and operational errors. The authors introduce a two-way repeater protocol leveraging multiplexing and application-aware distillation, demonstrating superior performance and reduced resource demands compared to one-way schemes, even in scenarios previously thought to favor the latter.
Quantum repeaters are an essential building block for realizing long-distance quantum communications. However, due to the fragile nature of quantum information, these repeaters suffer from loss and operational errors. Prior works have classified repeaters into three broad categories based on their use of probabilistic or near-deterministic methods to mitigate these errors. Besides differences in classical communication times, these approaches also vary in technological complexity, with near-deterministic methods requiring more advanced hardware. Recent increases in memory availability and advances in multiplexed entanglement generation motivate a fresh comparison of one-way and two-way repeater architectures. In this work, we present a two-way repeater protocol that combines multiplexing with application-aware distillation, designed for a setting where sufficient high-quality memory resources are available—reflecting architectural assumptions expected in large-scale network deployments. We introduce a recursive formulation to track the full probability distribution of Bell pairs in multiplexed two-way repeater architectures, enabling the performance analysis of multiplexed repeater schemes which use probabilistic n-to-k distillation. Using this framework, we compare the proposed two-way protocol with one-way schemes in parameter regimes previously believed to favour the latter, and find that the two-way architecture consistently outperforms one-way protocols while requiring lower technological and resource overheads. Quantum repeaters are a fundamental building block for long-distance quantum communication, yet they face challenges from loss and operational errors. The authors introduce a two-way repeater protocol leveraging multiplexing and application-aware distillation, demonstrating superior performance and reduced resource demands compared to one-way schemes, even in scenarios previously thought to favor the latter.
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 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.
Future quantum networks will enable the realisation of a large family of quantum protocols, hence allowing for implementation of various tasks ranging from quantum cryptography through quantum computing to quantum metrology.In this thesis we analyse and develop the building blocks of quantum repeater networks.These networks consist of quantum repeater nodes, which are equipped with quantum memories enabling storage of quantum information.The repeater nodes are connected using optical fibres that enable for the transmission of photonic quantum signals between the repeater nodes.We specifically focus on the two building blocks: remote entanglement generation and entanglement distillation.We then investigate various proof of principle quantum repeater schemes used for generating shared secret key between distant parties.The repeater schemes that we consider utilise one to three memory nodes capable of generating memory-photon entanglement.Finally, we introduce a novel framework for investigating a foundational aspect in the use of quantum communication related to the uncertainty principle.Efficient remote entanglement generation is an indispensable building block of most near-term quantum repeater networks.In this thesis we consider various remote entanglement generation schemes that permit multiplexing, which aims at increasing the throughput of this procedure.We find that for the specific schemes that are suitable for platforms with a single communication qubit and multiple memory qubits, the performance of the multiplexing approach is strongly dependent on the time it takes to perform local operations within the memory nodes.Entanglement distillation enables for filtering out the noise from imperfect entangled states using only local operations and classical communication.Using a general framework for optimising such schemes, which we have developed, we have proven optimality of specific generic and experimentally relevant distillation schemes.We have developed a general framework for optimising such schemes, which we have used to prove optimality of various generic and experimentally relevant distillation schemes.In designing proof of principle quantum repeater schemes we assume an informationtheoretic approach, which enables us to assess their performance in a hardware-agnostic way.We find that all the schemes that we consider can prove useful in specific parameter regimes for the nitrogen-vacancy centre platform.Moreover, we find that one scheme which has already been realised experimentally in the context of remote entanglement generation, is expected to significantly outperform every possible system based on direct communication without repeaters.However, our analysis shows that encapsulating the nitrogen-vacancy centres in optical cavities for the enhancement of the emission rates is a necessary requirement for such a successful demonstration of the first proofof-principle quantum repeater.xi xii SUMMARY Finally, we investigate the quantum uncertainty principle which is a fundamental feature of quantum mechanics, allowing for security in many quantum cryptographic protocols.We find that in a particular scenario, relevant from the perspective of quantum key distribution, a significant part of the observed uncertainty is in fact due to lack of information rather than intrinsic.If the eavesdropper could access that information, she would be able to much better, or in some cases even with certainty, guess the value of the raw bit of the generated key.
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥ 1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances.
Purpose of the study: systematization and critical analysis of existing approaches to error suppression in quantum repeaters, as well as to assess their advantages and limitations for the implementation of scalable quantum networks and the quantum internet. Methods of research: the paper provides a detailed analysis of modern literature, including a comparison of various quantum repeater schemes, as well as an assessment of resource costs and performance. Result(s): quantum repeaters can be divided into three generations, each of which demonstrates optimal efficiency under certain conditions. The first generation, implementing probabilistic error suppression by generating heralded entanglement and two-way entanglement distillation, is easy to implement and provides the basic functionality of a quantum network, but requires significant time due to the need to exchange classical signals and long-term storage of quantum states. The second generation combines probabilistic entanglement generation with deterministic operation error suppression using quantum error correction, which reduces the requirements for long-term quantum memory, although the exchange of classical signals between neighboring nodes remains mandatory. The third generation relies entirely on deterministic error suppression using one-way classical communication, which allows for a significant reduction in time delays and high entanglement generation rates, despite the need for a denser arrangement of repeaters and high-quality local gates. In addition, the review covers new areas such as memoryless repeaters and all-photonic repeaters. The conducted comparative analysis of resource costs demonstrates that optimization of repeater operating parameters is a key factor for the implementation of scalable quantum networks, which is of direct importance for quantum key distribution, quantum metrology, and distributed quantum computing. Scientific novelty: the scientific novelty lies in the integration of disparate approaches to the implementation of quantum repeaters into a single holistic representation, which allows for an objective assessment of their efficiency by key parameters. The review highlights the potential for new classes of repeaters, such as memoryless repeaters and all-photonic circuits, to become important elements in the development of a quantum internet.
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.