Classical capacity per unit cost for quantum channels

被引:9
|
作者
Jarzyna, Marcin [1 ]
机构
[1] Univ Warsaw, Ctr New Technol, Ulica Banacha 2C, PL-02097 Warsaw, Poland
关键词
COMMUNICATION; ENTROPY; SUPERADDITIVITY; INFORMATION; METRICS; RATES; NOISE;
D O I
10.1103/PhysRevA.96.032340
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance of communication protocol by classical capacity, quantifying the maximal amount of information that can be transmitted through a quantum channel per single use of the channel. However, different figures of merit are also possible and a particularly well-suited one is the classical capacity per unit cost, which quantifies the maximal amount of information that can be transmitted per unit cost. I generalize this concept to account for the quantum nature of the information carriers and communication channels and show that if there exists a state with cost equal to zero, e.g., a vacuum state, the capacity per unit cost can be expressed by a simple formula containing maximization of the relative entropy between two quantum states. This enables me to analyze the behavior of photon information efficiency for general communication tasks and show simple bounds on the capacity per unit cost in terms of quantities familiar from quantum estimation theory. I calculate also the capacity per unit cost for general Gaussian quantum channels.
引用
收藏
页数:9
相关论文
共 50 条
  • [41] An upper bound on quantum capacity of unital quantum channels
    Anshu, Anurag
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 214 - 218
  • [42] Private Classical Communication Over Quantum Multiple-Access Channels
    Chou, Remi A.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (03) : 1782 - 1794
  • [43] Classical Capacities of Compound and Averaged Quantum Channels
    Bjelakovic, Igor
    Boche, Holger
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3360 - 3374
  • [44] Algorithmic superactivation of asymptotic quantum capacity of zero-capacity quantum channels
    Gyongyosi, Laszlo
    Imre, Sandor
    INFORMATION SCIENCES, 2013, 222 : 737 - 753
  • [45] Polar Codes for Classical-Quantum Channels
    Wilde, Mark M.
    Guha, Saikat
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (02) : 1175 - 1187
  • [46] Quantum-Locked Key Distribution at Nearly the Classical Capacity Rate
    Lupo, Cosmo
    Lloyd, Seth
    PHYSICAL REVIEW LETTERS, 2014, 113 (16)
  • [47] Upper bound on the classical capacity of a quantum channel assisted by classical feedback
    Ding, Dawei
    Khatri, Sumeet
    Quek, Yihui
    Shor, Peter W.
    Wang, Xin
    Wilde, Mark M.
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 906 - 911
  • [48] Certifying the classical simulation cost of a quantum channel
    Doolittle, Brian
    Chitambar, Eric
    PHYSICAL REVIEW RESEARCH, 2021, 3 (04):
  • [49] Strong Converse for the Feedback-Assisted Classical Capacity of Entanglement-Breaking Channels
    Ding, D.
    Wilde, M. M.
    PROBLEMS OF INFORMATION TRANSMISSION, 2018, 54 (01) : 1 - 19
  • [50] The Quantum Capacity of Channels With Arbitrarily Correlated Noise
    Buscemi, Francesco
    Datta, Nilanjana
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (03) : 1447 - 1460