Path selection for quantum repeater networks
Path selection for quantum repeater networks
复制标题
DOI：
10.1007/s13119-013-0026-2
复制
发表时间：
2012-06
期刊：
影响因子：
--
通讯作者：
R. V. Meter;Takahiko Satoh;T. Ladd;W. Munro;K. Nemoto
中科院分区：
文献类型：
--
作者：
R. V. Meter;Takahiko Satoh;T. Ladd;W. Munro;K. Nemoto
量子网络将支持长距离量子密钥分发（QKD）和分布式量子计算，是实验和理论研究的活跃领域。在这里，我们对由异构链路组成的拓扑复杂的量子中继器网络进行了分析。量子网络与经典网络有根本的行为差异；量子态的微妙性使得实用的路径选择算法势在必行，但资源利用的经典概念不能直接适用，导致已知的路径选择机制不足。为了使 Dijkstra 算法适用于生成纠缠贝尔对的量子中继器网络，我们量化了关键差异并定义了链路成本度量，即特定保真度的每个贝尔对的秒数，其中单个贝尔对是执行一次量子隐形传态所消耗的资源。包括物理交互和广泛的经典消息传递的模拟证实了 Dijkstra 的算法在量子环境中运行良好。模拟大约三百条异构路径，比较我们的路径成本和沿路径的总工作量，得出 0.88 或更好的决定系数。
Quantum networks will support long-distance quantum key distribution (QKD) and distributed quantum computation, and are an active area of both experimental and theoretical research. Here, we present an analysis of topologically complex networks ofquantum repeaterscomposed of heterogeneous links. Quantum networks have fundamental behavioral differences from classical networks; the delicacy of quantum states makes a practical path selection algorithm imperative, but classical notions of resource utilization are not directly applicable, rendering known path selection mechanisms inadequate. To adapt Dijkstra’s algorithm for quantum repeater networks that generate entangled Bell pairs, we quantify the key differences and define a link cost metric,seconds per Bell pairof a particular fidelity, where a single Bell pair is the resource consumed to perform one quantum teleportation. Simulations that include both the physical interactions and the extensive classical messaging confirm that Dijkstra’s algorithm works well in a quantum context. Simulating about three hundred heterogeneous paths, comparing our path cost and the total work along the path gives a coefficient of determination of 0.88 or better.