Coding theorem and strong converse for quantum channels

被引:275
作者
Winter, A [1 ]
机构
[1] Univ Bielefeld, Fak Math, D-33501 Bielefeld, Germany
关键词
classical capacity; coding; Holevo bound; quantum channel; strong converse;
D O I
10.1109/18.796385
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this correspondence, we present a new proof of Horevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.
引用
收藏
页码:2481 / 2485
页数:5
相关论文
共 20 条
  • [1] [Anonymous], 1976, INVITATION C ALGEBRA
  • [2] Quantum nonlocality without entanglement
    Bennett, CH
    DiVincenzo, DP
    Fuchs, CA
    Mor, T
    Rains, E
    Shor, PW
    Smolin, JA
    Wootters, WK
    [J]. PHYSICAL REVIEW A, 1999, 59 (02): : 1070 - 1091
  • [3] CSISZAR I, 1981, INFORMATION THEORY C
  • [4] Davies EB., 1976, Quantum Theory of Open Systems
  • [5] FEINSTEIN A, 1954, IEEE T INFORM THEORY, V4, P2
  • [6] Operational capacity and pseudoclassicality of a quantum channel
    Fujiwara, A
    Nagaoka, H
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) : 1071 - 1086
  • [7] Classical information capacity of a quantum channel
    Hausladen, P
    Jozsa, R
    Schumacher, B
    Westmoreland, M
    Wootters, WK
    [J]. PHYSICAL REVIEW A, 1996, 54 (03): : 1869 - 1876
  • [8] Holevo A. S., 1977, Reports on Mathematical Physics, V12, P273, DOI 10.1016/0034-4877(77)90010-6
  • [9] Holevo A. S., 1973, PROBL PEREDACHI INF, V9, P177
  • [10] The capacity of the quantum channel with general signal states
    Holevo, AS
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) : 269 - 273