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

Opto-Electronics and Communications Conference (OECC)

Fidelity-Guaranteed Entanglement Routing in Heterogeneous Multi-Domain Quantum Networks

Yazi Wang, Xiaosong Yu, Yongli Zhao, Yuan Cao, Avishek Nag, Jie Zhang

Published Jun 30, 2024• 0 citations
Publisher

Abstract

A fidelity-guaranteed entanglement routing algorithm for sharing entanglement in heterogeneous quantum networks is simulated on network topologies. Results show improved final fidelity, especially for setting with a higher fidelity threshold.
DOI
10.1109/oecc54135.2024.10975651

Related papers

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.

IEEE Transactions on Communications•Aug 19, 2022•136 citations

Multi-User Entanglement Routing for Quantum Mesh Networks

Evan Sutcliffe, Matty J. Hoban, Alejandra Beghelli

Multipath routing for sharing entanglement between multiple devices was simulated on real network topologies and compared against single-path routing. Results show improved entanglement rates, especially for topologies with a higher average nodal degree.

Optical Fiber Communication Conference•Jan 1, 2023•1 citation

Purification-enabled Routing with Guaranteed Fidelity in Entanglement Distribution Networks

Yazi Wang, Xiaosong Yu, Yongli Zhao +1 more

A purification-enabled routing algorithm was proposed to support remote entangled pairs sharing with limited quantum resources, upon satisfying the fidelity threshold for generated remote entanglements, and the proposed algorithm is further verified via simulation.

Opto-Electronics and Communications Conference (OECC)•Jul 2, 2023•2 citations

Multi-User Entanglement Routing for Quantum Mesh Networks

Evan Sutcliffe, Matty J. Hoban, Alejandra Beghelli

Multipath routing for sharing entanglement between multiple devices was simulated on real network topologies and compared against single-path routing. Results show improved entanglement rates, especially for topologies with a higher average nodal degree. © 2022 The Author(s)

Optical Fiber Communication Conference•Mar 1, 2023•0 citations

Fidelity-Guarantee Entanglement Routing in Quantum Networks

Jian Li, Mingjun Wang, Qidong Jia +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 (SD) 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. Then we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and rerouting process for multiple routing requests. To verify the effectiveness and superiority of the proposed algorithms, extensive simulations are conducted, and the simulation results show that the proposed algorithms not only can provide fidelity-guarantee 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•Nov 15, 2021•3 citations

Entanglement routing with guaranteed fidelity for drone-based quantum networks

Haoran Hu, Huazhi Lun, Ya Wang +10 more

The quantum Internet is profoundly impacting the world and is expected to be operational in the future. With the global wide-area quantum networks begin to take shape, drone-based quantum entanglement networks have attracted widespread attention. Compared to quantum links based on optical fibers or satellites, drone-based quantum entanglement networks can effectively address the need for responsive and on-demand quantum network coverage across diverse locations and operational times. To realize network construction, entanglement routing protocols pose a significant challenge. On the one hand, the fidelity of the entangled system degrades hop-byhop. On the other hand, the dynamics and limited energy of drone nodes are equally not negligible. However, existing works have not adequately addressed these issues. In this paper, we present a novel fidelity-guaranteed entanglement routing protocol for drone-based quantum networks (FGER_D). The FGER_D considers the node energy and quantum link vulnerability comprehensively, selects end-to-end fidelity as the routing metric, and employs multiple attempts' entanglement purification scheme to provide fidelity-guaranteed entanglement connections in noisy environments. Numerical simulations demonstrate that compared to existing algorithms, FGER_D improves network throughput by approximately 24% under default settings, while also ensuring network fidelity and extending network lifetime. Our work is expected to provide a theoretical basis for the deployment of drone-based entanglement distribution networks.

Journal of Communications and Networks•Aug 1, 2025•1 citation
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 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 (SD) 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. Then we consider the common scenario with multiple S-D pairs and design a greedy-based algorithm considering resource allocation and rerouting process for multiple routing requests. To verify the effectiveness and superiority of the proposed algorithms, extensive simulations are conducted, and the simulation results show that the proposed algorithms not only can provide fidelity-guarantee 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.
The quantum Internet is profoundly impacting the world and is expected to be operational in the future. With the global wide-area quantum networks begin to take shape, drone-based quantum entanglement networks have attracted widespread attention. Compared to quantum links based on optical fibers or satellites, drone-based quantum entanglement networks can effectively address the need for responsive and on-demand quantum network coverage across diverse locations and operational times. To realize network construction, entanglement routing protocols pose a significant challenge. On the one hand, the fidelity of the entangled system degrades hop-byhop. On the other hand, the dynamics and limited energy of drone nodes are equally not negligible. However, existing works have not adequately addressed these issues. In this paper, we present a novel fidelity-guaranteed entanglement routing protocol for drone-based quantum networks (FGER_D). The FGER_D considers the node energy and quantum link vulnerability comprehensively, selects end-to-end fidelity as the routing metric, and employs multiple attempts' entanglement purification scheme to provide fidelity-guaranteed entanglement connections in noisy environments. Numerical simulations demonstrate that compared to existing algorithms, FGER_D improves network throughput by approximately 24% under default settings, while also ensuring network fidelity and extending network lifetime. Our work is expected to provide a theoretical basis for the deployment of drone-based entanglement distribution networks.