Quantum Channel Capacities per Unit Cost

被引:9
作者
Ding, Dawei [1 ]
Pavlichin, Dmitri S. [2 ]
Wilde, Mark M. [3 ,4 ]
机构
[1] Stanford Univ, Stanford Inst Theoret Phys, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Appl Phys, Stanford, CA 94305 USA
[3] Louisiana State Univ, Dept Phys & Astron, Hearne Inst Theoret Phys, Baton Rouge, LA 70803 USA
[4] Louisiana State Univ, Ctr Computat & Technol, Baton Rouge, LA 70803 USA
基金
美国国家科学基金会;
关键词
Capacity per unit cost; bosonic Gaussian channels; quantum communication; blocklength-cost duality; CLASSICAL CAPACITY; STRONG CONVERSE; INFORMATION-TRANSMISSION; RELATIVE ENTROPY; ASYMPTOTICS; ADDITIVITY; LIMITS;
D O I
10.1109/TIT.2018.2854747
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Communication over a noisy channel is often conducted in a setting in which different input symbols to the channel incur a certain cost. For example, for bosonic quantum channels, the cost associated with an input state is the number of photons, which is proportional to the energy consumed. In such a setting, it is often useful to know the maximum amount of information that can be reliably transmitted per cost incurred. This is known as the capacity per unit cost. In this paper, we generalize the capacity per unit cost to various communication tasks involving a quantum channel, such as classical communication, entanglement-assisted classical communication, private communication, and quantum communication. For each task, we define the corresponding capacity per unit cost and derive a formula for it analogous to that of the usual capacity. Furthermore, for the special and natural cases in which there is a zero-cost state, we obtain expressions in terms of an optimized relative entropy involving the zero-cost state. For each communication task, we construct an explicit pulse-position-modulation coding scheme that achieves the capacity per unit cost. Finally, we compute capacities per unit cost for various bosonic Gaussian channels and introduce the notion of a blocklength constraint as a proposed solution to the long-standing issue of infinite capacities per unit cost. This motivates the idea of a blocklength-cost duality on which we elaborate in depth.
引用
收藏
页码:418 / 435
页数:18
相关论文
共 72 条
  • [1] [Anonymous], 2006, Elements of information theory
  • [2] [Anonymous], THESIS
  • [3] [Anonymous], 2002, P MSRI WORKSH QUANT
  • [4] Anshu A., 2017, ONE SHOT ENTANGLEMEN
  • [5] Strong Converse for the Classical Capacity of Optical Quantum Communication Channels
    Bardhan, Bhaskar Roy
    Garcia-Patron, Raul
    Wilde, Mark M.
    Winter, Andreas
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (04) : 1842 - 1850
  • [6] On quantum fidelities and channel capacities
    Barnum, H
    Knill, E
    Nielsen, MA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1317 - 1329
  • [7] Information transmission through a noisy quantum channel
    Barnum, H
    Nielsen, MA
    Schumacher, B
    [J]. PHYSICAL REVIEW A, 1998, 57 (06) : 4153 - 4175
  • [8] The Quantum Capacity of Channels With Arbitrarily Correlated Noise
    Buscemi, Francesco
    Datta, Nilanjana
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (03) : 1447 - 1460
  • [9] Quantum privacy and quantum wiretap channels
    N. Cai
    A. Winter
    R. W. Yeung
    [J]. Problems of Information Transmission, 2004, 40 (4) : 318 - 336
  • [10] QUANTUM LIMITS ON BOSONIC COMMUNICATION RATES
    CAVES, CM
    DRUMMOND, PD
    [J]. REVIEWS OF MODERN PHYSICS, 1994, 66 (02) : 481 - 537