Identifying the Information Gain of a Quantum Measurement
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Abstract
We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is available. This result generalizes Winter's measurement compression theorem for fixed independent and identically distributed inputs to arbitrary inputs, and more importantly, it identifies the quantum mutual information of a measurement as the information gained by performing it, independent of the input state on which it is performed. Our result is a generalization of the classical reverse Shannon theorem to quantum-to-classical channels. In this sense, it can be seen as a quantum reverse Shannon theorem for quantum-to-classical channels, but with the entanglement assistance and quantum communication replaced by shared randomness and classical communication, respectively. The proof is based on a novel one-shot state merging protocol for classically coherent states as well as the postselection technique for quantum channels, and it uses techniques developed for the quantum reverse Shannon theorem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Some of the promising quantum communication protocols to expand the possibility of classical data transmission in quantum-based systems include quantum key distribution (QKD) [126,127], quantum teleportation [128] and dense coding [129].”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [126]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For example, authors in [126] discussed and analyzed the applicability of QKD protocols in quantumassisted SatCom systems in order to perform secure communication between ground stations and the satellite.”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [126]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Decoherence and the Transition from Quantum to Classical
Zurek, W. H. (1991) · Physics Today · doi:10.1063/1.881293 · Cited by 2,626
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911 · cited 1×
“Uhlmann’s theorem [43], [44] guarantees that there exists an isometry VX A2 X B B→X B′ X B B B1 such that”
BackgroundThe ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 2×
“The supremum in Definition 1 is reached for k = |A| [31], [32].”
BackgroundThe capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Sending classical information via noisy quantum channels
Schumacher, B., & Westmoreland, M. D. (1997) · Physical Review A · doi:10.1103/physreva.56.131 · Cited by 1,087
SECURITY OF QUANTUM KEY DISTRIBUTION
RENNER, R. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003256 · Cited by 1,047
The uncertainty principle in the presence of quantum memory
Berta, M., Christandl, M., Colbeck, R., Renes, J. M., & Renner, R. (2010) · Nature Physics · doi:10.1038/nphys1734 · Cited by 842
Self-citationThe Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
Research works printed but not linked: 13
- Vern I. Paulsen. Completely bounded maps and operator algebras . Cambridge University Press, 2002.
- wilde, 2013, From Classical to Quantum Shannon Theory
- Paul Dirac. The Principles of Quantum Mechanics (International Series of Monographs on Physics) . Oxford University Press, 1982.
- Albert Einstein: Philosopher-Scientist , chapter Discussions with Einstein on Epistemological Problems in Atomic Physics, page 199. Cambridge University Press, 1949.
- Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, and Andreas Winter. The quantum reverse Shannon theorem. 2009. arXiv:0912.5537v2. · arXiv
- M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information . Cambridge University Press, 2000.
- rényi, 1961, On measures of information and entropy, Proc 4th Berkeley Symp Math Statist Probab, 547
- Alfr´ ed R´ enyi. On measures of information and entropy. Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability , page 547, 1960.
- Mario Berta, Fernando Brandao, Matthias Christandl, and Stephanie Wehner. Entanglement cost of quantum channels. arXiv:1108.5357v2, 2011. · arXiv
- Paul Cuff. Distributed channel synthesis. 2012. arXiv:1208.4415v1. · arXiv
- Alexander S. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel. Problems of Information Transmission , 9:177, 1973.
- N. Ciganovic. Smooth max-mutual information as a generalization of von neumann mutual information for the one-shot setting. Master's thesis, ETH Zurich, 2012.
- Mark M. Wilde. From Classical to Quantum Shannon Theory . June 2011. arXiv:1106.1445. · arXiv
Cited by
Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Wilde, M. M., Winter, A., & Yang, D. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2122-x · Cited by 516
“[5,10,70,73] for different interpretations of the information gain of a quantum measurement).”
BackgroundSelf-citationQuantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
Metadata
- Authors
- Berta, M., Renes, J. M., & Wilde, M. M.
- Affiliations
- California Institute of Technology (US)
- ETH Zurich (CH)
- Louisiana State University (US)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-12
- Volume
- 60
- Issue
- 12
- Pages
- 7987-8006
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2025946841
- Cited by
- 60
- References
- 54
- Citations by year
- 2025: 2 · 2024: 5 · 2023: 4 · 2022: 5 · 2021: 14 · 2020: 2 · 2019: 10 · 2018: 2 · 2017: 1 · 2016: 6 · 2015: 1 · 2014: 4
- FWCI
- 3.99
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- Civil War Book Review (submittedVersion)
- Spiral (Imperial College London) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Swiss National Science Foundation through the National Centre of Competence in Research Quantum Science and Technology
- European Research Council (258932)
- Centre de Recherches Mathématiques
- University of Montréal, Montréal, QC, Canada
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum measurement, quantum mutual information, information gain, shared randomness, classical communication, coherent states, post-selection, entanglement assistance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.