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 Consumer Electronics - Taiwan (ICCE-Taiwan)

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

Pankaj Kumar, Binayak Kar, Debasmita Basu

Published Jul 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icce-taiwan71481.2026.11652792

Related papers

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

Fast and Secure Routing Algorithms for Quantum Key Distribution Networks

Vishnu B, Abhishek Sinha

This paper considers the problem of secure packet routing at the maximum achievable rate in a Quantum key distribution (QKD) network. Assume that a QKD protocol generates symmetric private keys for secure communication over each link in a multi-hop network. The quantum key generation process, which is affected by noise, is assumed to be modeled by a stochastic counting process. Packets are first encrypted with the available quantum keys for each hop and then transmitted on a point-to-point basis over the communication links. A fundamental problem that arises in this setting is to design a secure and capacity-achieving routing policy that accounts for the time-varying availability of the quantum keys for encryption and finite link capacities for transmission. In this paper, by combining the QKD protocol with the Universal Max Weight (UMW) routing policy [1] – [3], we design a new secure throughput-optimal routing policy, called Tandem Queue Decomposition (TQD). TQD solves the problem of secure routing efficiently for a wide class of traffic, including unicast, broadcast, and multicast. One of our main contributions in this paper is to show that the problem can be reduced to the usual generalized network flow problem on a transformed network without the key availability constraints. Simulation results show that the proposed policy incurs a substantially smaller delay as compared to the state-of-the-art routing and key management policies. The proof of throughput-optimality of the proposed policy makes use of the Lyapunov stability theory along with a careful treatment of the key-storage dynamics.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 4, 2022•5 citations

Redundant Entanglement Provisioning and Selection for Throughput Maximization in Quantum Networks

Yangming Zhao, Chunming Qiao

Quantum communication using qubits based on the principle of entangled photons is a promising solution to improve network security. However, it is difficult to successfully create an entanglement link or connection between two nodes, especially when they are far apart from each other. In addition, only one qubit can be exchanged over an established entanglement connection, resulting in a low throughput.In this paper, we propose Redundant Entanglement Pro-visioning and Selection (REPS) to maximize the throughput for multiple source-destination (SD) pairs in a circuit-switched, multi-hop quantum network. REPS has two distinct features: (i). It provisions backup resources for extra entanglement links between adjacent nodes for failure-tolerance; and (ii). It provides flexibility in selecting successfully created entanglement links to establish entanglement connections for the SD pairs to achieve network-wide optimization. Extensive analysis and simulations show that REPS can achieve optimal routing with a high probability, and improves the throughput by up to 68.35% over the highest-performing algorithms in existence. In addition, it also improves the fairness among the SD pairs in the networks.

IEEE Conference on Computer Communications (INFOCOM)•May 10, 2021•126 citations

Minimum Path Cost Multi-path Routing Algorithm with No Intersecting Links in Quantum Key Distribution Networks

Minghui Miao, Shuo Fang, Weijie Wu +2 more

Quantum key distribution (QKD) provides information-theoretic security based on quantum mechanics, and as quantum key distribution becomes increasingly practical, questions of how to employ it effectively over largescale networks and large distances becomes increasingly important. In this work, we investigate the B92 entanglement based QKD protocol and a five-layer QKD network architecture consisting of trusted relay nodes. Previous research seldom focused on the ground routing mechanism of QKD networks in detail. Since no intersecting links are beneficial to reducing the key consumption rate and improving link security, combined with the core idea of reducing the number of link relay hops, we propose a minimum path cost multi-path routing algorithm for no intersecting links in quantum key distribution networks. By analyzing the security of the link, we effectively reduce the number of relay nodes and the number of relay links that pass through and give priority to the routing scheme with the minimum number of hops in the number of relay hops, which avoids the congestion and waste caused by the existence of interleaved multi-path in traditional multi-path routing. Meanwhile, the scheme effectively improves the quality of service index, avoids the generation and consumption of redundant keys, and reduces the waste of quantum key resources.

