Aggregating quantum repeaters for the quantum internet

Aggregating quantum repeaters for the quantum internet
复制标题

DOI:
10.1103/physreva.96.032332
复制
发表时间:
2016-06
期刊:
影响因子:
2.9
通讯作者:
Koji Azuma;G. Kato
Koji Azuma;G. Kato
中科院分区:
物理与天体物理2区
文献类型:
--
作者:
Koji Azuma;G. Kato

文献摘要

被引文献

相似文献

量子互联网有望实现量子隐形传态和地球仪上任意用户之间无条件安全的自由通信,以及量子多体系统的模拟。对于这样的量子互联网协议,已经导出了可获得的纠缠或秘密密钥的一般基本上界[K. Azuma,A.水谷和H.- K. Lo,Nat. Commun. 7,13523(2016)]。这里我们考虑它的匡威问题。特别是,我们提出了一个通用的协议构造从任何给定的量子网络,这是基于运行量子中继器方案在网络上并行。对于任意损耗的光信道网络,我们的协议没有缩放间隙的上限,即使基于现有的量子中继器方案。在一个渐近极限,我们的协议作为一个最佳的纠缠或秘密密钥分配在任何量子网络组成的实际信道,如擦除信道,退相信道,玻色子量子放大器信道,和有损光信道。
The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016)]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.