Concurrent Entanglement Routing for Quantum Networks: Model and Designs
Concurrent Entanglement Routing for Quantum Networks: Model and Designs
复制标题
DOI：
10.1109/tnet.2023.3343748
复制
发表时间：
2020-07
期刊：
影响因子：
--
通讯作者：
Shouqian Shi;Chen Qian
中科院分区：
文献类型：
--
作者：
Shouqian Shi;Chen Qian
量子纠缠使重要的计算应用成为可能，例如量子密钥分配。基于量子纠缠，量子网络可以在两个远程通信方之间提供远距离的秘密共享。建立多跳量子纠缠具有很高的失败率，现有的量子网络依赖于可信的中继节点来传输量子比特。然而，当量子网络的规模增加时，它需要端到端的多跳量子纠缠，以便在不让中继器知道秘密比特的情况下传递秘密比特。本文主要研究纠缠路由问题，其目标是通过不可信的中继器为并发的源-目的地对通过多跳建立长距离纠缠。与现有的分析特殊网络拓扑上传统路由技术的工作不同，我们提出了一个全面的纠缠路由模型，反映了量子网络与经典网络之间的差异，并提出了一种利用量子网络独特属性的新纠缠路由算法。评估结果表明，所提出的算法Q-CAST增加了成功的长距离纠缠的数量相比，其他方法有很大的利润。本文所建立的模型和仿真器可以鼓励更多的网络研究人员研究纠缠路由问题。
Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.