Practical Routing and Criticality in Large-Scale Quantum Communication Networks

The efficacy of a communication network hinges upon both its physical architecture and the protocols that are employed within it. In the context of quantum communications, there exists a fundamental rate-loss tradeoff for point-to-point quantum channels such that the rate for distributing entanglement, secret keys, or quantum states decays exponentially with respect to transmission distance. Quantum networks are the solution to overcome point-to-point limitations, but they simultaneously invite a challenging open question: How should quantum networks be designed to effectively and efficiently guarantee high rates? Now that performance and physical topology are inexorably linked, this question is not easy, but the answer is essential for a future quantum internet to be successful. In this work, we offer crucial insight into this open question for complex optical-fiber quantum networks. Using realistic descriptions of quantum networks via random network models and practical end-to-end routing protocols, we reveal critical phenomena associated with large-scale quantum networks. Our work reveals the weaknesses of applying single-path routing protocols within quantum networks, observing an inability to achieve reliable rates over long distances. Adapting novel algorithms for multi-path routing, we employ an efficient and practical multi-path routing algorithm capable of boosting performance while minimizing costly quantum resources.

💡 Research Summary

The paper addresses a fundamental challenge for the future quantum internet: how to design large‑scale optical‑fiber quantum communication networks that can deliver high end‑to‑end rates despite the exponential loss inherent in point‑to‑point quantum channels. The authors model realistic quantum networks using random graph ensembles (Waxman and scale‑free models) and incorporate two practical descriptions of link performance: (i) theoretical two‑way quantum and private capacities of bosonic thermal‑loss channels (bounded by the PLOB limit and its upper and lower bounds) and (ii) asymptotic secret‑key rates obtained from concrete QKD protocols. By assigning each edge a rate K_xy drawn from these models, they obtain a rate distribution that reflects both fundamental limits and near‑term technology.

A key methodological innovation is the introduction of a pruning threshold ε: any edge whose rate falls below ε is removed after the graph is generated. This mimics the practical exclusion of low‑quality fiber links or malfunctioning hardware and forces the network to remain connected only through sufficiently good channels. The authors then study how the pruning affects global connectivity, percolation, and the required density of quantum repeaters (nodes capable of storing and forwarding quantum states).

The core of the work compares two routing paradigms. Single‑path routing (P_sp) follows the classical paradigm: a unique path is selected and quantum systems are transmitted sequentially along it. Because quantum information cannot be cloned and suffers decoherence, the end‑to‑end rate of a single‑path protocol is limited by the minimum cut of the network, i.e., the sum of the rates of the weakest set of edges that separates the two end users. Simulations show that as network size grows, the single‑path rate decays rapidly, often becoming negligible even when the network remains topologically connected.

In contrast, multi‑path routing (P_mp) allows simultaneous use of multiple disjoint or partially overlapping paths. The authors adopt a recent efficient algorithm for generating a set of end‑to‑end multipaths, assigning each edge a forwarding probability q_xy (0 ≤ q_xy ≤ 1). The effective rate of an edge becomes q_xy K_xy, and the overall end‑to‑end rate is obtained via the max‑flow min‑cut theorem applied to these effective rates. By distributing traffic across many links, the multi‑path scheme dramatically reduces the impact of any single weak link. Numerical results demonstrate that multi‑path routing can achieve rates within a few percent of the theoretical upper bound while using far fewer edges than a full “flooding” protocol, thereby conserving costly quantum repeaters.

The paper further explores critical phenomena related to repeater density and network topology. For a given average degree, there exists a percolation threshold: below a certain repeater density the pruned network fragments into isolated clusters, making both single‑ and multi‑path routing ineffective. Above this threshold, the network exhibits a giant component that supports many alternative paths, enabling multi‑path routing to approach optimal performance. The authors quantify how the pruning threshold ε, the thermal‑noise parameter (\bar n), and the fiber attenuation coefficient γ jointly determine the required repeater density for reliable operation.

Overall, the study provides several actionable insights for quantum‑network architects: (1) realistic link modeling (thermal‑loss plus QKD rates) is essential for accurate performance prediction; (2) low‑rate links should be pruned to avoid misleading connectivity assessments; (3) single‑path routing is insufficient for large‑scale networks, especially over long distances; (4) efficient multi‑path routing algorithms can deliver near‑optimal rates with modest resource consumption; and (5) network design must ensure sufficient repeater density to stay above the percolation threshold, thereby guaranteeing the existence of multiple viable paths. These findings bridge the gap between theoretical capacity limits and practical network engineering, offering a roadmap toward scalable, high‑rate quantum communication infrastructures.