End-to-end capacities of a quantum communication network

被引:248
作者
Pirandola, Stefano [1 ,2 ]
机构
[1] Univ York, Dept Comp Sci, York YO10 5GH, N Yorkshire, England
[2] MIT, Elect Res Lab, Cambridge, MA 02139 USA
基金
英国工程与自然科学研究理事会;
关键词
MAXIMUM FLOW; INFORMATION;
D O I
10.1038/s42005-019-0147-3
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
引用
收藏
页数:10
相关论文
共 69 条
[1]  
Ahuja R. K., 1993, NETWORK FLOWS THEORY
[2]   IMPROVED TIME-BOUNDS FOR THE MAXIMUM FLOW PROBLEM [J].
AHUJA, RK ;
ORLIN, JB ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1989, 18 (05) :939-954
[3]   GENERATING PSEUDO-RANDOM PERMUTATIONS AND MAXIMUM FLOW ALGORITHMS [J].
ALON, N .
INFORMATION PROCESSING LETTERS, 1990, 35 (04) :201-204
[4]  
[Anonymous], 2017, ROUTING ENTANGLEMENT
[5]  
[Anonymous], LINEAR PROGRAMS ENTA
[6]  
[Anonymous], QUANTUM NETWORKING
[7]  
[Anonymous], P ACM STOC NEW YORK, DOI DOI 10.1145/2488608.2488705
[8]  
[Anonymous], 1990, P ICALP
[9]  
[Anonymous], TIGHT FINITE RESOURC
[10]  
[Anonymous], FUNDAMENTAL LIMITS Q