In this thesis, I explore whether it is possible to build a unified Quantum Internet architecture that supports different types of quantum repeaters -- especially the two most distinct and seemingly incompatible ones: memory-based quantum repeaters and all-photonic, memoryless repeaters. These technologies have traditionally been developed with the aim of becoming the single dominant solution, but I ask: Can they work together in the same network? What kind of architecture would support both? And how can simulation help us understand what is needed to manage such a network at scale? To address these questions, I propose an architecture based on an existing recursive network design and programmable RuleSet-based protocols that can coordinate diverse hardware components. I introduce a new emitter-photon building block to bridge memory-based and all-photonic segments, and show how classical networking abstractions can be extended to manage quantum operations. While I have developed a simulation tool grounded in these architectural principles and validated it against existing simulators and analytical models, a full-scale investigation of the resource trade-offs and performance implications remains future work. Nevertheless, the results so far suggest that a unified, heterogeneous quantum network is not only possible but increasingly practical with current technologies -- though ongoing experimental progress will be essential to fully realize this vision.
In this thesis, I explore whether it is possible to build a unified Quantum Internet architecture that supports different types of quantum repeaters -- especially the two most distinct and seemingly incompatible ones: memory-based quantum repeaters and all-photonic, memoryless repeaters. These technologies have traditionally been developed with the aim of becoming the single dominant solution, but I ask: Can they work together in the same network? What kind of architecture would support both? And how can simulation help us understand what is needed to manage such a network at scale? To address these questions, I propose an architecture based on an existing recursive network design and programmable RuleSet-based protocols that can coordinate diverse hardware components. I introduce a new emitter-photon building block to bridge memory-based and all-photonic segments, and show how classical networking abstractions can be extended to manage quantum operations. While I have developed a simulation tool grounded in these architectural principles and validated it against existing simulators and analytical models, a full-scale investigation of the resource trade-offs and performance implications remains future work. Nevertheless, the results so far suggest that a unified, heterogeneous quantum network is not only possible but increasingly practical with current technologies -- though ongoing experimental progress will be essential to fully realize this vision.
Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management.The classical control necessary to use the network will therefore face similar issues as Internet data transmission.Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort.Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined.We propose a unifying framework that can be used with all existing repeater designs.We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of recursive networks, extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework.Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management.Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such Bell pairs and GHZ, W, and cluster states.
Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks to longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into memory-based or all-photonic QRs; and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum networks, or a specific regime of operational parameters. We perform theoretical analysis and simulations of quantum repeaters and networks to investigate the relative performance and resource requirements of different quantum network paradigms. Our results will help guide the optimization of quantum hardware and components and shed light on the role of a robust control plane. We present our research findings on theoretical analysis and simulations of memory-based first-generation trapped-ion quantum repeaters and networks, and all-photonic entanglement-based quantum repeaters and networks. We study the relative performance in terms of entanglement generation rate and fidelity, as well as the resource requirements of these two different quantum network paradigms.
Developing and deploying advanced Quantum Repeater (QR) technologies will be necessary to scale quantum networks at longer distances. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into “memory-based” or “all-photonic” QRs, and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum network, or a specific regime of operational parameters. Modeling and simulation of quantum repeaters and networks can help in understanding the relative performance and resource requirements of different types of QRs, identify tradeoffs of alternative quantum network architectures, optimize quantum hardware, and assist in the design of a robust control plane. This paper introduces a quantum repeater simulation toolkit based on NetSquid, which includes component models and protocols to study advanced quantum repeater networks. We present our initial research findings on modeling and simulation of “allphotonic” entanglement-based QRs and “memory-based” first generation trapped ion QRs. We study the relative performance and resource requirements of these two different types of QRs and networks. The performance metrics include entanglement generation rate and fidelity between the endpoints of the network. For fair comparison of resource requirements of different types of QRs, entanglement generation rate is normalized by the total number of matter qubits involved.
Quantum networking, heralded as the next frontier in communication networks, envisions a realm where quantum computers and devices collaborate to unlock capabilities beyond what is possible with the Internet. A critical component for realizing a long-distance quantum network, and ultimately, the Quantum Internet, is the quantum repeater. As with the race to build a scalable quantum computer with different technologies, various schemes exist for building quantum repeaters. This article offers a gentle introduction to the two-way “all-photonic quantum repeaters,” a recent addition to quantum repeater technologies. In contrast to conventional approaches, these repeaters eliminate the need for quantum memories, offering the dual benefits of higher repetition rates and intrinsic tolerance to both quantum operational errors and photon losses. Using visualization and simple rules for manipulating graph states, we describe how all-photonic quantum repeaters work. We discuss the problem of the increased volume of classical communication required by this scheme, which places a huge processing requirement on the end nodes. We address this problem by presenting a solution that decreases the amount of classical communication by three orders of magnitude. We conclude by highlighting other key open challenges in translating the theoretical all-photonic framework into real-world implementation, providing insights into the practical considerations and future research directions of all-photonic quantum repeater technology.
Abstract Scaling quantum networks to long distances necessitates the development of advanced quantum repeater (QR) technologies. Depending on the error mitigation mechanisms adopted to suppress loss and errors, QRs are typically classified into memory-based or all-photonic QRs; and each type of QR may be best suited for a specific type of underlying quantum technology, a particular scale of quantum networks, or a specific regime of operational parameters. This paper presents a comparative theoretical and simulation-based analysis of first-generation memory-based trapped-ion QRs and networks, and all-photonic entanglement-based QRs and networks. Our model incorporates a wide range of realistic parameters and noise sources to evaluate performance trade-offs. Major research findings of this study include: (a) the entanglement rate does not necessarily scale with the number of QRs. Although adding repeaters in a chain helps to reduce photon loss in quantum links, it also introduces overheads that can be attributed to imperfect photon collection, inefficient quantum frequency conversion, and limited detector efficiency. The entanglement rate only improves when the distance between QRs exceeds a certain threshold, specifically, when the reduction in photon loss in quantum links gained by adding QRs outweighs the inherent overheads they introduce. (b) Without quantum error correction and entanglement purification, the entanglement fidelity decreases with the number of QRs, regardless of the chain distance. Finally, the theoretical models and simulation software package developed in this study provide a versatile framework for the design and evaluation of future QR technologies, protocols, and architectures.
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.