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
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.