Fidelity-Guaranteed Entanglement Routing in Quantum Networks
- 18 August 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (10) , 6748-6763
Abstract
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.Keywords
Funding Information
- Anhui Initiative in Quantum Information Technologies (AHY150300)
- China Postdoctoral Science Foundation (2021M703118)
- Youth Innovation Promotion Association of Chinese Academy of Sciences (Y202093)
This publication has 40 references indexed in Scilit:
- Optimal architectures for long distance quantum communicationScientific Reports, 2016
- Inside Quantum RepeatersIEEE Journal of Selected Topics in Quantum Electronics, 2015
- Distribution of entanglement in large-scale quantum networksReports on Progress in Physics, 2013
- SNDlib 1.0—Survivable Network Design LibraryNetworks, 2009
- The quantum internetNature, 2008
- Fault-tolerant quantum repeaters with minimal physical resources and implementations based on single-photon emittersPhysical Review A, 2005
- Parallel simulation of mesh routing algorithms2002
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy ChannelsPhysical Review Letters, 1996
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971