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

IEEE Transactions on Networking

AI-Powered Persistent Entanglement Distribution in Quantum Networks

Xiaoyu Wang, Yangming Zhao, Hongli Xu, Chen Tian, Kun Yang, Chunming Qiao

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Entanglement distribution is a fundamental problem in quantum networks. Most existing entanglement distribution works only focused on provisioning quantum memory and quantum channels, but ignored Entangled Photon Sources (EPSes) which are also precious resources. In addition, motivated by the presumed fast entanglement decoherence (in the order of seconds), they destroy all created Entanglement Links (ELs) at the end of each time slot, which could result in serious quantum resource waste and low network throughput. In this paper, we propose PED to solve the Persistent Entanglement Distribution problem. Given the network topology and a set of demands, PED first selects an Entanglement Path (EP) for each demand and then leverages neural networks to online determine EPS provisioning. The salient features of PED include (i) a created EL can be maintained for multiple time slots before it has to be eventually destroyed due to decoherence, and (ii) every EPS agent hosts a specific neural network to calculate its EPS provisioning scheme based on its local information. Extensive simulations show that the EP selection and EPS provisioning approaches in PED can help improve the network throughput by up to 10.25% and 611.14%, respectively.

DOI
10.1109/ton.2026.3706424

Related papers

Entangled Photon Source Pooling and Entanglement Distribution for Quantum Networks

Junyuan Shi, Yangming Zhao, Dong Zhang +3 more

Entanglement distribution is a key problem in quantum networks. Conventional works on entanglement distribution either ignored that Entangled Photon Sources (EPSes) are precious resources or organized EPSes in an unscalable way. In this work, we propose an EPS Pooling and Entanglement Distribution (EPED) approach to efficiently utilize EPSes. The salient features of EPED include (i) EPSes are organized as several EPS pools; (ii) each EPS pool distributes entanglements only in its coverage area; and (iii) EPSes are dynamically assigned to create different entanglement links. There are two challenges in EPED: (i) when deploying EPS pools, we do not have any demand information; and (ii) we have to calculate the Entanglement Path (EP) for each demand as quickly as possible. To tackle these challenges, we design an algorithm with a constant approximation ratio to minimize the number of EPS pools required, and determine the number of EPSes provisioned to each pool using a primal-dual technique. By preparing candidate EPs for each demand, we solve the online EP selection problem for tens of demands in a network with hundreds of nodes in 6.5 ms. Extensive simulations show that EPED can save up to 8% EPS pools and enhance network throughput by up to 48%.

International Workshop on Quality of Service•Jun 1, 2026•0 citations

EPS Placement and Lightweight Entanglement Routing for Quantum Data Networks

Qiucheng Zhu, Yangming Zhao, Hongli Xu +2 more

Entanglement routing in quantum data networks plays a vital role to support various quantum applications. Existing works on entanglement routing either ignored the Entangled Photon Source (EPS) placement issue or simply assumed a pool of EPSes at a centralized location that can provision entanglement over arbitrary quantum links. In this paper, we propose LightER to solve the joint EPS placement and entanglement routing problem based on the assumption that EPSes are distributed over a quantum network, where an EPS, which is co-located with a quantum node, can send one entangled photon at a time to one of the adjacent nodes only. The salient features of LightER include (i) LightER uses a demand-agnostic EPS placement scheme to maximize network throughput and fairness for all feasible entanglement connection (EC) establishment demands, and (ii) most of the requested ECs can be established over their corresponding Entanglement Paths (EPs) determined offline, and only a small percentage of the ECs will be established over EPs that need to be calculated online, resulting in fast and efficient entanglement routing. Extensive simulations show that compared with schemes without proper EPS placement or entanglement routing, LightER can improve the network throughput by up to 215% and 56.2%, respectively.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jul 23, 2024•6 citations

Maximize Quantum Network Throughput via EPS Placement and Lightweight Entanglement Routing

Yangming Zhao, Qiucheng Zhu, B Y Liu +6 more

Entanglement routing plays a vital role in supporting various applications in quantum networks. Existing works on entanglement routing either ignored the Entangled Photon Source (EPS) placement issue or simply assumed a pool of EPSes at a centralized location that can provision entanglement over arbitrary quantum links. In this paper, we propose LIGHTER and fidelity-aware LIGHTER (named F-LIGHTER) to solve the joint EPS placement and entanglement routing problem based on the assumption that EPSes are co-located with quantum nodes and each EPS can send one entangled photon at a time to one of its adjacent nodes only. The salient features of LIGHTER and F-LIGHTER include (i) LIGHTER and F-LIGHTER use a demand-agnostic EPS placement scheme to maximize network throughput and fairness for all feasible Entanglement Connection EC) establishment demands, and (ii) most requested ECs can be established over Entanglement Paths (EPs) determined offline, and only a small percentage of them will be established over online calculated EPs, resulting in fast and efficient entanglement routing. Extensive simulations show that compared with schemes without proper EPS placement or entanglement routing, LIGHTER can improve the network throughput by up to 175.6% and 37.0%, respectively. When the fidelity is considered, the network throughput improvement achieved by F-LIGHTER will be up to 135.0% and 21.5%, respectively.

