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 Quantum Communications, Networking, and Computing (QCNC)

Efficient Routing Design Based on Entanglement Flow Loss Effect in Quantum Networks

Zhaoying Wang, Jian Li, Zhonghui Li, Lutong Chen, Nenghai Yu, Qibin Sun, Jun Lu

Published Jul 1, 2024• 5 citations
Publisher

Abstract

The fundamental technology for the construction of large-scale quantum networks lies in the efficient distribution of remote entanglement among quantum nodes. Entanglement routing tackles the challenge of path selection between two distant end nodes and realizes entanglement distribution through multi-hop entanglement swapping. Given the inherent probability of swapping, entanglement distribution flow always presents inevitable losses. The existing routing works adopt a parallel swapping mode, which only considers the final end-to-end distribution loss effect. This lag of failure detection and complete independence between swapping reduce distribution efficiency. We observe that the sequential swapping mode can improve this defect, but it is not thorough. Thus, in this paper, we explore the entanglement flow loss effect in the sequential entanglement swapping (Loss-SES) process in order to perceive failures earlier and save network resources. Subsequently, we introduce a novel metric to quantify path performance, namely the expected entanglement throughput (EET). Building upon EET, we propose the entanglement routing algorithm MaxEET adapted to the Loss-SES process to maximize EET. For efficient deployment, in the single-request scenario, we determine the optimal routing initiation direction by introducing a bidirectional routing mechanism. In the multi-request scenario, we design a greedy and contention-free iterative routing algorithm to exhaust resources. Based on extensive simulations, the results show the superiority of our proposed Loss-SES mode compared to other modes in terms of throughput, fairness, and utilization.

DOI
10.1109/qcnc62729.2024.00032

Related papers

SwappingBoost: Optimizing Entanglement Routing by Mitigating Bottlenecks in Quantum Networks

Bing Yang, Zhonghui Li, Kaiping Xue +3 more

Entanglement distribution between distant quantum nodes plays an important role in quantum networks. However, due to the unique properties of quantum mechanics and hardware limitations, entanglement resources in quantum networks are scarce. Quantum links that fail to meet request demands become bottleneck links, significantly hindering remote entanglement distribution in multi-request scenarios. In this paper, we propose an entanglement routing scheme called SwappingBoost that can effectively reduce resource consumption along entanglement distribution paths, alleviating the negative impact of bottleneck links. SwappingBoost first employs a decreasing resource reservation method to compensate for resource losses caused by failed entanglement swapping, freeing up pre-reserved resources on downstream links to accommodate other paths and requests. Besides, SwappingBoost introduces a path-priority-based rounding algorithm that achieves integer-level resource allocation while ensuring balanced resource allocation. Extensive simulation results demonstrate that SwappingBoost can effectively reduce the load of bottleneck links, enhancing network throughput while maintaining fairness among multiple requests.

International Wireless Communications and Mobile Computing Conference (IWCMC)•May 12, 2025•4 citations

Swapping-Based Entanglement Routing Design for Congestion Mitigation in Quantum Networks

Zhonghui Li, Jian Li, Kaiping Xue +5 more

The quantum network is designed to connect numerous quantum nodes and support various ground-breaking quantum applications. Most of these applications require communicating parties to share entangled pairs. Therefore, entanglement routing, a technology distributing entangled pairs between distant quantum nodes, plays a vital role in realizing quantum networks’ capability. However, due to the limitation of quantum memory size and quantum decoherence, the entangled pairs shared by adjacent quantum nodes can hardly satisfy concurrent entanglement routing requests, thus leading to severe network congestion. In this paper, we propose a novel congestion mitigation (CM) scheme to tackle such bottleneck problems. The basic idea of CM is to “recycle” idle link-level entanglement resources from well-resourced links to bottleneck links utilizing a unique enabling technology of quantum networks, called entanglement swapping. CM can increase the capacity of each bottleneck link, thus overcoming resource limitations to improve resource utilization and network throughput. To complete our work, we also propose a swapping-based entanglement routing design, including path selection and resource allocation algorithms. Extensive simulations show that our design can significantly alleviate network congestion and improve the request service rate of quantum networks compared to the traditional entanglement routing designs.

