Quantum State Merging and Negative Information
Open accessThe DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Abstract
We consider a quantum state shared between many distant locations, and define a quantum information processing primitive, state merging, that optimally merges the state into one location. As announced in [Horodecki, Oppenheim, Winter, Nature 436, 673 (2005)], the optimal entanglement cost of this task is the conditional entropy if classical communication is free. Since this quantity can be negative, and the state merging rate measures partial quantum information, we find that quantum information can be negative. The classical communication rate also has a minimum rate: a certain quantum mutual information. State merging enabled one to solve a number of open problems: distributed quantum data compression, quantum coding with side information at the decoder and sender, multi-party entanglement of assistance, and the capacity of the quantum multiple access channel. It also provides an operational proof of strong subadditivity. Here, we give precise definitions and prove these results rigorously.
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.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Werner, R. F. (1989) · Physical Review A · doi:10.1103/physreva.40.4277 · Cited by 4,062
Concentrating partial entanglement by local operations
Bennett, C. H., Bernstein, H. J., Popescu, S., & Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.53.2046 · Cited by 3,111
Wehrl, A. (1978) · Reviews of Modern Physics · doi:10.1103/revmodphys.50.221 · Cited by 1,963
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911
The ‘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
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Self-citationColloquium: Quantum coherence as a resource
Streltsov, A., Adesso, G., & Plenio, M. B. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.041003 · Cited by 1,794
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
“Horodecki (2000), who referred to it as the Schmidt number of a density operator (as it generalizes the number of nonzero terms in a Schmidt decomposition of the vector representation of a given pure state). They also proved that the entanglement rank of a state cannot increase under the action of an LOCC channel, bas…”
InfluentialEntropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Holographic duality from random tensor networks
Hayden, P., Nezami, S., Qi, X.-L., Thomas, N., Walter, M., & Yang, Z. (2016) · Journal of High Energy Physics · doi:10.1007/jhep11(2016)009 · Cited by 599
“) While the original proof of the multipartite entanglement of assistance formula used classically-inspired random coding information theory techniques, subsequent proofs proceeded by performing appropriate isotropic measurements of the C subsystems [40, 49].”
MethodQuantum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition
Choi, S., Bao, Y., Qi, X.-L., & Altman, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.030505 · Cited by 435
Measures and applications of quantum correlations
Adesso, G., Bromley, T. R., & Cianciaruso, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/47/473001 · Cited by 385
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Computing quantum discord is NP-complete
Huang, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033027 · Cited by 286
A Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
Self-citationThe decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Leading order corrections to the quantum extremal surface prescription
Akers, C., & Penington, G. (2020) · arXiv · doi:10.48550/arxiv.2008.03319 · Cited by 86
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
Hsieh, M.-H., & Wilde, M. M. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054532 · Cited by 68
Identifying the Information Gain of a Quantum Measurement
Berta, M., Renes, J. M., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2365207 · Cited by 60
The information theoretic interpretation of the length of a curve
Czech, B., Hayden, P., Lashkari, N., & Swingle, B. (2015) · Journal of High Energy Physics · doi:10.1007/jhep06(2015)157 · Cited by 45
Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit
Hayden, P., & Penington, G. (2020) · Communications in Mathematical Physics · doi:10.1007/s00220-020-03689-1 · Cited by 40
Weak Decoupling Duality and Quantum Identification
Hayden, P., & Winter, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191695 · Cited by 36
Self-citation
Metadata
- Authors
- Horodecki, M., Oppenheim, J., & Winter, A.
- Venue
- Communications in Mathematical Physics
- Published
- 2006-10-21
- Volume
- 269
- Issue
- 1
- Pages
- 107-136
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2005952170
- Cited by
- 269
- References
- 33
- FWCI
- 4.98
- Type
- journal article
- Language
- en
- Open access
- green
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.