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:1905.00254 · Quantum Information Processing

Adaptive routing for quantum memory failures in the quantum Internet

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

Published Jan 4, 2019• 32 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-2153-x

Related papers

Topology adaption for the quantum Internet

Laszlo Gyongyosi, Sándor Imre

arXiv:1809.02928•Quantum Information Processing•Sep 22, 2018•29 citations

Investigation of the Feasibility of Different Quantum Memories in Satellite-Based Quantum Internet

Kitti Oláh, László Bacsárdi

IAF Space Communications and Navigation Symposium•Jan 1, 2024•0 citations

Routing in a quantum network

William J. Munro, Nicoló Lo Piparo, Michael Hanks +1 more

Bulletin of the American Physical Society•Mar 5, 2020•0 citations

Fidelity- and Coherence-Aware Entanglement Routing for Regional Quantum Internet Networks

H S Ullas, A Lakshmi, H R Mithun Gowda

The quantum internet enables secure communication, distributed quantum computing, and remote sensing by distributing entanglement among distant nodes [1], [2]. However, establishing end-to-end entanglement across regional networks remains challenging because quantum links experience photon loss, entanglement generation is probabilistic, quantum memories have limited coherence times, and repeater resources are constrained [2], [3]. Conventional shortest-path routing does not jointly account for these quantum-specific limitations. This paper proposes a Fidelity- and Coherence-Aware Dynamic Entanglement Routing (FCADR) framework for regional quantum internet networks. The network is modelled as a graph containing end nodes, quantum repeaters, quantum memories, and lossy entanglement links. FCADR selects routes by jointly considering estimated end-to-end fidelity, entanglement-generation and swapping success probabilities, available quantum-memory capacity, and expected distribution delay. A discrete-event simulation framework is designed to compare FCADR with shortest-path routing, link-success-based routing, and fidelity-aware routing under varying channel loss, coherence time, traffic load, and node or link failures. Performance is evaluated using end-to-end fidelity, request-success rate, distribution delay, memory utilization, and network resilience. The framework aims to improve routing decisions by incorporating quantum-state quality and resource availability into dynamic path selection.

International Journal of Innovative Research in Engineering•Oct 29, 2026•0 citations

Entanglement accessibility measures for the quantum Internet

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

Abstract We define metrics and measures to characterize the ratio of accessible quantum entanglement for complex network failures in the quantum Internet. A complex network failure models a situation in the quantum Internet in which a set of quantum nodes and a set of entangled connections become unavailable. A complex failure can cover a quantum memory failure, a physical link failure, an eavesdropping activity, or any other random physical failure scenarios. Here, we define the terms such as entanglement accessibility ratio, cumulative probability of entanglement accessibility ratio, probabilistic reduction of entanglement accessibility ratio, domain entanglement accessibility ratio, and occurrence coefficient. The proposed methods can be applied to an arbitrary topology quantum network to extract relevant statistics and to handle the quantum network failure scenarios in the quantum Internet.

arXiv:2003.05239•Quantum Information Processing•Feb 15, 2020•30 citations

Adaptive Entanglement Routing for Quantum Networks with Cutoff

Jiaheng Xiong, Qiaolun Zhang, Alberto Gatto +3 more

Quantum networks, with applications like Quantum Key Distribution (QKD), are gaining significant attention. However, their implementation faces challenges due to low entanglement generation success rates and quantum decoherence. Recent quantum technology advancements have extended entanglement memory lifetimes to one minute, termed cutoff, opening new opportunities for entanglement routing. We propose the Adaptive Entanglement Routing (AER) algorithm, which optimizes resource utilization to improve the success probability of serving entanglement and ultimately reduce the time needed for entanglement establishment. AER includes two phases: 1) determine redundant paths based on load and 2) utilize shared entanglements for entanglement swapping. Moreover, we design the highest-success-path (HSP) algorithm to maximize the success probability of entanglement routing with limited quantum memory. These innovative routing algorithms significantly reduce entanglement request failures, resulting in up to 70% reduction in average waiting times.

International Conference on Network and Service Management (CNSM)•Oct 30, 2023•2 citations
The quantum internet enables secure communication, distributed quantum computing, and remote sensing by distributing entanglement among distant nodes [1], [2]. However, establishing end-to-end entanglement across regional networks remains challenging because quantum links experience photon loss, entanglement generation is probabilistic, quantum memories have limited coherence times, and repeater resources are constrained [2], [3]. Conventional shortest-path routing does not jointly account for these quantum-specific limitations. This paper proposes a Fidelity- and Coherence-Aware Dynamic Entanglement Routing (FCADR) framework for regional quantum internet networks. The network is modelled as a graph containing end nodes, quantum repeaters, quantum memories, and lossy entanglement links. FCADR selects routes by jointly considering estimated end-to-end fidelity, entanglement-generation and swapping success probabilities, available quantum-memory capacity, and expected distribution delay. A discrete-event simulation framework is designed to compare FCADR with shortest-path routing, link-success-based routing, and fidelity-aware routing under varying channel loss, coherence time, traffic load, and node or link failures. Performance is evaluated using end-to-end fidelity, request-success rate, distribution delay, memory utilization, and network resilience. The framework aims to improve routing decisions by incorporating quantum-state quality and resource availability into dynamic path selection.
Abstract We define metrics and measures to characterize the ratio of accessible quantum entanglement for complex network failures in the quantum Internet. A complex network failure models a situation in the quantum Internet in which a set of quantum nodes and a set of entangled connections become unavailable. A complex failure can cover a quantum memory failure, a physical link failure, an eavesdropping activity, or any other random physical failure scenarios. Here, we define the terms such as entanglement accessibility ratio, cumulative probability of entanglement accessibility ratio, probabilistic reduction of entanglement accessibility ratio, domain entanglement accessibility ratio, and occurrence coefficient. The proposed methods can be applied to an arbitrary topology quantum network to extract relevant statistics and to handle the quantum network failure scenarios in the quantum Internet.
Quantum networks, with applications like Quantum Key Distribution (QKD), are gaining significant attention. However, their implementation faces challenges due to low entanglement generation success rates and quantum decoherence. Recent quantum technology advancements have extended entanglement memory lifetimes to one minute, termed cutoff, opening new opportunities for entanglement routing. We propose the Adaptive Entanglement Routing (AER) algorithm, which optimizes resource utilization to improve the success probability of serving entanglement and ultimately reduce the time needed for entanglement establishment. AER includes two phases: 1) determine redundant paths based on load and 2) utilize shared entanglements for entanglement swapping. Moreover, we design the highest-success-path (HSP) algorithm to maximize the success probability of entanglement routing with limited quantum memory. These innovative routing algorithms significantly reduce entanglement request failures, resulting in up to 70% reduction in average waiting times.