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:2407.14407 · IET Quantum Communication

Routing in quantum networks with end‐to‐end knowledge

Vinay Kumar, Claudio Cicconetti, Marco Conti, Andrea Passarella

Published Jan 1, 2025• 8 citations
arXivHTMLPDF

Abstract

Abstract Given the diverse array of physical systems available for quantum computing and the absence of a well‐defined quantum Internet protocol stack, the design and optimisation of quantum networking protocols remain largely unexplored. To address this, the authors introduce an approach that facilitates the establishment of paths capable of delivering end‐to‐end fidelity above a specified threshold, without requiring detailed knowledge of the quantum network's properties. In this study, the authors define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra's shortest path algorithm and a fully knowledge‐aware algorithm through simulations. The authors’ results demonstrate that one of the proposed algorithms consistently outperforms the other methods in delivering paths above the fidelity threshold, across various network topologies and the number of source‐destination pairs involved, while maintaining significant levels of fairness among the users and being robust to inaccurate estimations of the expected end‐to‐end fidelity.

DOI
10.1049/qtc2.70000

Related papers

Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

Sara Santos, Francisco A. Monteiro, Bruno Coelho Coutinho +1 more

A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multi-objective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-to-end entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with respect to the number of nodes in the network, showing that the shortest-path problem in quantum networks can be solved with a complexity very close to the one of the classical counterparts. That is analytically proved for the case where all the links of a path have the same fidelity (homogeneous model). The algorithm is also adapted to a particular type of path extension, where different links along a path can be purified to different degrees, asserting its flexibility and near-to-linearity even when heterogeneous fidelities along the sections of a path are considered.

IEEE Access•Jan 1, 2023•21 citations

A Heuristic for Entanglement Routing in Quantum Networks

Wei-Hsun Huang, Dung H. P. Nguyen, Ting-Xiu Kuo +3 more

Due to the fact that quantum networks can provide higher security in communications, many related issues have been presented and addressed recently. One of the most important issues is to study the routing in quantum networks with multiple source-destination pairs while maximizing the total end-to-end entanglement rate. In previous studies, the shortest paths are typically selected as the entanglement paths for a source-destination pair to increase the total end-to-end entanglement rate. However, this approach is only efficient once the network resources are sufficient. Moreover, source-destination pairs only require a specific entanglement rate rather than the shortest paths. Therefore, in this paper, we suppose that each source-destination pair requires an upper bound of the entanglement rate. Under this assumption, a novel problem is proposed to construct entanglement paths for a set of multiple source-destination pairs such that the total end-to-end entanglement rate is maximized. We then propose a greedy algorithm to solve the problem. Finally, the simulation is conducted to evaluate the performance of the proposed algorithm.

International Conference on Applied System Innovation•Apr 21, 2023•0 citations

Routing in Memoryless Quantum Networks: A Lexicographic Approach with Fidelity Guarantee

Hilal Sultan Duranoglu Tunc, Milad Ghadimi, Riccardo Bassoli +1 more

While routing methods in the literature often assume the use of quantum memory, this study proposes a routing algorithm designed for memoryless quantum networks. The algorithm leverages lexicographic optimization principles to hierarchically prioritize and optimize multiple objectives such as distance and capacity. This approach identifies the shortest paths between source-destination pairs within the decoherence time and selects a path that satisfies the minimum capacity require ments. To prevent entanglement fidelity from dropping below the desired threshold, purification is applied. Simulation results demonstrate the algorithm’s ability to manage latency while enhancing throughput effectively. The study comprehensively analyzes performance metrics under varying capacity values, request numbers, and threshold fidelity levels. Additionally, to the best of our knowledge, it is the first study to calculate latency, including queuing delay, in the context of quantum networks. Future research aims to explore optimal threshold fidelity values that balance throughput and latency performance.

IEEE Symposium on Computers and Communications (ISCC)•Jul 2, 2025•0 citations

Traffic-Aware Routing Algorithm in Quantum Network

Puli Li, Weihai Li

Quantum network can provide end-to-end entanglements through quantum operations, supporting various quantum applications such as quantum key distribution and distributed quantum computing. However, many previous proposals for quantum networks assumed the division of quantum network into time slots and batch processing of network communication tasks, performing poorly in dynamic network scenarios and not fully utilizing network resources. This work focuses on the routing problem in entanglement quantum networks, aiming to provide more efficient end-to-end entanglement establishment for upper-layer applications. We propose an on-demand routing algorithm that dynamically adjusts the optimal path based on the current network conditions. Specifically, we consider the benefits of path width for quantum networks and propose an algorithm for finding the shortest wide path. Using this algorithm, each node establishes its own routing table. Additionally, to dynamically avoid network hotspots, we introduce the concept of traffic to reflect the busyness of nodes. Finally, using a dynamic cost calculation method as the routing metric, we select the optimal path for the current request. To evaluate the performance of the proposed quantum routing algorithm, we conducted simulation experiments on SimQN quantum simulation platform. The results show that our approach improves network throughput by 14 percent compared to existing solutions.

International Conference on Computer and Communication Systems (ICCCS)•Apr 19, 2024•0 citations

Fidelity-Guaranteed Entanglement Routing in Quantum Networks