IEEE Transactions on Network and Service Management•May 12, 2023•32 citations

Fidelity-Guaranteed Entanglement Routing in Quantum Networks

Jian Li, Mingjun Wang, Kaiping Xue +4 more

Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (S-D) pairs in quantum networks. In our proposal, we first consider the single S-D pair scenario and design an iterative routing algorithm, Q-PATH, to find the optimal purification decisions along the routing path with minimum entangled pair cost. Further, a low-complexity routing algorithm using an extended Dijkstra algorithm, Q-LEAP, is designed to reduce the computational complexity by using a simple but effective purification decision method. Finally, we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and re-routing process for multiple routing requests. Simulation results show that the proposed algorithms not only can provide fidelity-guaranteed routing solutions, but also has superior performance in terms of throughput, fidelity of end-to-end entanglement connection, and resource utilization ratio, compared with the existing routing scheme.

arXiv:2111.07764•IEEE Transactions on Communications•Aug 19, 2022•154 citations

Achieving Load-Balanced Entanglement Distribution in Quantum Networks

Zhuoyue Chen, Kechao Cai, Jinbei Zhang +1 more

Entanglement distribution, which relies on entanglement routing and swapping strategies, is a fundamental task in quantum networks. However, existing routing algorithms often overutilize the quantum memory of nodes along shortest paths and neglect imbalanced memory utilization across different nodes, thereby increasing the risk of end-to-end (E2E) entanglement failures for subsequent requests. Moreover, suboptimal swapping strategies can further exacerbate memory imbalance among nodes. In this paper, we study load-balanced entanglement distribution to improve the resilience of quantum networks. We first propose abottleneck node modelthat captures shared quantum memory constraints at each node. Based on this model, we formulate theload-balanced entanglement distributionproblem, which aims to optimize routing decisions and swapping strategies to balance memory utilization. We prove the problem to be NP-hard and develop a decomposition-based approach that separates path finding and quantum memory allocation for sequential request processing. Based on this decomposition, we propose LBER (Load-Balanced Entanglement Routing), a polynomial-time heuristic that distributes entanglement across multiple paths. We further design an adaptive swapping strategy, AdapSwap, to determine the optimal swapping order along each path. Extensive simulations show that our approach significantly improves load balance and increases the request satisfaction ratio by 7.69%∼32.14%.

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

Resource Efficient Link-Set Configuration (RELiC)-Based Entanglement Routing

Jayeong Kim, Ho-Jae Lee, Jonghyun Lee +1 more

The core technology to construct large-scale quantum networks is to efficiently distribute remote entanglement among quantum nodes. Entanglement routing deals with the problem of discovering and selecting paths to perform the multi-hop entanglement swapping between two distant nodes. In order to succeed in end-to-end entanglement creation for a given path, entanglement distribution of all direct quantum links and Bell state measurement of all intermediate nodes along the path should be successful. Existing studies have addressed the entanglement routing problem based on path discovery algorithms considering the above characteristics and selecting the optimal path from the individual performance perspective of each path. In this article, we newly define the entanglement routing problem considering the joint-utilization between multiple paths to maximize the network resource efficiency, and present an optimal link-set configuration algorithm, named RELiC, as a solution for this. The performance of the proposed entanglement routing protocol is evaluated in small- and large-scale quantum networks through mathematical analysis and simulation study.

IEEE Transactions on Communications•Sep 17, 2024•3 citations

Efficient Remote Entanglement Distribution in Quantum Networks: A Segment-Based Method

Zhonghui Li, Jian Li, Kaiping Xue +4 more