IEEE Transactions on Networking•Jan 1, 2026•0 citations

Pre-Distribution of Entanglements in Quantum Networks

Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan +1 more

Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. Establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. To reduce EP generation latency, prior works have looked at selection of efficient entanglement-routing paths and simultaneous use of multiple such paths for EP generation.In this paper, we propose and investigate a complementary technique to reduce EP generation latency—to pre-distribute EPs over certain (pre-determined) pairs of network nodes; these pre-distributed EPs can then be used to generate EPs for the requested pairs, when needed, with lower generation latency. For such a pre-distribution approach to be most effective, we need to address an optimization problem of selection of node-pairs where the EPs should be pre-distributed to minimize the generation latency of expected EP requests, under a given cost constraint. In this paper, we appropriately formulate the above optimization problem and design two efficient algorithms, one of which is a greedy approach based on an approximation algorithm for a special case. Via extensive evaluations over the NetSquid simulator [1], we demonstrate the effectiveness of our approach and developed techniques; we show that our developed algorithms outperform a naive approach by up to an order of magnitude.

arXiv:2205.04036•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•23 citations

A Quantum Overlay Network for Efficient Entanglement Distribution

Shahrooz Pouryousef, Nitish K. Panigrahy, Don Towsley

Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.

arXiv:2212.01694•IEEE Conference on Computer Communications (INFOCOM)•May 17, 2023•40 citations

Integrating All-optical Switching and Entangled Photon Source Placement for Entanglement Routing

Qiucheng Zhu, Yangming Zhao, Hongli Xu +2 more

Entanglement routing plays a vital role in quantum networks. Previous works on entanglement routing did not note that all-optical switching capacity can be used to improve the network throughput or ignored that the placement of Entangled Photon Sources (EPS), another type of precious (and costly) quantum source, which also limits the network throughput. In this paper, we propose OptEPS to jointly optimize all-optical switching and EPS placement in entanglement routing to maximize the quantum network throughput. The main challenge of OptEPS lies in two folds: i). an entanglement may fail to be created; ii). the joint optimization problem suffers from a large time complexity. To overcome these challenges, we first formulate the joint optimization problem as a link-path based model and prune out some candidate paths in order to reduce the time complexity. Then, efficient algorithms are proposed to derive a near-optimal solution in a timely manner. Extensive simulations show that compared with the solutions ignoring EPS placement or without introducing all-optical switching, OptEPS will increase the network throughput by 1557% and 109%, respectively.

