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

International Conference on Transparent Optical Networks

Deep Reinforcement Learning Based Topology Independent Routing and Load-Balancing in QKD Networks using Graph Neural Networks

Tim Johann, Sebastian Kühl, Stephan M. Pachnicke

Published Jul 6, 2025• 1 citation
Publisher

Abstract

Due to the unavailability of quantum repeaters, end-to-end secret keys need to be relayed in a hop-by-hop manner using so called trusted nodes in long-distance QKD networks. Therefore, a sufficient number of secret keys is required between all QKD devices along the path until the destination node is reached. As key generation rates are typically limited to a few kbps depending on link lengths, constraint-based routing algorithms considering key availability levels are desirable. We show that centralized routing based on Deep Reinforcement Learning (DRL) combined with Graph Neural Networks (GNNs) is able to reduce blockings and enhance load-balancing compared to conventional shortest path algorithms. Additionally, because of the training on random topologies, the agent is able to act in topologies unseen during training.

DOI
10.1109/icton67126.2025.11125037

Related papers

Adaptive Routing for Meshed QKD Networks of Flexible Size Using Deep Reinforcement Learning

Tim Johann, Sebastian Kühl, Stephan M. Pachnicke

Quantum Key Distribution (QKD) networks guarantee information-theoretical security of exchanged keys, but key rates are still limited. This makes efficient and adaptive routing a critical challenge, especially in meshed topologies without quantum repeaters. Conventional shortest path routing approaches struggle to cope with dynamic key store filling levels and changes in network topologies, which leads to load imbalance and blocked connections. In this work, we propose an adaptive routing framework based on Deep Reinforcement Learning (DRL) for hop-wise end-to-end routing in unknown meshed QKD networks. The agent leverages Graph Attention Networks (GATs) to process the network states of varying topologies, enabling generalization across previously unseen meshed networks without topology-specific retraining. The agent is trained on random graphs with 10 to 20 nodes and learns a routing policy that explicitly balances key consumption across the network by utilizing a reward function that is based on the entropy of key store filling levels. We evaluate the proposed approach on the 14-node NSFNET topology under time-varying traffic demands. Simulation results demonstrate that the DRL-based routing significantly outperforms hop-based and weighted shortest path benchmarks, achieving up to a 18.7% increase in mean key store filling levels while completely avoiding key store depletion. These results highlight the potential of graph-based DRL methods for scalable, adaptive, and resource-efficient routing in future QKD networks.

Photonics•Feb 16, 2026•0 citations

Routing Based on Deep Reinforcement Learning in Quantum Key Distribution-secured Optical Networks

Purva Sharma, Vimal Bhatia, Shashi Prakash

Routing is a challenging problem in quantum key distribution (QKD)-secured optical networks (QKD-ONs) and involves the selection of an appropriate route that establishes a secure path between the QKD nodes for secret key distribution. Deep reinforcement learning (DRL) is a promising approach for solving decision-making problems in complex networking environments such as QKD-ONs. By leveraging the capabilities of DRL algorithms, the routing decisions can be optimized to enhance network performance. This paper proposes a DRL-based solution for routing in QKD-ONs that enables the routing agent to learn and adapt to changing network conditions by understanding the networking environment. The performance of the proposed scheme is compared with the baseline schemes on NSFNET in terms of blocking probability. Simulation results indicate that compared to the baseline schemes (shortest path (SP) and hop count (HC)), the proposed DRL-based routing scheme reduces the blocking by 14.31% and 8%, respectively.

IEEE International Conference on Advanced Networks and Telecommunications Systems•Dec 17, 2023•6 citations

Efficient routing algorithm for trusted relay quantum key distribution networks via quantum reinforcement learning

Yuheng Xie, Yuanchen Hao, Yuefeng Lin +6 more

Trusted relay quantum key distribution networks (TR-QKDNs) have emerged as one of the most practical solutions for implementing large-scale QKDNs. The development of efficient routing algorithms is crucial to ensure adaptability to diverse network parameters and topologies. However, current approaches suffer from multiple limitations, including insufficient consideration of key influencing factors, excessive reliance on manually configured parameters, and scalability bottlenecks caused by the exponential complexity of classical algorithms. In this paper, we propose a quantum reinforcement learning-based routing algorithm, named hybrid quantum deep deterministic policy gradient (HQ-DDPG) that integrates a custom-designed quantum neural network (QNN) with the deep deterministic policy gradient (DDPG), to intelligently balance multiple influencing factors and dynamically optimize routing decisions in TR-QKDNs. To reduce computational complexity, we further utilize a quantum single-source shortest path (QSSP) algorithm to compute the optimal routing path. Training results demonstrate that the proposed HQ-DDPG outperforms DDPG in terms of performance metrics, achieving nearly double the training convergence speed while reducing resource requirements by approximately 45 times and exhibiting superior network expressiveness. In typical network topology tests, the proposed algorithm consistently maintains a quantum key delivery ratio above 91.35% under high-load demand, significantly surpassing both DDPG and optimized link state routing (OLSR). Finally, leveraging distributed quantum computing, the proposed QNN enables efficient solutions for large-scale TR-QKDN problems with fewer quantum resources.