Entanglement distribution between distant quantum nodes plays an essential role in realizing quantum networks’ capabilities. In addition to path selection, remote entanglement distribution involves two pivotal quantum operations, i.e., entanglement generation and entanglement swapping. The existing studies mainly adopt two methods, i.e., Tell-and-Generation (TAG) and Tell-and-Swapping (TAS), to manage these two quantum operations on a selected path. However, both methods fatally introduce redundant stop-and-wait processes, which are detrimental to the performance of remote entanglement distribution in terms of latency and fidelity. To achieve low-latency and high-fidelity entanglement distribution between far-off quantum nodes, we propose a segment-based method consisting of an entanglement generation algorithm and a segment design to diminish the unnecessary stop-and-wait processes. The entanglement generation algorithm adopts a concurrent design to establish entanglement links using the one-demand generation model, thus effectively reducing waiting time compared to hop-by-hop and parallel designs. The segment design is proposed to split a long-distance path into multiple short-haul segments with the similar ability to swap entanglement, and these segments build multi-hop entanglement connections in parallel. Extensive simulations show that the segment-based method significantly outperforms the existing methods, including TAG and TAS, in entanglement distribution latency and effectively mitigates fidelity attenuation.

IEEE Transactions on Network and Service Management•Jul 18, 2023•12 citations
The fundamental technology for the construction of large-scale quantum networks lies in the efficient distribution of remote entanglement among quantum nodes. Entanglement routing tackles the challenge of path selection between two distant end nodes and realizes entanglement distribution through multi-hop entanglement swapping. Given the inherent probability of swapping, entanglement distribution flow always presents inevitable losses. The existing routing works adopt a parallel swapping mode, which only considers the final end-to-end distribution loss effect. This lag of failure detection and complete independence between swapping reduce distribution efficiency. We observe that the sequential swapping mode can improve this defect, but it is not thorough. Thus, in this paper, we explore the entanglement flow loss effect in the sequential entanglement swapping (Loss-SES) process in order to perceive failures earlier and save network resources. Subsequently, we introduce a novel metric to quantify path performance, namely the expected entanglement throughput (EET). Building upon EET, we propose the entanglement routing algorithm MaxEET adapted to the Loss-SES process to maximize EET. For efficient deployment, in the single-request scenario, we determine the optimal routing initiation direction by introducing a bidirectional routing mechanism. In the multi-request scenario, we design a greedy and contention-free iterative routing algorithm to exhaust resources. Based on extensive simulations, the results show the superiority of our proposed Loss-SES mode compared to other modes in terms of throughput, fairness, and utilization.
Entanglement distribution between distant quantum nodes plays an important role in quantum networks. However, due to the unique properties of quantum mechanics and hardware limitations, entanglement resources in quantum networks are scarce. Quantum links that fail to meet request demands become bottleneck links, significantly hindering remote entanglement distribution in multi-request scenarios. In this paper, we propose an entanglement routing scheme called SwappingBoost that can effectively reduce resource consumption along entanglement distribution paths, alleviating the negative impact of bottleneck links. SwappingBoost first employs a decreasing resource reservation method to compensate for resource losses caused by failed entanglement swapping, freeing up pre-reserved resources on downstream links to accommodate other paths and requests. Besides, SwappingBoost introduces a path-priority-based rounding algorithm that achieves integer-level resource allocation while ensuring balanced resource allocation. Extensive simulation results demonstrate that SwappingBoost can effectively reduce the load of bottleneck links, enhancing network throughput while maintaining fairness among multiple requests.
The quantum network is designed to connect numerous quantum nodes and support various ground-breaking quantum applications. Most of these applications require communicating parties to share entangled pairs. Therefore, entanglement routing, a technology distributing entangled pairs between distant quantum nodes, plays a vital role in realizing quantum networks’ capability. However, due to the limitation of quantum memory size and quantum decoherence, the entangled pairs shared by adjacent quantum nodes can hardly satisfy concurrent entanglement routing requests, thus leading to severe network congestion. In this paper, we propose a novel congestion mitigation (CM) scheme to tackle such bottleneck problems. The basic idea of CM is to “recycle” idle link-level entanglement resources from well-resourced links to bottleneck links utilizing a unique enabling technology of quantum networks, called entanglement swapping. CM can increase the capacity of each bottleneck link, thus overcoming resource limitations to improve resource utilization and network throughput. To complete our work, we also propose a swapping-based entanglement routing design, including path selection and resource allocation algorithms. Extensive simulations show that our design can significantly alleviate network congestion and improve the request service rate of quantum networks compared to the traditional entanglement routing designs.
Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput facing the failure of entanglement generations, which, however, rarely include the considerations on the most important metric to evaluate the quality of connection, entanglement fidelity. To solve this problem, we propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (S-D) pairs in quantum networks. In our proposal, we first consider the single S-D pair scenario and design an iterative routing algorithm, Q-PATH, to find the optimal purification decisions along the routing path with minimum entangled pair cost. Further, a low-complexity routing algorithm using an extended Dijkstra algorithm, Q-LEAP, is designed to reduce the computational complexity by using a simple but effective purification decision method. Finally, we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and re-routing process for multiple routing requests. Simulation results show that the proposed algorithms not only can provide fidelity-guaranteed routing solutions, but also has superior performance in terms of throughput, fidelity of end-to-end entanglement connection, and resource utilization ratio, compared with the existing routing scheme.
Entanglement distribution, which relies on entanglement routing and swapping strategies, is a fundamental task in quantum networks. However, existing routing algorithms often overutilize the quantum memory of nodes along shortest paths and neglect imbalanced memory utilization across different nodes, thereby increasing the risk of end-to-end (E2E) entanglement failures for subsequent requests. Moreover, suboptimal swapping strategies can further exacerbate memory imbalance among nodes. In this paper, we study load-balanced entanglement distribution to improve the resilience of quantum networks. We first propose abottleneck node modelthat captures shared quantum memory constraints at each node. Based on this model, we formulate theload-balanced entanglement distributionproblem, which aims to optimize routing decisions and swapping strategies to balance memory utilization. We prove the problem to be NP-hard and develop a decomposition-based approach that separates path finding and quantum memory allocation for sequential request processing. Based on this decomposition, we propose LBER (Load-Balanced Entanglement Routing), a polynomial-time heuristic that distributes entanglement across multiple paths. We further design an adaptive swapping strategy, AdapSwap, to determine the optimal swapping order along each path. Extensive simulations show that our approach significantly improves load balance and increases the request satisfaction ratio by 7.69%∼32.14%.
The core technology to construct large-scale quantum networks is to efficiently distribute remote entanglement among quantum nodes. Entanglement routing deals with the problem of discovering and selecting paths to perform the multi-hop entanglement swapping between two distant nodes. In order to succeed in end-to-end entanglement creation for a given path, entanglement distribution of all direct quantum links and Bell state measurement of all intermediate nodes along the path should be successful. Existing studies have addressed the entanglement routing problem based on path discovery algorithms considering the above characteristics and selecting the optimal path from the individual performance perspective of each path. In this article, we newly define the entanglement routing problem considering the joint-utilization between multiple paths to maximize the network resource efficiency, and present an optimal link-set configuration algorithm, named RELiC, as a solution for this. The performance of the proposed entanglement routing protocol is evaluated in small- and large-scale quantum networks through mathematical analysis and simulation study.
Entanglement distribution between distant quantum nodes plays an essential role in realizing quantum networks’ capabilities. In addition to path selection, remote entanglement distribution involves two pivotal quantum operations, i.e., entanglement generation and entanglement swapping. The existing studies mainly adopt two methods, i.e., Tell-and-Generation (TAG) and Tell-and-Swapping (TAS), to manage these two quantum operations on a selected path. However, both methods fatally introduce redundant stop-and-wait processes, which are detrimental to the performance of remote entanglement distribution in terms of latency and fidelity. To achieve low-latency and high-fidelity entanglement distribution between far-off quantum nodes, we propose a segment-based method consisting of an entanglement generation algorithm and a segment design to diminish the unnecessary stop-and-wait processes. The entanglement generation algorithm adopts a concurrent design to establish entanglement links using the one-demand generation model, thus effectively reducing waiting time compared to hop-by-hop and parallel designs. The segment design is proposed to split a long-distance path into multiple short-haul segments with the similar ability to swap entanglement, and these segments build multi-hop entanglement connections in parallel. Extensive simulations show that the segment-based method significantly outperforms the existing methods, including TAG and TAS, in entanglement distribution latency and effectively mitigates fidelity attenuation.