A Survey on Quantum Channel Capacities

被引：226
作者：
Gyongyosi, Laszlo [1 ,2 ,3 ]
Imre, Sandor [2 ]
Hung Viet Nguyen [1 ]
机构：
[1] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, Hants, England
[2] Budapest Univ Technol & Econ, Dept Networked Syst & Serv, H-1117 Budapest, Hungary
[3] Hungarian Acad Sci, MTA BME Informat Syst Res Grp, H-1051 Budapest, Hungary
来源：
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS | 2018年 / 20卷 / 02期
基金：
匈牙利科学研究基金会; 欧洲研究理事会; 英国工程与自然科学研究理事会;
关键词：
Quantum communication; quantum channels; quantum information; quantum entanglement; quantum Shannon theory; ERROR-CORRECTING CODES; ENTANGLEMENT-ASSISTED CAPACITY; CLASSICAL COMMUNICATION COST; KEY DISTRIBUTION; RELATIVE ENTROPY; INFORMATION-TRANSMISSION; MULTIUSER DETECTION; CELLULAR-AUTOMATA; LOCAL OPERATIONS; HIDDEN-VARIABLES;
D O I：
10.1109/COMST.2017.2786748
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication systems. For quantum communication channels, many new capacity definitions were developed in comparison to classical counterparts. A quantum channel can be used to realize classical information transmission or to deliver quantum information, such as quantum entanglement. Here we review the properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels.
引用
收藏
页码：1149 / 1205
页数：57
相关论文
共 548 条
  • [1] Optimal superdense coding of entangled states
    Abeyesinghe, Anura
    Hayden, Patrick
    Smith, Graeme
    Winter, Andreas J.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (08) : 3635 - 3641
  • [2] ABRAMSON N., 1970, P AFIPS C, V37, P295
  • [3] Ackermann MR, 2008, PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P799
  • [4] von Neumann capacity of noisy quantum channels
    Adami, C
    Cerf, NJ
    [J]. PHYSICAL REVIEW A, 1997, 56 (05): : 3470 - 3483
  • [5] Agarwal P.K., 2007, Computational Geometry: Twenty Years Later
  • [6] Aharonov D., 1997, P 29 ANN ACM S THEOR, P176
  • [7] Strong converse for identification via quantum channels
    Ahlswede, R
    Winter, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (03) : 569 - 579
  • [8] Network information flow theory
    Ahlswede, R
    Cai, N
    Yeung, RW
    [J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 186 - 186
  • [9] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [10] Note on multiple additivity of minimal Renyi entropy output of the Werner-Holevo channels
    Alicki, R
    Fannes, M
    [J]. OPEN SYSTEMS & INFORMATION DYNAMICS, 2004, 11 (04) : 339 - 342
12345678910