Tight bounds on accessible information and informational power

被引:19
|
作者
Dall'Arno, Michele [1 ]
Buscemi, Francesco [1 ,2 ]
Ozawa, Masanao [1 ]
机构
[1] Nagoya Univ, Grad Sch Informat Sci, Chikusa Ku, Nagoya, Aichi 4648601, Japan
[2] Nagoya Univ, Inst Adv Res, Chikusa Ku, Nagoya, Aichi 4648601, Japan
基金
日本学术振兴会;
关键词
accessible information; informational power; SIC POVM; QUANTUM INFORMATION; STATES;
D O I
10.1088/1751-8113/47/23/235302
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The accessible information quantifies the amount of classical information that can be extracted from an ensemble of quantum states. Analogously, the informational power quantifies the amount of classical information that can be extracted by a quantum measurement. For both quantities, we provide upper and lower bounds that depend only on the dimension of the system, and we prove their tightness. In the case of symmetric informationally complete (SIC) ensembles and measurements, stronger bounds are provided and their tightness proved for qubits and qutrits. From our upper bounds, we notice, perhaps surprisingly, that the statistics generated by SIC ensembles or measurements in arbitrary dimension, though optimal for tomographic purposes, in fact never contain more than just one bit of information, the rest being constituted by completely random bits. On the other hand, from our lower bounds, we obtain an explicit strategy beating the so-called pretty-good one for the extraction of mutual information in the case of SIC ensembles and measurements.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Hierarchy of bounds on accessible information and informational power
    Dall'Arno, Michele
    [J]. PHYSICAL REVIEW A, 2015, 92 (01):
  • [2] Accessible information and informational power of quantum 2-designs
    Dall'Arno, Michele
    [J]. PHYSICAL REVIEW A, 2014, 90 (05):
  • [3] Tradeoff Relations Between Accessible Information, Informational Power, and Purity
    Dall'Arno, Michele
    Buscemi, Francesco
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (04) : 2614 - 2622
  • [4] BOUNDS FOR ACCESSIBLE INFORMATION IN QUANTUM-MECHANICS
    FUCHS, CA
    CAVES, CM
    [J]. FUNDAMENTAL PROBLEMS IN QUANTUM THEORY: A CONFERENCE HELD IN HONOR OF PROFESSOR JOHN A. WHEELER, 1995, 755 : 706 - 714
  • [5] TIGHT RIGOROUS BOUNDS TO ATOMIC INFORMATION ENTROPIES
    ANGULO, JC
    DEHESA, JS
    [J]. JOURNAL OF CHEMICAL PHYSICS, 1992, 97 (09): : 6485 - 6495
  • [6] Bounds of the accessible information under the influence of thermal noise
    Ban, M
    Osaki, M
    Hirota, O
    [J]. QUANTUM COMMUNICATION, COMPUTING, AND MEASUREMENT, 1997, : 41 - 51
  • [7] Tight Bounds on the Information Rate of Secret Sharing Schemes
    Carlo Blundo
    Alfredo De Santis
    Roberto De Simone
    Ugo Vaccaro
    [J]. Designs, Codes and Cryptography, 1997, 11 (2) : 107 - 110
  • [8] Simple and tight bounds for information reconciliation and privacy amplification
    Renner, R
    Wolf, S
    [J]. ADVANCES IN CRYPTOLOGY ASIACRYPT 2005, 2005, 3788 : 199 - 216
  • [9] Tight Bounds on Information Dissemination in Sparse Mobile Networks
    Pettarin, Alberto
    Pietracaprina, Andrea
    Pucci, Geppino
    Upfal, Eli
    [J]. PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 355 - 362
  • [10] Accessible Computation of Tight Symbolic Bounds on Causal Effects using an Intuitive Graphical Interface
    Jonzon, Gustav
    Sachs, Michael C.
    Gabriel, Erin E.
    [J]. R JOURNAL, 2023, 15 (04): : 53 - 68