Postselected communication over quantum channels

被引:2
|
作者
Ji, Kaiyuan [1 ]
Regula, Bartosz [2 ,3 ]
Wilde, Mark M. [1 ]
机构
[1] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14850 USA
[2] RIKEN Cluster Pioneering Res CPR, Math Quantum Informat RIKEN Hakubi Res Team, Wako, Saitama 3510198, Japan
[3] RIKEN Ctr Quantum Comp RQC, Wako, Saitama 3510198, Japan
基金
美国国家科学基金会;
关键词
Postselection; entanglement-assisted communication; quantum channel capacity; Hilbert projective metric; quantum Shannon theory; ENTANGLEMENT-ASSISTED CAPACITY; CLASSICAL CAPACITY; STRONG CONVERSE; FEEDBACK; DIFFERENTIATE; EXPONENTS; ERASURE;
D O I
10.1142/S0219749924400124
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The single-letter characterization of the entanglement-assisted capacity of a quantum channel is one of the seminal results of quantum information theory. In this paper, we consider a modified communication scenario in which the receiver is allowed an additional, "inconclusive" measurement outcome, and we employ an error metric given by the error probability in decoding the transmitted message conditioned on a conclusive measurement result. We call this setting postselected communication and the ensuing highest achievable rates the postselected capacities. Here, we provide a precise single-letter characterization of postselected capacities in the setting of entanglement assistance as well as the more general nonsignaling assistance, establishing that they are both equal to the channel's projective mutual information - a variant of mutual information based on the Hilbert projective metric. We do so by establishing bounds on the one-shot postselected capacities, with a lower bound that makes use of a postselected teleportation-based protocol and an upper bound in terms of the postselected hypothesis testing relative entropy. As such, we obtain fundamental limits on a channel's ability to communicate even when this strong resource of postselection is allowed, implying limitations on communication even when the receiver has access to postselected closed timelike curves.
引用
收藏
页数:38
相关论文
共 50 条
  • [31] Photonic channels for quantum communication
    van Enk, SJ
    Cirac, JI
    Zoller, P
    SCIENCE, 1998, 279 (5348) : 205 - 208
  • [32] Applications of position-based coding to classical communication over quantum channels
    Qi, Haoyu
    Wang, Qingle
    Wilde, Mark M.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2018, 51 (44)
  • [33] Enhanced energy-constrained quantum communication over bosonic Gaussian channels
    Kyungjoo Noh
    Stefano Pirandola
    Liang Jiang
    Nature Communications, 11
  • [34] Pauli Manipulation Detection Codes and Applications to Quantum Communication over Adversarial Channels
    Bergamaschi, Thiago
    ADVANCES IN CRYPTOLOGY, PT III, EUROCRYPT 2024, 2024, 14653 : 404 - 433
  • [35] Converse bounds for quantum and private communication over Holevo-Werner channels
    Cope, Thomas P. W.
    Goodenough, Kenneth
    Pirandola, Stefano
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2018, 51 (49)
  • [36] Effective Noise Estimation for Secure Quantum Direct Communication over Imperfect Channels
    Zawadzki, Piotr
    Communications in Computer and Information Science, 2014, 431 : 197 - 204
  • [37] Applications of position-based coding to classical communication over quantum channels
    Qi, Haoyu
    Wang, Qingle
    Wilde, Mark M.
    2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 209 - 213
  • [38] Effective Noise Estimation for Secure Quantum Direct Communication over Imperfect Channels
    Zawadzki, Piotr
    COMPUTER NETWORKS, CN 2014, 2014, 431 : 197 - 204
  • [39] Fundamental Limits of Quantum-Secure Covert Communication Over Bosonic Channels
    Bullock, Michael S.
    Gagatsos, Christos N.
    Guha, Saikat
    Bash, Boulat A.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2020, 38 (03) : 471 - 482
  • [40] Fundamental Limits of Quantum-Secure Covert Communication over Bosonic Channels
    Bullock, Michael S.
    Gagatsos, Christos N.
    Guha, Saikat
    Bash, Boulat A.
    2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 56 - 63