Deep Reinforcement Learning-Based Deferred Entanglement Path Selection in Quantum Networks
- 13 April 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4668-4683
Abstract
Conventional entanglement routing approaches decide the Entanglement Paths (EPs) to establish Entanglement Connections (ECs) before trying to create Entanglement Links (ELs). By doing so, very few EL failures will result in a low network throughput. In this paper, we study how to choose the EPs to establish ECs after knowing which ELs are successfully created. This is called the Deferred EP Selection (DEPS) problem. DEPS is a generalized integer multi-commodity flow problem and we cannot solve it quickly with conventional optimization methods. To address this issue, we propose a Deep Reinforcement Learning based EP Selection (DRLEPS) approach. The salient features of DRLEPS include (i) by controlling the number of candidate EPs, DRLEPS can achieve a trade-off between time complexity and the EC establishment rate; and (ii) using candidate EPs as input, DRLEPS is robust to request variation; and (iii) by training neural networks with different topologies, a model derived by DRLEPS can be applied to various networks (even with a different number of nodes) without fine-tune. Through extensive simulations, we show that even in a network with 200 nodes, DRLEPS can solve the DEPS problem in 0.39 seconds with a Nvidia GeForce 3090 GPU. It outperforms the approach always establishing ECs through the EP with the largest success probability by up to 23.4% in EC establishment rate. It also outperforms the Integer Linear Programming (ILP) based scheme, which can achieve the maximum EC establishment rate, by up to 184.2x in network throughput.Keywords
Funding Information
- National Natural Science Foundation of China (62572233)
- National Natural Science Foundation of China (62272428)
- Quantum Science and Technology–National Science and Technology Major Project (2021ZD0300705)
- National Natural Science Foundation of China (JYB2025XDXM118)
This publication has 32 references indexed in Scilit:
- Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use caseComputer Communications, 2022
- Quantum pixel representations and compression for N-dimensional imagesScientific Reports, 2022
- xNet: Improving Expressiveness and Granularity for Network Modeling with Graph Neural Networks2022
- Redundant Entanglement Provisioning and Selection for Throughput Maximization in Quantum Networks2021
- End-to-end capacities of a quantum communication networkCommunications Physics, 2019
- Routing entanglement in the quantum internetnpj Quantum Information, 2019
- Optimal Routing for Quantum NetworksIEEE Access, 2017
- Path selection for quantum repeater networksNetworking Science, 2013
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988