IEEE International Conference on Information Systems and Computer Aided Education (ICISCAE)•Sep 23, 2023•3 citations

Fast and Secure Routing Algorithms for Quantum Key Distribution Networks

Md Shahbaz Akhtar, Gnanambikai Krishnakumar, B Vishnu +1 more

We investigate the problem of fast and secure packet routing in multi-hop Quantum Key Distribution (QKD) networks. We consider a practical trusted-node setup where a QKD protocol randomly generates symmetric private key pairs over each QKD-enabled link in a network. Packets are first encrypted with the available quantum keys and then transmitted on a point-to-point basis. A fundamental problem in this setting is the design of a secure and capacity-achieving routing policy that takes into account the time-varying availability of the encryption keys and diverse physical-layer link capacities. To address this problem, we propose a new secure throughput-optimal policy called Tandem Queue Decomposition (TQD). The TQD policy is designed by incorporating the QKD process into the Universal Max Weight (UMW) routing policy. We show that the TQD policy achieves the entire secure capacity region for a broad class of traffic, including unicast, broadcast, multicast, and anycast. The TQD policy operates by reducing the problem to the generalized network flow problem without the key availability constraints over a transformed network. The throughput-optimality of the TQD policy is established using the Lyapunov stability theory by carefully analyzing the interdependent queueing process and the key-storage dynamics. Finally, we demonstrate the practical efficiency of the TQD policy over the existing routing algorithms by numerically comparing their performance on a realistic simulator built on top of the state-of-the-art OMNeT++ network simulator platform.

arXiv:2109.07934•IEEE/ACM Transactions on Networking•Feb 23, 2023•28 citations

Optimal Multipartite Entanglement Routing Model in Quantum Networks

Yudai Ogata, Imran Ahmed, Eiji Oki

Future quantum networks will support not only point-to-point communication but also multiparty applications, such as multiparty quantum key distribution and quantum secret sharing. While bipartite entanglement routing has been studied extensively, multipartite routing with probabilistic link generation and fusion operations has not been previously addressed. This paper proposes a routing model for multipartite entanglement distribution, formulated as an optimization problem using a mixed-integer linear programming problem. This model explicitly incorporates the probabilistic nature of quantum operations, aiming to maximize the probability of successfully distributing a multipartite entangled state, particularly the Greenberger-Horne-Zeilinger state, to all requesting users. Maximizing this probability is essential for ensuring the feasibility and robustness of multiparty quantum communication in practical networks, thereby enabling the reliable execution of multiparty quantum applications. Numerical results show that the proposed model improves the success probability and maintains robustness across diverse network conditions, including scenarios with stringent quantum memory limitations and relatively large terminal sets.