Jian Li, Mingjun Wang, Kaiping Xue +4 more

Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (S-D) pairs in quantum networks. In our proposal, we first consider the single S-D pair scenario and design an iterative routing algorithm, Q-PATH, to find the optimal purification decisions along the routing path with minimum entangled pair cost. Further, a low-complexity routing algorithm using an extended Dijkstra algorithm, Q-LEAP, is designed to reduce the computational complexity by using a simple but effective purification decision method. Finally, we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and re-routing process for multiple routing requests. Simulation results show that the proposed algorithms not only can provide fidelity-guaranteed routing solutions, but also has superior performance in terms of throughput, fidelity of end-to-end entanglement connection, and resource utilization ratio, compared with the existing routing scheme.

arXiv:2111.07764•IEEE Transactions on Communications•Aug 19, 2022•154 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
Abstract Given the diverse array of physical systems available for quantum computing and the absence of a well‐defined quantum Internet protocol stack, the design and optimisation of quantum networking protocols remain largely unexplored. To address this, the authors introduce an approach that facilitates the establishment of paths capable of delivering end‐to‐end fidelity above a specified threshold, without requiring detailed knowledge of the quantum network's properties. In this study, the authors define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra's shortest path algorithm and a fully knowledge‐aware algorithm through simulations. The authors’ results demonstrate that one of the proposed algorithms consistently outperforms the other methods in delivering paths above the fidelity threshold, across various network topologies and the number of source‐destination pairs involved, while maintaining significant levels of fairness among the users and being robust to inaccurate estimations of the expected end‐to‐end fidelity.
A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multi-objective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-to-end entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with respect to the number of nodes in the network, showing that the shortest-path problem in quantum networks can be solved with a complexity very close to the one of the classical counterparts. That is analytically proved for the case where all the links of a path have the same fidelity (homogeneous model). The algorithm is also adapted to a particular type of path extension, where different links along a path can be purified to different degrees, asserting its flexibility and near-to-linearity even when heterogeneous fidelities along the sections of a path are considered.
Due to the fact that quantum networks can provide higher security in communications, many related issues have been presented and addressed recently. One of the most important issues is to study the routing in quantum networks with multiple source-destination pairs while maximizing the total end-to-end entanglement rate. In previous studies, the shortest paths are typically selected as the entanglement paths for a source-destination pair to increase the total end-to-end entanglement rate. However, this approach is only efficient once the network resources are sufficient. Moreover, source-destination pairs only require a specific entanglement rate rather than the shortest paths. Therefore, in this paper, we suppose that each source-destination pair requires an upper bound of the entanglement rate. Under this assumption, a novel problem is proposed to construct entanglement paths for a set of multiple source-destination pairs such that the total end-to-end entanglement rate is maximized. We then propose a greedy algorithm to solve the problem. Finally, the simulation is conducted to evaluate the performance of the proposed algorithm.
While routing methods in the literature often assume the use of quantum memory, this study proposes a routing algorithm designed for memoryless quantum networks. The algorithm leverages lexicographic optimization principles to hierarchically prioritize and optimize multiple objectives such as distance and capacity. This approach identifies the shortest paths between source-destination pairs within the decoherence time and selects a path that satisfies the minimum capacity require ments. To prevent entanglement fidelity from dropping below the desired threshold, purification is applied. Simulation results demonstrate the algorithm’s ability to manage latency while enhancing throughput effectively. The study comprehensively analyzes performance metrics under varying capacity values, request numbers, and threshold fidelity levels. Additionally, to the best of our knowledge, it is the first study to calculate latency, including queuing delay, in the context of quantum networks. Future research aims to explore optimal threshold fidelity values that balance throughput and latency performance.
Quantum network can provide end-to-end entanglements through quantum operations, supporting various quantum applications such as quantum key distribution and distributed quantum computing. However, many previous proposals for quantum networks assumed the division of quantum network into time slots and batch processing of network communication tasks, performing poorly in dynamic network scenarios and not fully utilizing network resources. This work focuses on the routing problem in entanglement quantum networks, aiming to provide more efficient end-to-end entanglement establishment for upper-layer applications. We propose an on-demand routing algorithm that dynamically adjusts the optimal path based on the current network conditions. Specifically, we consider the benefits of path width for quantum networks and propose an algorithm for finding the shortest wide path. Using this algorithm, each node establishes its own routing table. Additionally, to dynamically avoid network hotspots, we introduce the concept of traffic to reflect the busyness of nodes. Finally, using a dynamic cost calculation method as the routing metric, we select the optimal path for the current request. To evaluate the performance of the proposed quantum routing algorithm, we conducted simulation experiments on SimQN quantum simulation platform. The results show that our approach improves network throughput by 14 percent compared to existing solutions.
Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (S-D) pairs in quantum networks. In our proposal, we first consider the single S-D pair scenario and design an iterative routing algorithm, Q-PATH, to find the optimal purification decisions along the routing path with minimum entangled pair cost. Further, a low-complexity routing algorithm using an extended Dijkstra algorithm, Q-LEAP, is designed to reduce the computational complexity by using a simple but effective purification decision method. Finally, we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and re-routing process for multiple routing requests. Simulation results show that the proposed algorithms not only can provide fidelity-guaranteed routing solutions, but also has superior performance in terms of throughput, fidelity of end-to-end entanglement connection, and resource utilization ratio, compared with the existing routing scheme.
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.