IEEE Transactions on Quantum Engineering

DQRA: Deep Quantum Routing Agent for Entanglement Routing in Quantum Networks

Linh Le, Tu N. Nguyen

Published Jan 1, 2022• 63 citations

Abstract

Quantum routing plays a key role in the development of the next-generation network system. In particular, an entangled routing path can be constructed with the help of quantum entanglement and swapping among particles (e.g., photons) associated with nodes in the network. From another side of computing, machine learning has achieved numerous breakthrough successes in various application domains, including networking. Despite its advantages and capabilities, machine learning is not as much utilized in quantum networking as in other areas. To bridge this gap, in this article, we proposea novel quantum routing modelfor quantum networks that employs machine learning architectures to construct the routing path for the maximum number of demands (source–destination pairs) within a time window. 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 accommodate the network’s demands, which are then connected by a qubit-preserved shortest path algorithm. The training process of DQRA is guided by a reward function that aims toward maximizing the number of accommodated requests in each routing window. Our experiment study shows that, on average, DQRA is able to maintain a rate of successfully routed requests at above 80% in a qubit-limited grid network and approximately 60% in extreme conditions, i.e., each node can be repeater exactly once in a window. Furthermore, we show that the model complexity and the computational time of DQRA are polynomial in terms of the sizes of the quantum networks.

DOI: 10.1109/tqe.2022.3148667

Related papers

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 CommunicationsMay 16, 202211 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 TechnologyJun 18, 20250 citations

QuRA: Reinforcement Learning Based Routing for Quantum Networks

Tasdiqul Islam, Engin Arslan, Md Arifuzzaman

Quantum routing deals with identifying a set of quantum repeaters to use to create entanglement between distant endpoints. Previous approaches proposed shortest-path and linear programming methods to find a solution to this problem. While the shortest path approach results in suboptimal performance, linear programming takes too long to find a solution as the network size and constraints increase. In this paper, we apply Deep Q-Reinforcement Learning (DQRL) to optimize routing in quantum networks both in terms of execution time and performance. The proposed Quantum Routing Algorithm (QuRA) first chooses which request to schedule among all requests. It then determines which route to take for the selected request. Since the number of all possible routes can be very high, we developed a hop-by-hop decision making model to lower the complexity while still attaining high performance. Experiments show that the proposed QuRA outperforms existing solutions by up to 90% in success rate and up to 79% in execution time. These results highlight QuRA as a scalable and effective solution for intelligent routing in quantum networks.

IEEE Consumer Communications and Networking ConferenceJan 9, 20260 citations

Two-Stage Deep Q Learning Routing in Entanglement Networks

Diego Medeiros De Abreu, Arthur Pimentel, Christian Esteve Rothenberg +1 more

Efficient routing in entanglement distribution networks is a challenging task that requires the coordinated allocation of quantum memories, repeaters, and quantum operations such as entanglement swapping and distillation across dynamic network conditions. In this paper, we present a Deep Q-Learning (DQN) Two-Stage Routing strategy designed to improve both path and quantum operations selection. Our approach enables the agent to make decisions over a diverse action space, including request scheduling, multipath routing, and the strategic application of quantum operations to maximize entanglement success and resource efficiency. We further extend DQN to integrate Double DQN, Dueling DQN, and Prioritized Experience Replay (PER) architectures. Simulation results indicate that our approach significantly outperforms baseline methods regarding request success rate, especially in large-scale networks under strict fidelity requirements.

IEEE Symposium on Computers and Communications (ISCC)Jul 2, 20250 citations

QoS-Aware Reinforcement Learning Routing for Entanglement Networks

Diego Medeiros De Abreu, Antônio Abelém

Abstract Entanglement-based quantum networks require intelligent routing mechanisms that not only maximize fidelity and connectivity but also ensure service differentiation under varying traffic conditions. In this work, we propose a novel QoS-aware traffic modeling and scheduling framework integrated into a reinforcement learning-based quantum routing agent. Unlike prior approaches that assume deterministic or uniform request arrival patterns, our model introduces stochastic and bursty traffic scenarios using Erlang and ON/OFF distributions to emulate realistic quantum workloads. Each entanglement request is assigned a set of QoS attributes, including fidelity requirements, time-to-live constraints, and priority levels. We then extend the reward function of the agent to consider deadline compliance and resource efficiency in addition to fidelity. Through simulation, we compare the proposed method against state-of-the-art baselines, including DQRA and Proactive RL, under both best-effort and QoS-prioritized scheduling modes. Results demonstrate that our approach maintains higher success rates and lower latency for high-priority requests, while preserving entanglement fidelity and efficient resource allocation across varying network loads. This study highlights the importance of integrating QoS mechanisms into quantum routing to support scalable and differentiated quantum services

Jan 22, 20260 citations

Learning-Based Entanglement Generation for Quantum Routing

Tasdiqul Islam, Rasman Mubtasim Swargo, Md Arifuzzaman

Entanglement generation in long-distance quantum networks is challenging because resources are limited and entanglement swapping is probabilistic. To maximize the rate of successful requests, existing quantum routing algorithms often rely on computationally expensive methods such as Integer Linear Programming (ILP) to determine which links to entangle and use for end-to-end entanglement generation. However, these approaches fail to meet the latency requirements of real-world quantum networks. In this study, we propose a Reinforcement Learning (RL)-based model that determines which links to entangle in each time slot, replacing the slow ILP-based link-selection phase used in prior algorithms. The proposed Deep Q-learning model is up to 19.2× faster than linear programming in link-selection while maintaining comparable routing performance. The RL link-selection model alone matches ILP in request success rate; combining RL link selection with entanglement caching and proactive swapping raises throughput by up to 52.55% over ILP. Overall, our approach achieves success rates exceeding state-of-the-art solutions while reducing execution time by more than an order of magnitude. Experiments on a synthetic 50-node Waxman topology and the real-world 54-node SURFnet core topology confirm that these gains generalize across network structures, providing a practical path toward scalable quantum routing.

Aug 17, 20260 citations