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 Globecom Workshops (GC Wkshps)

Fidelity-Aware Routing Protocol for Quantum Key Distribution Networks: Key Rate Maximization

P Nithesh Kumar, Binayak Kar

Published Dec 8, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1109/gcwkshps68340.2025.11590986

Related papers

Fidelity-Aware Inter-Zone Based Routing for Throughput Maximization in Quantum Networks

Pankaj Kumar, Binayak Kar

Quantum networks enable advanced applications by connecting quantum nodes through entangled qubit pairs, with entanglement routing being essential for their operation. However, maintaining high-quality entanglement across large-scale networks is challenging due to decoherence, probabilistic generation, limited memory coherence, and fidelity loss. To mitigate these issues, we adopt a zone-based architecture that logically groups nodes into manageable zones, improving scalability, efficiency, and localized entanglement distribution. We propose the Inter-Zone-Based Routing (Inter-ZBR) design, a fidelity-aware framework aimed at enabling high-fidelity entanglement distribution across the network. This Inter-ZBR framework includes three components: (i) QNetwork-Zone Formation (QNZF) algorithm, which divides large-scale networks into well-connected zones to optimize routing decisions and reduce network complexity for entanglement generation; (ii) Inter-Zone Path Selection (IZPS) algorithm, which determines the set of potential shortest paths for each Source-Destination (SD) pair; (iii) The Inter-Zone based Fidelity-Aware Entanglement Routing (IZFAER) algorithm selects optimal routing paths by evaluating entanglement generation rates to maximize network throughput, while incorporating purification techniques to ensure end-to-end fidelity in the network. Simulation results demonstrate that the Inter-ZBR framework improves network throughput by 7.45% to 11.91%, increases end-to-end fidelity by 3.52% to 4.75%, and reduces quantum memory consumption by 9.27% to 21.40%, compared to traditional entanglement routing methods.

IEEE Journal on Selected Areas in Communications•Jan 1, 2026•0 citations

SFTRAP: Satisfying Fidelity Threshold Routing and Adaptive Purification for Throughput Maximum in Quantum Network

Zhi Wang, Tao Gong, Yingpu Nian +6 more

The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.

IEEE Transactions on Communications•Jan 1, 2026•17 citations

E2E Fidelity Aware Routing and Purification for Throughput Maximization in Quantum Networks

Yangming Zhao, Gongming Zhao, Chunming Qiao

This paper studies reliable teleportation of quantum bits (called qubits) in a quantum data network with multiple sources (S) and destinations (D) as well as repeaters. To teleport qubits for a SD pair reliably, not only an entanglement path for the SD pair, but also appropriate purification of the links along the path is required to ensure that the end-to-end (E2E) fidelity of the established entanglement connections is high enough.This is the first work on quantifying the E2E fidelity, and also using this E2E fidelity to determine critical links to achieve the most resource efficient purification. A novel approach called E2E Fidelity aware Routing and Purification (EFiRAP) is proposed to maximize network throughput, i.e., the number of entanglement connections among multiple SD pairs, with each connection having an E2E fidelity above a given required threshold. EFiRAP accomplishes this goal by first preparing multiple candidate entanglement paths and determining optimal purification schemes, and then selecting the final set of entanglement paths that can maximize network throughput under the given quantum resource constraints. Existing works only ensured the fidelity of individual links, rather than the E2E fidelity is above a given threshold. Extensive simulations show that the proposed EFiRAP can enhance network throughput by about 50% when compared with the state-of-the-art approach.

IEEE Conference on Computer Communications (INFOCOM)•May 2, 2022•112 citations

Q-FiRM: Fidelity-based Rate Maximizing Routes for Quantum Networks

Kai Li, Vini Chaudhary, Sara García Sánchez +1 more

Efficient routing of information between end-nodes is a key enabler for secure quantum networks and quantum secret key sharing, which rely on creating and sustaining entangled states over time. However, such pairwise entanglements degrade due to channel loss and the storage of the entangled photons at the network nodes. The state of entanglement in turn impacts fidelity, a metric which quantifies the degree of similarity between a pair of quantum states. In this paper, we propose a routing solution that satisfies threshold fidelity requirements imposed by a receiver on the quantum information received from multiple transmitter nodes. Our solution selects intermediate repeaters from a pool of such nodes within the network to maximize the sum-rate of quantum information transfer. To this extent, we first provide expressions for the fidelity loss between adjacent nodes as well as for the end-to-end quantum data rate. Then, we propose a novel two-stage routing solution that (i) identifies the k-shortest paths for each transmitter using fidelity as cost metric and (ii) (heuristically) assigns a path for each transmitter depending on whether the repeater nodes have a single or multiple available memory units. Simulation results demonstrate that our proposed fidelity-based routing solution satisfies a wide range of fidelity requirements [0.6-0.79] while maximizing the quantum information transfer rate, outperforming the existing distance- and hop-based routing approaches.

IEEE Consumer Communications and Networking Conference•Jan 8, 2023•6 citations

Fault-Tolerant Routing Framework for Maximizing Secret Key Rates in Multi-Hop QKD Networks

Pankaj Kumar, Binayak Kar, Debasmita Basu

