Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1206.5655 · Networking Science

Path selection for quantum repeater networks

Rodney Van Meter, Takahiko Satoh, Thaddeus D. Ladd, William J. Munro, Kae Nemoto

Published Dec 1, 2013• 220 citations
arXivHTMLPDF
DOI
10.1007/s13119-013-0026-2

Related papers

Quantum Repeater Networks

Peter P. Rohde

Cambridge University Press eBooks•Sep 9, 2021•1 citation

Routing

Rodney Van Meter

In a complex network of heterogeneous links, selection of a path between the two communicating nodes is an important problem. This chapter examines a form of Dijkstra's algorithm adapted for repeater networks. It investigates critical problems in the use of purify-and swap repeater networks. The focus has been on the path selection and the need for a routing algorithm. An acceptable routing algorithm is an easy-to-calculate metric that reliably chooses a reasonable, if not optimal, path. The chapter discusses the differences between quantum and classical networks and the difficulties encountered. After defining the problems in path selection and proposing several solutions, the chapter evaluates those solutions via simulations that answer a series of specific questions about the behavior of quantum repeater networks. The results show that, despite many important differences, quantum repeater networks behave similarly to classical networks in useful ways, but the classical principles cannot be applied without thought.

Wiley eBooks•Apr 14, 2014•0 citations

Optimizing Quantum Repeater Protocols

Liang Jiang, Jacob M. Taylor, Navin Khaneja +1 more

Bulletin of the American Physical Society•May 17, 2006•0 citations

Dynamic topology resilience for quantum networks

László Gyöngyösi, Sándor Imre

In quantum repeater networks, the varying stability of entangled quantum links makes dynamic topology resilience an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands of all users of the network. We study the problem of entanglement assignment in a quantum repeater network, prove its computational complexity, and show an optimization procedure. The results are particularly convenient for future quantum networking, quantum-internet, and experimental long-distance quantum communications.

Quantum Computing, Communication, and Simulation•Feb 22, 2018•19 citations

Reliability-Guided Trusted Repeater Node Selection in QKD-Enabled Metro Optical Networks

Arup Kumar Marik, Basabdatta Palit, Sadananda Behera

Quantum Key Distribution (QKD) in optical networks can provide information-theoretic security but is limited by its operability range, thereby requiring repeater nodes for extended coverage. Existing works typically assume that all repeater nodes and their associated key management systems are fully trusted, overlooking the risks posed by software exploits and insider threats. To address this, in this work, we propose a Bayesian fusion-based model to quantify the trustworthiness of each node. We have formulated a reliability-guided Trusted Repeater Node (TRN) selection framework for metro optical networks, where each node is assigned a trust score. We have subsequently mapped this trust score to link weights, which in turn has been used for reliable path computation for TRN selection, using the Dijkstra algorithm. We have also ranked the nodes using a composite score combining eigenvector and betweenness centrality, to capture their topographical relevance in the network. Simulation results on a reference topology demonstrate that the proposed method achieves approximately 8.93% higher path coverage than traditional centrality-based approaches like degree centrality, using the same number (around ten) of TRNs, thereby supporting reliable and resilient TRN selection for QKD-enabled optical networks.

arXiv:2609.18797•Sep 16, 2026•0 citations

A step closer to repeaters for quantum networks

Nature•Aug 30, 2023•0 citations
In a complex network of heterogeneous links, selection of a path between the two communicating nodes is an important problem. This chapter examines a form of Dijkstra's algorithm adapted for repeater networks. It investigates critical problems in the use of purify-and swap repeater networks. The focus has been on the path selection and the need for a routing algorithm. An acceptable routing algorithm is an easy-to-calculate metric that reliably chooses a reasonable, if not optimal, path. The chapter discusses the differences between quantum and classical networks and the difficulties encountered. After defining the problems in path selection and proposing several solutions, the chapter evaluates those solutions via simulations that answer a series of specific questions about the behavior of quantum repeater networks. The results show that, despite many important differences, quantum repeater networks behave similarly to classical networks in useful ways, but the classical principles cannot be applied without thought.
In quantum repeater networks, the varying stability of entangled quantum links makes dynamic topology resilience an emerging issue. Here we define an efficient topology adaption method for quantum repeater networks. The model assumes the random failures of entangled links and several parallel demands from legal users. The shortest path defines a set of entangled links for which the probability of stability is above a critical threshold. The scheme is utilized in a base-graph of the overlay quantum network to provide an efficient shortest path selection for the demands of all users of the network. We study the problem of entanglement assignment in a quantum repeater network, prove its computational complexity, and show an optimization procedure. The results are particularly convenient for future quantum networking, quantum-internet, and experimental long-distance quantum communications.
Quantum Key Distribution (QKD) in optical networks can provide information-theoretic security but is limited by its operability range, thereby requiring repeater nodes for extended coverage. Existing works typically assume that all repeater nodes and their associated key management systems are fully trusted, overlooking the risks posed by software exploits and insider threats. To address this, in this work, we propose a Bayesian fusion-based model to quantify the trustworthiness of each node. We have formulated a reliability-guided Trusted Repeater Node (TRN) selection framework for metro optical networks, where each node is assigned a trust score. We have subsequently mapped this trust score to link weights, which in turn has been used for reliable path computation for TRN selection, using the Dijkstra algorithm. We have also ranked the nodes using a composite score combining eigenvector and betweenness centrality, to capture their topographical relevance in the network. Simulation results on a reference topology demonstrate that the proposed method achieves approximately 8.93% higher path coverage than traditional centrality-based approaches like degree centrality, using the same number (around ten) of TRNs, thereby supporting reliable and resilient TRN selection for QKD-enabled optical networks.