Long-distance quantum communication presents a significant challenge as maintaining the fidelity of qubits can be difficult. This issue can be addressed through the use of quantum repeaters to transmit entanglement information through Bell measurements. However, despite its necessity to enable wide-area quantum internet, the deployment cost of quantum repeaters can be prohibitively expensive, thus it is important to develop a quantum repeater deployment model that can strike a balance between cost and effectiveness. In this work, we present novel heuristic models to quickly determine a minimum number of quantum repeaters to deploy in large-scale networks to provide end-to-end connectivity between all end hosts. The results show that, compared to the linear programming approach, the heuristic methods can find near-optimal solutions while reducing the execution time from days to seconds when evaluated against several synthetic and real-world networks such as SURFnet and ESnet. As reliability is key for any network, we also demonstrate that the heuristic method can determine deployment models that can endure up to two link/node failures.
Long-distance quantum communication presents a significant challenge as maintaining the fidelity of qubits can be difficult. This issue can be addressed through the use of quantum repeaters to transmit entanglement information through Bell measurements. However, despite its necessity to enable wide-area quantum internet, the deployment cost of quantum repeaters can be prohibitively expensive, thus it is important to develop a quantum repeater deployment model that can strike a balance between cost and effectiveness. In this work, we present novel heuristic models to quickly determine a minimum number of quantum repeaters to deploy in large-scale networks to provide end-to-end connectivity between all end hosts. The results show that, compared to the linear programming approach, the heuristic methods can find near-optimal solutions while reducing the execution time from days to seconds when evaluated against several synthetic and real-world networks such as SURFnet and ESnet. As reliability is key for any network, we also demonstrate that the heuristic method can determine deployment models that can endure up to two link/node failures.
Long-distance quantum communication presents a significant challenge due to the degrading fidelity of transmitted qubits. Quantum repeaters are proposed to overcome this issue through Bell measurements on entangled qubit pairs. However, despite its necessity to enable wide-area quantum internet, the deployment cost of quantum repeaters can be prohibitively expensive; thus, developing a quantum repeater deployment model that can strike a balance between cost and effectiveness is essential. In this work, we present novel heuristic models to quickly determine a minimum number of quantum repeaters to deploy in large-scale networks to provide end-to-end connectivity between all end hosts. The results show that, compared to the integer linear programming approach, the heuristic methods can find near-optimal solutions while reducing the execution time from days to seconds when evaluated against several synthetic and real-world networks such as SURFnet and ESnet. As reliability is critical for any network, we demonstrate that the heuristic method can estimate deployment models to endure up to two link/node failures.
Thanks to the applications such as Quantum Key Distribution and Distributed Quantum Computing, the deployment of quantum networks is gaining great momentum. A major component in quantum networks is repeaters, which are essential for reducing the error rate of qubit transmission for long-distance links. However, repeaters are expensive devices, so minimizing the number of repeaters placed in a quantum network while satisfying performance requirements becomes an important problem. Existing solutions typically solve this problem optimally by formulating an Integer Linear Program (ILP). However, the number of variables in their ILPs is O ( n 2 ) , where n is the number of nodes in a network. This incurs infeasible running time when the network scale is large. To overcome this drawback, this paper proposes to solve the repeater placement problem by two steps, with each step using a linear program of a much smaller scale with O ( n ) variables. Although this solution is not optimal, it dramatically reduces the time complexity, making it practical for large-scale networks. Moreover, it constructs networks that have higher node connectivity than those by existing solutions, since it deploys slightly more number of repeaters into networks. Our extensive experiments on both synthetic and real-world network topologies verified our claims.
Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. However, due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed. The goal of this work is to maximize the overall length, or scalability of QRNs such that long-distance quantum communications is achieved while application-specific quality-of-service (QoS) requirements are satisfied. In particular, a novel joint optimization framework that aims at maximizing QRN scalability, while satisfyingQoS constraints on the end-to-end fidelity and rate is proposed. The proposed approach optimizes the number of QRN repeater nodes, their separation distance, and the number of distillation rounds to be performed at both link and end-to-end levels. Extensive simulations are conducted to analyze the tradeoffs between QRN scalability, rate, and fidelity under gate and measurement errors. The obtained results characterize the QRN scaling limits for a given QoS requirement. The proposed approach offers a promising solution and design guidelines for future QRN deployments.
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.
The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.
Quantum networks rely on repeaters to distribute entangled qubit pairs for applications such as quantum key distribution and distributed quantum computing. Minimizing the number of repeaters—while meeting connectivity and range constraints—is central to making deployments practical at scale. This thesis unifies three complementary lines of work toward that goal for terrestrial and non-terrestrial quantum networks. Two-Step Linear Programming (TSLP) is a scalable optimization framework that decomposes complex problems into two sequential linear programming steps to reduce computational complexity. First, a TSLP approach for repeater placement on existing infrastructure (terrestrial networks) is presented. Integer Linear Programming (ILP) is a mathematical modeling technique where variables are restricted to be integers to find the best possible outcome in a set of requirements. This work contributes a scalable optimization framework that addresses the computational limitations of traditional ILP models. While existing ILP solutions face O(n2) complexity, the proposed TSLP approach reduces this to O(n) variables. Simulation results on synthetic and real-world topologies show that TSLP dramatically decreases running time while achieving higher node connectivity through a strategic, slight increase in the number of repeaters. This advances research by enabling the design of large-scale fiber-based quantum networks that were previously computationally inaccessible. Second, a drone-based (non-terrestrial) repeater network for serving ground stations is studied. A key contribution of this work is the development of a polynomial-time, two- stage algorithm that decouples coverage and connectivity requirements. Stage 1 optimizes the coverage of ground terminals, while Stage 2 ensures the network backbone is fully connected. Third, the thesis addresses the need for fault tolerance in error-prone quantum net- works by extending the 1-connected drone model to achieve 2-connectedness. The Delaunay Triangulation with pruning, Steiner points, and pruning again (DT-PSP) is a geometry-aware heuristic that minimizes the number of required drone-based repeaters by leveraging geometric properties. The major contribution here is the introduction of the DT-PSP approach based on Delaunay Triangulation and Steiner node placement. Collectively, the proposed algorithms improve network connectivity and reduce deployment cost across diverse quantum-network settings. By bridging the gap between theoretical optimality and practical scalability, this PhD work provides a comprehensive toolkit for the real-world deployment of future large-scale quantum networks.