IEEE International Conference on High Performance Switching and Routing (HPSR)•Jun 1, 2026•0 citations
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.
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.
This paper considers the problem of secure packet routing at the maximum achievable rate in a Quantum key distribution (QKD) network. Assume that a QKD protocol generates symmetric private keys for secure communication over each link in a multi-hop network. The quantum key generation process, which is affected by noise, is assumed to be modeled by a stochastic counting process. Packets are first encrypted with the available quantum keys for each hop and then transmitted on a point-to-point basis over the communication links. A fundamental problem that arises in this setting is to design a secure and capacity-achieving routing policy that accounts for the time-varying availability of the quantum keys for encryption and finite link capacities for transmission. In this paper, by combining the QKD protocol with the Universal Max Weight (UMW) routing policy [1] – [3], we design a new secure throughput-optimal routing policy, called Tandem Queue Decomposition (TQD). TQD solves the problem of secure routing efficiently for a wide class of traffic, including unicast, broadcast, and multicast. One of our main contributions in this paper is to show that the problem can be reduced to the usual generalized network flow problem on a transformed network without the key availability constraints. Simulation results show that the proposed policy incurs a substantially smaller delay as compared to the state-of-the-art routing and key management policies. The proof of throughput-optimality of the proposed policy makes use of the Lyapunov stability theory along with a careful treatment of the key-storage dynamics.
Quantum communication using qubits based on the principle of entangled photons is a promising solution to improve network security. However, it is difficult to successfully create an entanglement link or connection between two nodes, especially when they are far apart from each other. In addition, only one qubit can be exchanged over an established entanglement connection, resulting in a low throughput.In this paper, we propose Redundant Entanglement Pro-visioning and Selection (REPS) to maximize the throughput for multiple source-destination (SD) pairs in a circuit-switched, multi-hop quantum network. REPS has two distinct features: (i). It provisions backup resources for extra entanglement links between adjacent nodes for failure-tolerance; and (ii). It provides flexibility in selecting successfully created entanglement links to establish entanglement connections for the SD pairs to achieve network-wide optimization. Extensive analysis and simulations show that REPS can achieve optimal routing with a high probability, and improves the throughput by up to 68.35% over the highest-performing algorithms in existence. In addition, it also improves the fairness among the SD pairs in the networks.
Quantum key distribution (QKD) provides information-theoretic security based on quantum mechanics, and as quantum key distribution becomes increasingly practical, questions of how to employ it effectively over largescale networks and large distances becomes increasingly important. In this work, we investigate the B92 entanglement based QKD protocol and a five-layer QKD network architecture consisting of trusted relay nodes. Previous research seldom focused on the ground routing mechanism of QKD networks in detail. Since no intersecting links are beneficial to reducing the key consumption rate and improving link security, combined with the core idea of reducing the number of link relay hops, we propose a minimum path cost multi-path routing algorithm for no intersecting links in quantum key distribution networks. By analyzing the security of the link, we effectively reduce the number of relay nodes and the number of relay links that pass through and give priority to the routing scheme with the minimum number of hops in the number of relay hops, which avoids the congestion and waste caused by the existence of interleaved multi-path in traditional multi-path routing. Meanwhile, the scheme effectively improves the quality of service index, avoids the generation and consumption of redundant keys, and reduces the waste of quantum key resources.
We investigate the problem of fast and secure packet routing in multi-hop Quantum Key Distribution (QKD) networks. We consider a practical trusted-node setup where a QKD protocol randomly generates symmetric private key pairs over each QKD-enabled link in a network. Packets are first encrypted with the available quantum keys and then transmitted on a point-to-point basis. A fundamental problem in this setting is the design of a secure and capacity-achieving routing policy that takes into account the time-varying availability of the encryption keys and diverse physical-layer link capacities. To address this problem, we propose a new secure throughput-optimal policy called Tandem Queue Decomposition (TQD). The TQD policy is designed by incorporating the QKD process into the Universal Max Weight (UMW) routing policy. We show that the TQD policy achieves the entire secure capacity region for a broad class of traffic, including unicast, broadcast, multicast, and anycast. The TQD policy operates by reducing the problem to the generalized network flow problem without the key availability constraints over a transformed network. The throughput-optimality of the TQD policy is established using the Lyapunov stability theory by carefully analyzing the interdependent queueing process and the key-storage dynamics. Finally, we demonstrate the practical efficiency of the TQD policy over the existing routing algorithms by numerically comparing their performance on a realistic simulator built on top of the state-of-the-art OMNeT++ network simulator platform.
Future quantum networks will support not only point-to-point communication but also multiparty applications, such as multiparty quantum key distribution and quantum secret sharing. While bipartite entanglement routing has been studied extensively, multipartite routing with probabilistic link generation and fusion operations has not been previously addressed. This paper proposes a routing model for multipartite entanglement distribution, formulated as an optimization problem using a mixed-integer linear programming problem. This model explicitly incorporates the probabilistic nature of quantum operations, aiming to maximize the probability of successfully distributing a multipartite entangled state, particularly the Greenberger-Horne-Zeilinger state, to all requesting users. Maximizing this probability is essential for ensuring the feasibility and robustness of multiparty quantum communication in practical networks, thereby enabling the reliable execution of multiparty quantum applications. Numerical results show that the proposed model improves the success probability and maintains robustness across diverse network conditions, including scenarios with stringent quantum memory limitations and relatively large terminal sets.