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

International Conference on Consumer Electronics

Starvation-aware Entanglement Quantum Routing for Quantum Key Distribution

Shengyu Zhang, Kwan Lawrence Yeung

Published Jan 6, 2024• 0 citations
Publisher

Abstract

The conventional entanglement routing algorithms favor the shorter path to maximize the throughput, which leads to the starvation problem in Quantum Key Distribution (QKD). In this paper, we focus on solving the starvation problem in QKD. We design a starvation-aware entanglement routing algorithm, which gives higher priority to the QKD task facing the starvation problem. Specifically, we prioritize the QKD task with a longer Key Distribution Time (KDT). The entangled qubit pairs will first be assigned to the path with the highest priority. Simulation results show that our proposed starvation-aware entanglement routing algorithm can reduce the maximum KDT by up to ten times.

DOI
10.1109/icce59016.2024.10444263

Related papers

Fragmentation-Aware Entanglement Routing for Quantum Networks

Shengyu Zhang, Shouqian Shi, Chen Qian +1 more

New capabilities enabled by quantum networks, e.g. quantum key distribution, rely on the concurrent quantum entanglements via multiple untrusted repeaters between the source-destination pairs, which is known as quantum routing. Existing quantum routing algorithms pre-assign the free qubits to specific paths, in order to avoid resource contention in the process of entanglement swapping. Since not all pre-assigned qubits can be utilized, the resource fragmentation problem caused can limit the network throughout. In this paper, a new fragmentation-aware entanglement routing (FER) algorithm is proposed. With FER, the entangled qubits are shared by all the paths, and the resource contention problem is solved by a priority connection mechanism. Simulation results show that FER consistently outperforms existing algorithms under different network settings.

Journal of Lightwave Technology•Apr 28, 2021•39 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

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-Aware Routing Protocol for Quantum Key Distribution Networks: Key Rate Maximization

P Nithesh Kumar, Binayak Kar

Quantum Key Distribution (QKD) via quantum entanglement ensures ultra-secure communication in QKD networks. However, a fundamental challenge in these networks is the degradation of entanglement fidelity over long distances, leading to reduced key rates and inefficient resource utilization. Existing approaches primarily focus on optimizing QKD network architectures but often neglect the impact of fidelity degradation, a critical factor influencing key distribution performance. This paper proposes a novel Fidelity-Aware Routing Protocol (FARP) to maximize QKD distribution for all source-destination (SD) pair requests. FARP introduces two key components: 1) Key Path Extraction (KPE): A novel approach that formulates QKD path selection as a mixed-integer linear programming (MILP) problem to identify a set of feasible shortest paths while considering network constraints. 2) Fidelity-Aware Key Rate Distribution (FAKRD): A mechanism that optimizes key rate allocation by integrating entanglement purification, dynamically adjusting path selection based on fidelity thresholds, and mitigating quantum channel losses to enhance overall QKD efficiency. Simulation results demonstrate that the proposed FARP significantly improves key distribution performance compared to existing routing schemes, achieving higher key rates and lower qubit error rates while maintaining high-fidelity entangled connections.

IEEE Globecom Workshops (GC Wkshps)•Dec 8, 2025•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

Quantum Entanglement Routing in Distributed Computing

Jincheng Zhang

This paper proposes a novel routing algorithm for distributed computing networks leveraging the unique properties of quantum entanglement. The core concept involves utilizing quantum entanglement to create "quantum routes" for computational tasks, effectively bypassing the limitations of traditional physical network topologies. The algorithm is designed to optimize the generation and utilization of entanglement states, thereby achieving optimal task transmission paths and reducing latency and energy consumption. The theoretical framework is presented, outlining the key mathematical formulations and the proposed routing protocol. This approach represents a significant departure from conventional distributed computing routing methods, offering a potentially transformative solution for high-performance and energy-efficient distributed systems. Specifically, the algorithm aims to minimize the quantum distance (Q-distance) between nodes, where Q-distance is defined as the number of entangled pairs required to establish a communication channel. The efficiency of the proposed routing is evaluated through analytical models and discussed in terms of scalability and adaptability within complex distributed computing environments.

•Aug 31, 2026•0 citations
The conventional entanglement routing algorithms favor the shorter path to maximize the throughput, which leads to the starvation problem in Quantum Key Distribution (QKD). In this paper, we focus on solving the starvation problem in QKD. We design a starvation-aware entanglement routing algorithm, which gives higher priority to the QKD task facing the starvation problem. Specifically, we prioritize the QKD task with a longer Key Distribution Time (KDT). The entangled qubit pairs will first be assigned to the path with the highest priority. Simulation results show that our proposed starvation-aware entanglement routing algorithm can reduce the maximum KDT by up to ten times.
New capabilities enabled by quantum networks, e.g. quantum key distribution, rely on the concurrent quantum entanglements via multiple untrusted repeaters between the source-destination pairs, which is known as quantum routing. Existing quantum routing algorithms pre-assign the free qubits to specific paths, in order to avoid resource contention in the process of entanglement swapping. Since not all pre-assigned qubits can be utilized, the resource fragmentation problem caused can limit the network throughout. In this paper, a new fragmentation-aware entanglement routing (FER) algorithm is proposed. With FER, the entangled qubits are shared by all the paths, and the resource contention problem is solved by a priority connection mechanism. Simulation results show that FER consistently outperforms existing algorithms under different network settings.
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.
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.
Quantum Key Distribution (QKD) via quantum entanglement ensures ultra-secure communication in QKD networks. However, a fundamental challenge in these networks is the degradation of entanglement fidelity over long distances, leading to reduced key rates and inefficient resource utilization. Existing approaches primarily focus on optimizing QKD network architectures but often neglect the impact of fidelity degradation, a critical factor influencing key distribution performance. This paper proposes a novel Fidelity-Aware Routing Protocol (FARP) to maximize QKD distribution for all source-destination (SD) pair requests. FARP introduces two key components: 1) Key Path Extraction (KPE): A novel approach that formulates QKD path selection as a mixed-integer linear programming (MILP) problem to identify a set of feasible shortest paths while considering network constraints. 2) Fidelity-Aware Key Rate Distribution (FAKRD): A mechanism that optimizes key rate allocation by integrating entanglement purification, dynamically adjusting path selection based on fidelity thresholds, and mitigating quantum channel losses to enhance overall QKD efficiency. Simulation results demonstrate that the proposed FARP significantly improves key distribution performance compared to existing routing schemes, achieving higher key rates and lower qubit error rates while maintaining high-fidelity entangled connections.
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.
This paper proposes a novel routing algorithm for distributed computing networks leveraging the unique properties of quantum entanglement. The core concept involves utilizing quantum entanglement to create "quantum routes" for computational tasks, effectively bypassing the limitations of traditional physical network topologies. The algorithm is designed to optimize the generation and utilization of entanglement states, thereby achieving optimal task transmission paths and reducing latency and energy consumption. The theoretical framework is presented, outlining the key mathematical formulations and the proposed routing protocol. This approach represents a significant departure from conventional distributed computing routing methods, offering a potentially transformative solution for high-performance and energy-efficient distributed systems. Specifically, the algorithm aims to minimize the quantum distance (Q-distance) between nodes, where Q-distance is defined as the number of entangled pairs required to establish a communication channel. The efficiency of the proposed routing is evaluated through analytical models and discussed in terms of scalability and adaptability within complex distributed computing environments.