The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
“Squashed entanglement”: An additive entanglement measure
Open accessAbstract
In this paper, we present a new entanglement monotone for bipartite quantum states. Its definition is inspired by the so-called intrinsic information of classical cryptography and is given by the halved minimum quantum conditional mutual information over all tripartite state extensions. We derive certain properties of the new measure which we call “squashed entanglement”: it is a lower bound on entanglement of formation and an upper bound on distillable entanglement. Furthermore, it is convex, additive on tensor products, and superadditive in general. Continuity in the state is the only property of our entanglement measure which we cannot provide a proof for. We present some evidence, however, that our quantity has this property, the strongest indication being a conjectured Fannes-type inequality for the conditional von Neumann entropy. This inequality is proved in the classical case.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
Vedral, V., Plenio, M. B., Rippin, M. A., & Knight, P. L. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2275 · Cited by 2,018
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
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
An operational approach to quantum probability
Davies, E. B., & Lewis, J. T. (1970) · Communications in Mathematical Physics · doi:10.1007/bf01647093 · Cited by 888
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
Colloquium : Area laws for the entanglement entropy
Eisert, J., Cramer, M., & Plenio, M. B. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.277 · Cited by 2,873
Logarithmic Negativity: A Full Entanglement Monotone That is not Convex
Plenio, M. B. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.090503 · Cited by 1,530
Distillation of secret key and entanglement from quantum states
Devetak, I., & Winter, A. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2004.1372 · Cited by 877
Self-citationFundamental rate-loss tradeoff for optical quantum key distribution
Takeoka, M., Guha, S., & Wilde, M. M. (2014) · Nature Communications · doi:10.1038/ncomms6235 · Cited by 456
Entanglement certification from theory to experiment
Friis, N., Vitagliano, G., Malik, M., & Huber, M. (2018) · Nature Reviews Physics · doi:10.1038/s42254-018-0003-5 · Cited by 360
Aspects of Generic Entanglement
Hayden, P., Leung, D. W., & Winter, A. (2006) · Communications in Mathematical Physics · doi:10.1007/s00220-006-1535-6 · Cited by 359
Self-citationEntanglement of purification through holographic duality
Umemoto, K., & Takayanagi, T. (2018) · Nature Physics · doi:10.1038/s41567-018-0075-2 · Cited by 337
Holographic mutual information is monogamous
Hayden, P., Headrick, M., & Maloney, A. (2013) · Physical Review D · doi:10.1103/physrevd.87.046003 · Cited by 326
Extremality of Gaussian Quantum States
Wolf, M. M., Giedke, G., & Cirac, J. I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.080502 · Cited by 318
Computing quantum discord is NP-complete
Huang, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033027 · Cited by 286
Winter, A. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2609-8 · Cited by 281
Self-citationQuantum Conditional Mutual Information and Approximate Markov Chains
Fawzi, O., & Renner, R. (2015) · Communications in Mathematical Physics · doi:10.1007/s00220-015-2466-x · Cited by 268
The Squashed Entanglement of a Quantum Channel
Takeoka, M., Guha, S., & Wilde, M. M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2330313 · Cited by 107
“The first inequality follows from monotonicity of the squashed entanglement under LOCC.”
BackgroundInfluentialThe decoupling approach to quantum information theory
Dupuis, F. (2010) · arXiv · doi:10.48550/arxiv.1004.1641 · Cited by 90
Monogamy of correlations and entropy inequalities in the Bloch picture
Appel, P., Huber, M., & Klöckl, C. (2020) · Journal of Physics Communications · doi:10.1088/2399-6528/ab6fb4 · Cited by 38
Hawking radiation correlations of evaporating black holes in JT gravity
Hollowood, T. J., Kumar, S. P., & Legramandi, A. (2020) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/abbc51 · Cited by 36
Simulating symmetric time evolution with local operations
Toloui, B., & Gour, G. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123026 · Cited by 13
Continuity and additivity properties of information decompositions
Rauh, J., Banerjee, P. K., Olbrich, E., Montúfar, G., & Jost, J. (2023) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2023.108979 · Cited by 7
Metadata
- Authors
- Christandl, M., & Winter, A.
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2004-03-01
- Volume
- 45
- Issue
- 3
- Pages
- 829-840
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2077089904
- Cited by
- 451
- References
- 34
- FWCI
- 10.17
- 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.