期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
多跳远程量子态制备
1
作者 彭家寅 《计算机工程与应用》 CSCD 北大核心 2019年第19期81-86,共6页
多跳远程量子态制备在量子无线网络、长距离量子信息传输中有重要价值。融合多跳隐形传态和远程态制备的思想,提出一个多跳远程任意单量子态制备协议。在每一跳中都以三粒子非最大纠缠GHz态为量子信道,利用远程态制备方法,原始单量子态... 多跳远程量子态制备在量子无线网络、长距离量子信息传输中有重要价值。融合多跳隐形传态和远程态制备的思想,提出一个多跳远程任意单量子态制备协议。在每一跳中都以三粒子非最大纠缠GHz态为量子信道,利用远程态制备方法,原始单量子态通过中间节点逐跳被制备,每跳恢复的态被用着下一跳被制备的态。通过对单跳和两跳制备的分析,获得了n跳制备后方案成功的概率。在协议中,仅涉及到Pauli算子、单粒子测量和前馈策略,因此该方案易于物理实现。 展开更多
关键词 无线量子通信网络 多跳远程态制备 三粒子非最大纠缠态 单粒子态 前馈策略
下载PDF
Distribution algorithm of entangled particles for wireless quantum communication mesh networks
2
作者 王霄峻 施丽慧 +2 位作者 占海涛 项睿清 余旭涛 《Journal of Southeast University(English Edition)》 EI CAS 2015年第4期450-456,共7页
With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes ... With ensured network connectivity in quantum channels, the issue of distributing entangled particles in wireless quantum communication mesh networks can be equivalently regarded as a problem of quantum backbone nodes selection in order to save cost and reduce complexity. A minimum spanning tree( MST)-based quantum distribution algorithm( QDMST) is presented to construct the mesh backbone network. First, the articulation points are found,and for each connected block uncovered by the articulation points, the general centers are solved. Then, both articulation points and general centers are classified as backbone nodes and an M ST is formed. The quantum path between every two neighbor nodes on the MST is calculated. The nodes on these paths are also classified as backbone nodes. Simulation results validate the advantages of QDMST in the average backbone nodes number and average quantum channel distance compared to the existing random selection algorithm under multiple network scenarios. 展开更多
关键词 wireless quantum communication networks entangled particles distribution wireless mesh networks minimum spanning tree
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部