International Workshop on Quality of Service•Jun 19, 2023•7 citations
Entanglement distribution is a fundamental problem in quantum networks. Most existing entanglement distribution works only focused on provisioning quantum memory and quantum channels, but ignored Entangled Photon Sources (EPSes) which are also precious resources. In addition, motivated by the presumed fast entanglement decoherence (in the order of seconds), they destroy all created Entanglement Links (ELs) at the end of each time slot, which could result in serious quantum resource waste and low network throughput. In this paper, we propose PED to solve the Persistent Entanglement Distribution problem. Given the network topology and a set of demands, PED first selects an Entanglement Path (EP) for each demand and then leverages neural networks to online determine EPS provisioning. The salient features of PED include (i) a created EL can be maintained for multiple time slots before it has to be eventually destroyed due to decoherence, and (ii) every EPS agent hosts a specific neural network to calculate its EPS provisioning scheme based on its local information. Extensive simulations show that the EP selection and EPS provisioning approaches in PED can help improve the network throughput by up to 10.25% and 611.14%, respectively.
Entanglement distribution is a key problem in quantum networks. Conventional works on entanglement distribution either ignored that Entangled Photon Sources (EPSes) are precious resources or organized EPSes in an unscalable way. In this work, we propose an EPS Pooling and Entanglement Distribution (EPED) approach to efficiently utilize EPSes. The salient features of EPED include (i) EPSes are organized as several EPS pools; (ii) each EPS pool distributes entanglements only in its coverage area; and (iii) EPSes are dynamically assigned to create different entanglement links. There are two challenges in EPED: (i) when deploying EPS pools, we do not have any demand information; and (ii) we have to calculate the Entanglement Path (EP) for each demand as quickly as possible. To tackle these challenges, we design an algorithm with a constant approximation ratio to minimize the number of EPS pools required, and determine the number of EPSes provisioned to each pool using a primal-dual technique. By preparing candidate EPs for each demand, we solve the online EP selection problem for tens of demands in a network with hundreds of nodes in 6.5 ms. Extensive simulations show that EPED can save up to 8% EPS pools and enhance network throughput by up to 48%.
Entanglement routing in quantum data networks plays a vital role to support various quantum applications. Existing works on entanglement routing either ignored the Entangled Photon Source (EPS) placement issue or simply assumed a pool of EPSes at a centralized location that can provision entanglement over arbitrary quantum links. In this paper, we propose LightER to solve the joint EPS placement and entanglement routing problem based on the assumption that EPSes are distributed over a quantum network, where an EPS, which is co-located with a quantum node, can send one entangled photon at a time to one of the adjacent nodes only. The salient features of LightER include (i) LightER uses a demand-agnostic EPS placement scheme to maximize network throughput and fairness for all feasible entanglement connection (EC) establishment demands, and (ii) most of the requested ECs can be established over their corresponding Entanglement Paths (EPs) determined offline, and only a small percentage of the ECs will be established over EPs that need to be calculated online, resulting in fast and efficient entanglement routing. Extensive simulations show that compared with schemes without proper EPS placement or entanglement routing, LightER can improve the network throughput by up to 215% and 56.2%, respectively.
Entanglement routing plays a vital role in supporting various applications in quantum networks. Existing works on entanglement routing either ignored the Entangled Photon Source (EPS) placement issue or simply assumed a pool of EPSes at a centralized location that can provision entanglement over arbitrary quantum links. In this paper, we propose LIGHTER and fidelity-aware LIGHTER (named F-LIGHTER) to solve the joint EPS placement and entanglement routing problem based on the assumption that EPSes are co-located with quantum nodes and each EPS can send one entangled photon at a time to one of its adjacent nodes only. The salient features of LIGHTER and F-LIGHTER include (i) LIGHTER and F-LIGHTER use a demand-agnostic EPS placement scheme to maximize network throughput and fairness for all feasible Entanglement Connection EC) establishment demands, and (ii) most requested ECs can be established over Entanglement Paths (EPs) determined offline, and only a small percentage of them will be established over online calculated EPs, resulting in fast and efficient entanglement routing. Extensive simulations show that compared with schemes without proper EPS placement or entanglement routing, LIGHTER can improve the network throughput by up to 175.6% and 37.0%, respectively. When the fidelity is considered, the network throughput improvement achieved by F-LIGHTER will be up to 135.0% and 21.5%, respectively.
Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. Establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. To reduce EP generation latency, prior works have looked at selection of efficient entanglement-routing paths and simultaneous use of multiple such paths for EP generation.In this paper, we propose and investigate a complementary technique to reduce EP generation latency—to pre-distribute EPs over certain (pre-determined) pairs of network nodes; these pre-distributed EPs can then be used to generate EPs for the requested pairs, when needed, with lower generation latency. For such a pre-distribution approach to be most effective, we need to address an optimization problem of selection of node-pairs where the EPs should be pre-distributed to minimize the generation latency of expected EP requests, under a given cost constraint. In this paper, we appropriately formulate the above optimization problem and design two efficient algorithms, one of which is a greedy approach based on an approximation algorithm for a special case. Via extensive evaluations over the NetSquid simulator [1], we demonstrate the effectiveness of our approach and developed techniques; we show that our developed algorithms outperform a naive approach by up to an order of magnitude.
Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.
Entanglement routing plays a vital role in quantum networks. Previous works on entanglement routing did not note that all-optical switching capacity can be used to improve the network throughput or ignored that the placement of Entangled Photon Sources (EPS), another type of precious (and costly) quantum source, which also limits the network throughput. In this paper, we propose OptEPS to jointly optimize all-optical switching and EPS placement in entanglement routing to maximize the quantum network throughput. The main challenge of OptEPS lies in two folds: i). an entanglement may fail to be created; ii). the joint optimization problem suffers from a large time complexity. To overcome these challenges, we first formulate the joint optimization problem as a link-path based model and prune out some candidate paths in order to reduce the time complexity. Then, efficient algorithms are proposed to derive a near-optimal solution in a timely manner. Extensive simulations show that compared with the solutions ignoring EPS placement or without introducing all-optical switching, OptEPS will increase the network throughput by 1557% and 109%, respectively.