无线量子通信mesh网络的纠缠粒子分发算法（英文）

• 作 者: 王霄峻 施丽慧 占海涛 项睿清 余旭涛
• 机 构: 东南大学移动通信国家重点实验室,东南大学毫米波国家重点实验室,
• 出 处: Journal of Southeast University(English Edition)
• 发表日期: 2015年04期
• 关键词: 量子通信 mesh 算法 纠缠粒子分发 无线mesh网络 量子信道 最小生成树 backbone 连通图 网节点

为了节约成本和降低复杂度,在保证量子信道意义上的网络连通性前提下,无线量子通信mesh网络中的纠缠粒子分发问题可被看作为量子骨干节点的选择问题.提出了一种基于最小生成树的量子分发算法QDM ST,以构建mesh骨干网.算法首先求解连通图的关节点,再求解未被关节点覆盖的各连通块的一般中心,将关节点和一般中心作为骨干网节点,并生成最小生成树,以最短径算法求得最小生成树上任意相邻节点间的量子通路,量子通路上的节点也加入骨干网.对算法进行了分析和仿真,仿真结果表明在不同的网络场景下,QDMST算法的平均骨干网节点数和平均量子信道距离均优于随机选择算法.

In order to save costs and reduce complexity, the problem of entangled particle distribution in wireless quantum communication mesh networks can be considered as the selection of quantum backbone nodes under the premise of guaranteeing the network connectivity in the quantum channel. A new algorithm based on minimum generation The QDM ST algorithm is used to construct the mesh mesh.The algorithm firstly solves the joint points of the connected graph, then solves the general center of each connected block which is not covered by the joint node, and uses the joint point and the general center as the backbone nodes The minimum spanning tree is generated and the quantum path between any adjacent nodes in the minimum spanning tree is calculated by the shortest path algorithm.The nodes on the quantum path also join the backbone.The algorithm is analyzed and simulated.The simulation results show that in different network scenarios , The average number of backbone nodes and the average quantum channel distance of the QDMST algorithm are better than the random selection algorithm.