Optics Express•Oct 20, 2025•2 citations

Entanglement Routing For Quantum Networks: A Deep Reinforcement Learning Approach

Linh Le, Tu N. Nguyen, Ahyoung Lee +1 more

Quantum communications are gaining momentum in finding applications in a wide range of domains, especially those require high-security data transmissions. On the other hand, machine learning has achieved numerous breakthrough successes in various application domains including networking. However, currently, machine learning is not as much utilized in quantum networking as in other areas. With such motivation, we propose a machine-learning-powered entanglement routing scheme for quantum networks that aims to accommodate maximum numbers of demands (source-destination pairs) within a time window. More specifically, we present a deep reinforcement routing scheme that is called Deep Quantum Routing Agent (DQRA). In short, DQRA utilizes an empirically designed deep neural network that observes the current network states to schedule the network’s demands which are then routed by a qubit-preserved shortest path algorithm. DQRA is trained towards the goal of maximizing the number of resolved requests in each routing window by using an explicitly designed reward function. Our experiment study shows that, on averse, DQRA is able to maintain a rate of successfully routed requests above 80% in a qubit-limited grid network, and about 60% in extreme conditions i.e. each node can act as a repeater exactly once within a window. Furthermore, we show that the complexity and the computational time of DQRA are polynomial in terms of the sizes of the quantum networks.

International Conference on Communications•May 16, 2022•13 citations

Intelligent Deep Routing Agent for Optimized Entanglement Distribution in Quantum Communication Networks

V Nishanth

Quantum routing is crucial for future networks as it utilizes entanglement and swapping to establish efficient communication paths between nodes. Although machine learning has transformed various industries, its integration with quantum networking remains relatively underexplored. To address this gap, we present the Deep Quantum Routing Agent (DQRA), an innovative deep reinforcement learning framework that optimizes routing paths to maximize request fulfillment within constrained time windows. Our approach integrates a neural network with a qubit-preserving shortest-path algorithm, employing a reward-based training system to enhance connection success rates. Extensive experiments show DQRA achieves over 80% routing success in resource-limited networks and maintains approximately 60% effectiveness under challenging single-repeater conditions. Importantly, the model demonstrates polynomial-time complexity, ensuring scalable deployment and effectively merging machine learning with quantum network optimization

International Journal for Research in Applied Science and Engineering Technology•Jun 18, 2025•0 citations

Optimizing Quantum Key Distribution Network Performance using Graph Neural Networks

Akshit Pramod Anchan, Ameiy Acharya, Leki Chom Thungon

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.

