Optimizing Quantum Key Distribution Network Performance using Graph Neural Networks
- URL: http://arxiv.org/abs/2511.16468v1
- Date: Thu, 20 Nov 2025 15:36:57 GMT
- Title: Optimizing Quantum Key Distribution Network Performance using Graph Neural Networks
- Authors: Akshit Pramod Anchan, Ameiy Acharya, Leki Chom Thungon,
- Abstract summary: This paper proposes an optimization of Quantum Key Distribution (QKD) Networks using Graph Neural Networks (GNN) framework.<n> Experimental results demonstrate that the GNN-optimized QKD network achieves a substantial increase in total key rate (from 27.1 Kbits/s to 470 Kbits/s)<n>We analyze network performance across varying scales (10 to 250 nodes), showing improved link prediction accuracy and enhanced key generation rate in medium-sized networks.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper proposes an optimization of Quantum Key Distribution (QKD) Networks using Graph Neural Networks (GNN) framework. Today, the development of quantum computers threatens the security systems of classical cryptography. Moreover, as QKD networks are designed for protecting secret communication, they suffer from multiple operational difficulties: adaptive to dynamic conditions, optimization for multiple parameters and effective resource utilization. In order to overcome these obstacles, we propose a GNN-based framework which can model QKD networks as dynamic graphs and extracts exploitable characteristics from these networks' structure. The graph contains not only topological information but also specific characteristics associated with quantum communication (the number of edges between nodes, etc). Experimental results demonstrate that the GNN-optimized QKD network achieves a substantial increase in total key rate (from 27.1 Kbits/s to 470 Kbits/s), a reduced average QBER (from 6.6% to 6.0%), and maintains path integrity with a slight reduction in average transmission distance (from 7.13 km to 6.42 km). Furthermore, we analyze network performance across varying scales (10 to 250 nodes), showing improved link prediction accuracy and enhanced key generation rate in medium-sized networks. This work introduces a novel operation mode for QKD networks, shifting the paradigm of network optimization through adaptive and scalable quantum communication systems that enhance security and performance.
Related papers
- Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks [43.88530200050682]
This paper presents a graph neural network (GNN)-based multicast routing framework that jointly minimizes total transmission cost and supports user-specific video quality requirements.<n>The proposed method closely approximates optimal dynamic programming-based solutions while significantly reducing computational complexity.<n>The results also confirm strong generalization to large-scale and dynamic network topologies, highlighting the method's potential for real-time deployment in 6G multimedia delivery scenarios.
arXiv Detail & Related papers (2025-10-13T08:00:45Z) - Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
arXiv Detail & Related papers (2025-09-12T18:41:10Z) - The Proportional Fair Scheduler in Wavelength-Multiplexed Quantum Networks [1.649938899766112]
Quantum Key Distribution (QKD) protocols generate secret keys from entangled photons.<n>We propose simple distributed algorithms for QKD networks generating secret keys.<n>We find that a proportional fairness pumping strategy (PF-PS) stands out by dynamically prioritizing users with lower average secret key rates.
arXiv Detail & Related papers (2025-07-18T15:10:43Z) - Scaling Limits of Quantum Repeater Networks [62.75241407271626]
Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing.
Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability.
In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
arXiv Detail & Related papers (2023-05-15T14:57:01Z) - Dynamic Routing for Quantum Key Distribution Networks [2.913123182364138]
In this paper, we consider quantum key distribution (QKD) in a quantum network with both quantum repeaters and a small number of trusted nodes.
We develop a new dynamic routing strategy that makes routing decisions based on the current network state, as well as evaluate various classical/quantum post-processing techniques.
arXiv Detail & Related papers (2022-12-06T17:17:12Z) - Optimization of QKD Networks with Classical and Quantum Annealing [0.7827586118586438]
Quantum Key Distribution (QKD) hardware is used in a tier 1 provider network.
The ensemble of QKD systems needs to be able to exchange as many encryption keys.
Redundancy and latency requirements add additional boundary conditions.
arXiv Detail & Related papers (2022-06-28T16:08:12Z) - Entanglement Rate Optimization in Heterogeneous Quantum Communication
Networks [79.8886946157912]
Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond.
Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware.
In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
arXiv Detail & Related papers (2021-05-30T11:34:23Z) - Optimizing the deployment of quantum key distribution switch-based
networks [0.4643589635376553]
We present a QKD network architecture that provides a significant reduction in the cost of deploying QKD networks by using optical switches.
We demonstrate that the switch-based architecture allows achieving significant resource savings of up to 28%, while the throughput is reduced by 8% only.
arXiv Detail & Related papers (2021-04-09T04:13:04Z) - Dynamic Slimmable Network [105.74546828182834]
We develop a dynamic network slimming regime named Dynamic Slimmable Network (DS-Net)
Our DS-Net is empowered with the ability of dynamic inference by the proposed double-headed dynamic gate.
It consistently outperforms its static counterparts as well as state-of-the-art static and dynamic model compression methods.
arXiv Detail & Related papers (2021-03-24T15:25:20Z) - Wireless Power Control via Counterfactual Optimization of Graph Neural
Networks [124.89036526192268]
We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium.
To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture.
We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
arXiv Detail & Related papers (2020-02-17T07:54:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.