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 条
  • [41] Tight bounds for the probability of overfitting
    Vorontsov, K. V.
    [J]. DOKLADY MATHEMATICS, 2009, 80 (03) : 793 - 796
  • [42] Tight bounds on the AUH codes
    Mohajer, Soheil
    Kakhbod, Ali
    [J]. 2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, : 1010 - +
  • [43] Tight bounds for divisible subdivisions
    Das, Shagnik
    Draganic, Nemanja
    Steiner, Raphael
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 165 : 1 - 19
  • [44] TIGHT BOUNDS ON OBLIVIOUS CHAINING
    CHAUDHURI, S
    [J]. SIAM JOURNAL ON COMPUTING, 1994, 23 (06) : 1253 - 1265
  • [45] Tight Bounds for HTN Planning
    Alford, Ron
    Bercher, Pascal
    Aha, David W.
    [J]. PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2015, : 7 - 15
  • [46] Tight Typings and Split Bounds
    Accattoli, Beniamino
    Graham-Lengrand, Stephane
    Kesner, Delia
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2
  • [47] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. JOURNAL OF ALGORITHMS, 1990, 11 (02) : 242 - 251
  • [48] Tight Bounds on the Radius of Nonsingularity
    Hartman, David
    Hladik, Milan
    [J]. SCIENTIFIC COMPUTING, COMPUTER ARITHMETIC, AND VALIDATED NUMERICS (SCAN 2014), 2016, 9553 : 109 - 115
  • [49] Tight Consistency Bounds for Bitcoin
    Gazi, Peter
    Kiayias, Aggelos
    Russell, Alexander
    [J]. CCS '20: PROCEEDINGS OF THE 2020 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2020, : 819 - 838
  • [50] Cognitive channel and power allocation: information theoretic bounds
    Burr, Alister G.
    [J]. 2009 4TH INTERNATIONAL CONFERENCE ON COGNITIVE RADIO ORIENTED WIRELESS NETWORKS AND COMMUNICATIONS, 2009, : 261 - 266