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.
翻译:纠缠路由在两个任意节点之间建立了远程纠缠关系,这是量子网络中最重要的功能之一。现有的路由机制主要改进纠缠各代人失败时的稳健性和吞吐量,但很少包括评估连接质量、纠缠性等最重要衡量标准方面的考虑。为了解决这个问题,我们提议净化驱动纠缠路由设计,为量子网络中多个源-目的地对配提供忠诚性保证。在我们的提案中,我们首先考虑单一的S-D配对情景,并设计一个迭接路路路接线算法(Q-PATH),以便找到在交错各代人失败时的最佳净化决定。此外,一个使用扩展的Dijkstra算法(Q-LEAP)的低兼容性路由路由算算法,目的是通过简单而有效的净化决策法(S-D配方)来降低计算复杂性。然后我们考虑共同的S-D配方和设计一个基于贪婪的路径连接比比算法(Q-PATH),以最小性算法进行资源配置和重新算算算算方法,通过资源分配和计算结果来显示资源配置的多样化。