quant-pharXiv:2511.16468•Nov 21, 2025•0 citations
Due to the unavailability of quantum repeaters, end-to-end secret keys need to be relayed in a hop-by-hop manner using so called trusted nodes in long-distance QKD networks. Therefore, a sufficient number of secret keys is required between all QKD devices along the path until the destination node is reached. As key generation rates are typically limited to a few kbps depending on link lengths, constraint-based routing algorithms considering key availability levels are desirable. We show that centralized routing based on Deep Reinforcement Learning (DRL) combined with Graph Neural Networks (GNNs) is able to reduce blockings and enhance load-balancing compared to conventional shortest path algorithms. Additionally, because of the training on random topologies, the agent is able to act in topologies unseen during training.
Quantum Key Distribution (QKD) networks guarantee information-theoretical security of exchanged keys, but key rates are still limited. This makes efficient and adaptive routing a critical challenge, especially in meshed topologies without quantum repeaters. Conventional shortest path routing approaches struggle to cope with dynamic key store filling levels and changes in network topologies, which leads to load imbalance and blocked connections. In this work, we propose an adaptive routing framework based on Deep Reinforcement Learning (DRL) for hop-wise end-to-end routing in unknown meshed QKD networks. The agent leverages Graph Attention Networks (GATs) to process the network states of varying topologies, enabling generalization across previously unseen meshed networks without topology-specific retraining. The agent is trained on random graphs with 10 to 20 nodes and learns a routing policy that explicitly balances key consumption across the network by utilizing a reward function that is based on the entropy of key store filling levels. We evaluate the proposed approach on the 14-node NSFNET topology under time-varying traffic demands. Simulation results demonstrate that the DRL-based routing significantly outperforms hop-based and weighted shortest path benchmarks, achieving up to a 18.7% increase in mean key store filling levels while completely avoiding key store depletion. These results highlight the potential of graph-based DRL methods for scalable, adaptive, and resource-efficient routing in future QKD networks.
Routing is a challenging problem in quantum key distribution (QKD)-secured optical networks (QKD-ONs) and involves the selection of an appropriate route that establishes a secure path between the QKD nodes for secret key distribution. Deep reinforcement learning (DRL) is a promising approach for solving decision-making problems in complex networking environments such as QKD-ONs. By leveraging the capabilities of DRL algorithms, the routing decisions can be optimized to enhance network performance. This paper proposes a DRL-based solution for routing in QKD-ONs that enables the routing agent to learn and adapt to changing network conditions by understanding the networking environment. The performance of the proposed scheme is compared with the baseline schemes on NSFNET in terms of blocking probability. Simulation results indicate that compared to the baseline schemes (shortest path (SP) and hop count (HC)), the proposed DRL-based routing scheme reduces the blocking by 14.31% and 8%, respectively.
Trusted relay quantum key distribution networks (TR-QKDNs) have emerged as one of the most practical solutions for implementing large-scale QKDNs. The development of efficient routing algorithms is crucial to ensure adaptability to diverse network parameters and topologies. However, current approaches suffer from multiple limitations, including insufficient consideration of key influencing factors, excessive reliance on manually configured parameters, and scalability bottlenecks caused by the exponential complexity of classical algorithms. In this paper, we propose a quantum reinforcement learning-based routing algorithm, named hybrid quantum deep deterministic policy gradient (HQ-DDPG) that integrates a custom-designed quantum neural network (QNN) with the deep deterministic policy gradient (DDPG), to intelligently balance multiple influencing factors and dynamically optimize routing decisions in TR-QKDNs. To reduce computational complexity, we further utilize a quantum single-source shortest path (QSSP) algorithm to compute the optimal routing path. Training results demonstrate that the proposed HQ-DDPG outperforms DDPG in terms of performance metrics, achieving nearly double the training convergence speed while reducing resource requirements by approximately 45 times and exhibiting superior network expressiveness. In typical network topology tests, the proposed algorithm consistently maintains a quantum key delivery ratio above 91.35% under high-load demand, significantly surpassing both DDPG and optimized link state routing (OLSR). Finally, leveraging distributed quantum computing, the proposed QNN enables efficient solutions for large-scale TR-QKDN problems with fewer quantum resources.
Quantum communications are gaining momentum in finding applications in a wide range of domains, especially those require high-security data transmissions. On the other hand, machine learning has achieved numerous breakthrough successes in various application domains including networking. However, currently, machine learning is not as much utilized in quantum networking as in other areas. With such motivation, we propose a machine-learning-powered entanglement routing scheme for quantum networks that aims to accommodate maximum numbers of demands (source-destination pairs) within a time window. More specifically, we present a deep reinforcement routing scheme that is called Deep Quantum Routing Agent (DQRA). In short, DQRA utilizes an empirically designed deep neural network that observes the current network states to schedule the network’s demands which are then routed by a qubit-preserved shortest path algorithm. DQRA is trained towards the goal of maximizing the number of resolved requests in each routing window by using an explicitly designed reward function. Our experiment study shows that, on averse, DQRA is able to maintain a rate of successfully routed requests above 80% in a qubit-limited grid network, and about 60% in extreme conditions i.e. each node can act as a repeater exactly once within a window. Furthermore, we show that the complexity and the computational time of DQRA are polynomial in terms of the sizes of the quantum networks.
Quantum routing is crucial for future networks as it utilizes entanglement and swapping to establish efficient communication paths between nodes. Although machine learning has transformed various industries, its integration with quantum networking remains relatively underexplored. To address this gap, we present the Deep Quantum Routing Agent (DQRA), an innovative deep reinforcement learning framework that optimizes routing paths to maximize request fulfillment within constrained time windows. Our approach integrates a neural network with a qubit-preserving shortest-path algorithm, employing a reward-based training system to enhance connection success rates. Extensive experiments show DQRA achieves over 80% routing success in resource-limited networks and maintains approximately 60% effectiveness under challenging single-repeater conditions. Importantly, the model demonstrates polynomial-time complexity, ensuring scalable deployment and effectively merging machine learning with quantum network optimization
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.