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

IEEE International Conference on Advanced Networks and Telecommunications Systems

Entanglement Routing Design for Enhancing Key Distribution Rate in QKD Networks

P Nithesh Kumar, Binayak Kar, Neel Kanth Kundu

Published Dec 15, 2025• 1 citation
Publisher
DOI
10.1109/ants66931.2025.11429865

Related papers

Optimized Entanglement Routing for Enhanced Quantum Key Distribution Performance in Quantum Networks

Hongding Zhang, Sheng Huo, Ping Jiang +1 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2026•0 citations

An On-demand Routing Scheme with QoS Provisioning for QKD Networks

Yuqi Yang, Zhonghui Li, Jian Li +4 more

As an emerging technology, Quantum Key Distribution (QKD) can provide information-theoretically secure keys for cryptographic purposes and it attracts worldwide attention. To extend its service capabilities from point-to-point communication to arbitrary remote communication parties, large-scale QKD network construction is underway. However, the dynamic and limited available resources of QKD networks remain a major obstacle to routing design. Numerous studies aim at designing routing schemes to maximize the overall network performance. While these routing schemes efficiently support end-to-end key relaying, their effectiveness diminishes when addressing diverse Quality of Service (QoS) requirements. In this paper, we propose an on-demand routing scheme with QoS provisioning to enhance end-to-end key relaying rates. Our scheme operates in two phases: an on-demand resource probing phase to dynamically update global network resource information and a routing decision phase that leverages a maximum flow model to optimize key relaying while satisfying rate-demand constraints. Simulation results on the SimQN platform demonstrate that the proposed scheme significantly improves end-to-end key relaying through-put and delay, providing effective QoS support for rate-demand QKD applications.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation

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

Efficient Entanglement Routing for Enhancing Throughput in Quantum Networks

Yaliang Shi, Zhiwei Zhao, Geyong Min +2 more

IEEE Internet of Things Journal•Jan 1, 2026•0 citations

A quantum key distribution routing scheme for hybrid-trusted QKD network system

Liquan Chen, Jingqi Chen, Qian-Ye Chen +1 more

Quantum Information Processing•Jan 19, 2023•21 citations

Starvation-aware Entanglement Quantum Routing for Quantum Key Distribution

Shengyu Zhang, Kwan Lawrence Yeung

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.

International Conference on Consumer Electronics•Jan 6, 2024•0 citations
As an emerging technology, Quantum Key Distribution (QKD) can provide information-theoretically secure keys for cryptographic purposes and it attracts worldwide attention. To extend its service capabilities from point-to-point communication to arbitrary remote communication parties, large-scale QKD network construction is underway. However, the dynamic and limited available resources of QKD networks remain a major obstacle to routing design. Numerous studies aim at designing routing schemes to maximize the overall network performance. While these routing schemes efficiently support end-to-end key relaying, their effectiveness diminishes when addressing diverse Quality of Service (QoS) requirements. In this paper, we propose an on-demand routing scheme with QoS provisioning to enhance end-to-end key relaying rates. Our scheme operates in two phases: an on-demand resource probing phase to dynamically update global network resource information and a routing decision phase that leverages a maximum flow model to optimize key relaying while satisfying rate-demand constraints. Simulation results on the SimQN platform demonstrate that the proposed scheme significantly improves end-to-end key relaying through-put and delay, providing effective QoS support for rate-demand QKD applications.
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.
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.