Gyongyosi Laszlo, Imre Sandor
School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, 7 Nador st., Budapest, H-1051, Hungary.
Sci Rep. 2017 Oct 27;7(1):14255. doi: 10.1038/s41598-017-14394-w.
We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.
我们定义了量子中继器网络的纠缠梯度路由方案。该路由框架融合了群体智能和量子香农理论的基本原理。群体智能为解决问题提供了受自然启发的解决方案。受群居昆虫行为模型的启发，路由通过并行线程执行，以通过纠缠梯度系数确定最短路径，该系数描述了网络中纠缠链路和路径的可行性。路由度量源自量子网络中纠缠传输的特性和纠缠分布的相关度量。该方法允许在量子中继器网络中进行中等复杂度的分散式路由。研究结果可应用于实验量子网络、未来量子互联网和长距离量子通信。
