High-fidelity entanglement routing in quantum networks

Quantum networks, endowed with their distinct quantum properties, are poised to emerge as indispensable platforms for the implementation of quantum information technology applications in the near future. Within the realm of quantum networks, the transmission of remote quantum information presents a pivotal and intricate challenge, commonly referred to as the entanglement routing problem. While previous efforts have delved into the intricacies of entanglement routing, there has been a notable oversight concerning the crucial parameter of entanglement fidelity. Hence, this paper introduces a novel Purification-enabled Entanglement Routing Algorithm (PERA). Initially, PERA utilizes the network throughput as the routing metric and ensures fidelity guarantees on all nodes in the link through a hop-by-hop purification process. Subsequently, acknowledging the probabilistic nature of entanglement purification, a strategy involving multiple attempts at purification is employed. Finally, a comprehensive utility function is deployed to address the path selection problem for multiple source–destination pairs. Numerical simulations confirm that PERA establishes entanglement connections with outstanding fidelity guarantees. Concurrently, PERA outperforms the baseline algorithm in terms of network throughput and resource utilization.