用户名: 密码: 验证码:
光纤量子通信网络路由选择协议
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Routing protocol of fiber quantum communication network
  • 作者:袁小虎 ; 李春文
  • 英文作者:YUAN Xiao-hu;LI Chun-wen;Department of Automation, Tsinghua University;
  • 关键词:量子通信 ; 路由选择 ; 量子中继器
  • 英文关键词:quantum communication;;routing protocol;;quantum repeater
  • 中文刊名:KZLY
  • 英文刊名:Control Theory & Applications
  • 机构:清华大学自动化系;
  • 出版日期:2017-11-15
  • 出版单位:控制理论与应用
  • 年:2017
  • 期:v.34
  • 基金:国家自然科学基金项目(61374091)资助~~
  • 语种:中文;
  • 页:KZLY201711015
  • 页数:6
  • CN:11
  • ISSN:44-1240/TP
  • 分类号:117-122
摘要
针对光纤量子通信网络,提出一种基于中继器的量子通信网络路由选择协议方案.在现有光纤通信网络的基础上利用基于纠缠交换和纠缠纯化的中继器来构建量子通信网络,然后在中继器的基础上采用嵌套纯化方案进行实际量子通信网络系统信道的建立.针对量子通信网络的特点,提出并分析了量子通信网络路由的评价指标,在路由选择协议方案中重点考虑量子信道建立过程中达到目标保真度值所需消耗的纠缠资源和路由建立时间,并从这些指标分析过程中择优选择量子通信信道.所提出的路由选择协议是基于解析计算及优化设计的,与实际量子通信系统相关联,仿真结果表明这种协议方案具有较强的可操作性.
        A routing protocol is proposed for the fiber quantum communication network. Quantum communication network can be constructed based on the existing optical fiber communication network through using the repeater with entanglement swapping and entanglement purification. And based on the repeater, a practical quantum communication can be constructed with the use of nesting purification protocol. To the innate features of quantum communication network, a system of evaluation metrics on routing protocol of quantum communication network is presented and analyzed detailed.The consumption of the entanglement resources and the routing time for the best resulting fidelity within the building of quantum channel are key considered in the routing protocol, and the quantum communication channel can be chosen preferred from the process of these indicators analysis. The proposed routing protocol based on analytical calculation and optimization design is connected with the practical quantum communication system closely, and the simulation results show that the routing protocol can be operated well.
引文
[1]NIELSENMA,CHUANG I L.Quantum Computation and Quantum Information[M].Cambridge:Cambridge University Press,2010.
    [2]MARVIAN M,LIDAR D A.Error suppression for hamiltonianbased quantum computation using subsystem codes[J].Physical Review Letters,2017,118(3):030504.
    [3]QI Bo,CHEN Hongbin,REN Ge,et al.ATP technology for 100-kilometer quantum entanglement distribution experiment[J].Optics and precision Engineering,2013,21(6):1628–1634.(亓波,陈洪斌,任戈,等.100 km量子纠缠分发实验捕获跟踪技术[J].光学精密工程,2013,21(6):1628–1634.)
    [4]LIAO S K,YONG H L,LIU C,et al.Long-distance free-space quantum key distribution in daylight towards inter-satellite communication[J].Nature Photonics,2017,11(8):509–513.
    [5]BRIEGEL H J,DURW,CIRAC J I,et al.Quantum repeaters:the role of imperfect local operations in quantum communication[J].Physical Review Letters,1998,81(26):5932–5935.
    [6]MURALIDHARAN S,LI L,KIM J,et al.Optimal architectures for long distance quantum communication[J].Scientific reports,2016,6:20463.
    [7]WALLNOFER J,ZWERGER M,MUSCHIK C,et al.Twodimensional quantum repeaters[J].Physical Review A,2016,94(5):052307.
    [8]JIANG L,TAYLOR J M,KHANEJA N,et al.Optimal approach to quantum communication using dynamic programming[J].Proceedings of the National Academy of Sciences,2007,104(44):17291–17296.
    [9]ZHOU Xiaoqing,WU Yunwen,ZHAO Han.Quantum teleportation internetworking and routing strategy[J].Acta Physica Sinica,2011,60(4):040304.(周小清,邬云文,赵晗.量子隐形传态网络的互联与路由策略[J].物理学报,2011,60(4):040304.)
    [10]YU Xutao,XU Jin,ZHANG Zaichen.Routing protocol for wireless ad hoc quantum communication network based on quantum teleportation[J].Acta Physica Sinica,2012,61(22):220303.(余旭涛,徐进,张在琛.基于量子远程传态的无线自组织量子通信网络路由协议[J].物理学报,2012,61(22):220303.)
    [11]METER R V,SATOH T,LADD T D,et al.Path selection for quantum repeater networks[J].Networking Science,2012,3(1/2/3/4):82–95.
    [12]BENNETT C H,BRASSARD G,POPESCU S,et al.Purification of noisy entanglement and faithful teleportation via noisy channels[J].Physical Review Letters,1996,76(5):722–725.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700