Multi-hop Quantum Key Distribution (QKD) networks suffer from probabilistic entanglement generation, limited quantum memory, and constrained channel capacity, which significantly degrade end-to-end key rates. Existing routing approaches primarily optimize shortest paths while neglecting entanglement uncertainty and redundancy. We propose a twostage redundant routing framework that maximizes secure key rate under realistic network constraints. The first stage, Key Distribution Link Establishment (KDLE), formulates a linear programming (LP) model to provision redundant entanglement links subject to capacity and memory constraints. The second stage, Key Distribution Path Selection (KDPS), constructs secure end-to-end paths from successfully established links using swapping probability weighting and CHSH inequality validation. We prove that the proposed algorithm achieves near-optimal key rate with high probability. Simulation results demonstrate significant improvement over existing routing schemes in scalability, robustness, and achievable key rate.

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)•Jul 1, 2026•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 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.
Quantum networks enable advanced applications by connecting quantum nodes through entangled qubit pairs, with entanglement routing being essential for their operation. However, maintaining high-quality entanglement across large-scale networks is challenging due to decoherence, probabilistic generation, limited memory coherence, and fidelity loss. To mitigate these issues, we adopt a zone-based architecture that logically groups nodes into manageable zones, improving scalability, efficiency, and localized entanglement distribution. We propose the Inter-Zone-Based Routing (Inter-ZBR) design, a fidelity-aware framework aimed at enabling high-fidelity entanglement distribution across the network. This Inter-ZBR framework includes three components: (i) QNetwork-Zone Formation (QNZF) algorithm, which divides large-scale networks into well-connected zones to optimize routing decisions and reduce network complexity for entanglement generation; (ii) Inter-Zone Path Selection (IZPS) algorithm, which determines the set of potential shortest paths for each Source-Destination (SD) pair; (iii) The Inter-Zone based Fidelity-Aware Entanglement Routing (IZFAER) algorithm selects optimal routing paths by evaluating entanglement generation rates to maximize network throughput, while incorporating purification techniques to ensure end-to-end fidelity in the network. Simulation results demonstrate that the Inter-ZBR framework improves network throughput by 7.45% to 11.91%, increases end-to-end fidelity by 3.52% to 4.75%, and reduces quantum memory consumption by 9.27% to 21.40%, compared to traditional entanglement routing methods.
The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.
This paper studies reliable teleportation of quantum bits (called qubits) in a quantum data network with multiple sources (S) and destinations (D) as well as repeaters. To teleport qubits for a SD pair reliably, not only an entanglement path for the SD pair, but also appropriate purification of the links along the path is required to ensure that the end-to-end (E2E) fidelity of the established entanglement connections is high enough.This is the first work on quantifying the E2E fidelity, and also using this E2E fidelity to determine critical links to achieve the most resource efficient purification. A novel approach called E2E Fidelity aware Routing and Purification (EFiRAP) is proposed to maximize network throughput, i.e., the number of entanglement connections among multiple SD pairs, with each connection having an E2E fidelity above a given required threshold. EFiRAP accomplishes this goal by first preparing multiple candidate entanglement paths and determining optimal purification schemes, and then selecting the final set of entanglement paths that can maximize network throughput under the given quantum resource constraints. Existing works only ensured the fidelity of individual links, rather than the E2E fidelity is above a given threshold. Extensive simulations show that the proposed EFiRAP can enhance network throughput by about 50% when compared with the state-of-the-art approach.
Efficient routing of information between end-nodes is a key enabler for secure quantum networks and quantum secret key sharing, which rely on creating and sustaining entangled states over time. However, such pairwise entanglements degrade due to channel loss and the storage of the entangled photons at the network nodes. The state of entanglement in turn impacts fidelity, a metric which quantifies the degree of similarity between a pair of quantum states. In this paper, we propose a routing solution that satisfies threshold fidelity requirements imposed by a receiver on the quantum information received from multiple transmitter nodes. Our solution selects intermediate repeaters from a pool of such nodes within the network to maximize the sum-rate of quantum information transfer. To this extent, we first provide expressions for the fidelity loss between adjacent nodes as well as for the end-to-end quantum data rate. Then, we propose a novel two-stage routing solution that (i) identifies the k-shortest paths for each transmitter using fidelity as cost metric and (ii) (heuristically) assigns a path for each transmitter depending on whether the repeater nodes have a single or multiple available memory units. Simulation results demonstrate that our proposed fidelity-based routing solution satisfies a wide range of fidelity requirements [0.6-0.79] while maximizing the quantum information transfer rate, outperforming the existing distance- and hop-based routing approaches.
Multi-hop Quantum Key Distribution (QKD) networks suffer from probabilistic entanglement generation, limited quantum memory, and constrained channel capacity, which significantly degrade end-to-end key rates. Existing routing approaches primarily optimize shortest paths while neglecting entanglement uncertainty and redundancy. We propose a twostage redundant routing framework that maximizes secure key rate under realistic network constraints. The first stage, Key Distribution Link Establishment (KDLE), formulates a linear programming (LP) model to provision redundant entanglement links subject to capacity and memory constraints. The second stage, Key Distribution Path Selection (KDPS), constructs secure end-to-end paths from successfully established links using swapping probability weighting and CHSH inequality validation. We prove that the proposed algorithm achieves near-optimal key rate with high probability. Simulation results demonstrate significant improvement over existing routing schemes in scalability, robustness, and achievable key rate.
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.