Faithful Squashed Entanglement
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, it is strictly positive if and only if the state is entangled.We derive the lower bound on squashed entanglement from a lower bound on the quantum conditional mutual information which is used to define squashed entanglement. The quantum conditional mutual information corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof is based on two recent results from quantum information theory: the operational interpretation of the quantum mutual information as the optimal rate for state redistribution and the interpretation of the regularised relative entropy of entanglement as an error exponent in hypothesis testing.The distance to the set of separable states is measured in terms of the LOCC norm, an operationally motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shared by two parties, using any protocol formed by local quantum operations and classical communication (LOCC) between the parties. A similar result for the Frobenius or Euclidean norm follows as an immediate consequence.The result has two applications in complexity theory. The first application is a quasipolynomial-time algorithm solving the weak membership problem for the set of separable states in LOCC or Euclidean norm. The second application concerns quantum Merlin-Arthur games. Here we show that multiple provers are not more powerful than a single prover when the verifier is restricted to LOCC operations thereby providing a new characterisation of the complexity class QMA.
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
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
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
Separability of mixed states: necessary and sufficient conditions
Horodecki, M., Horodecki, P., & Horodecki, R. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00706-2 · Cited by 3,649
Coffman, V., Kundu, J., & Wootters, W. K. (2000) · Physical Review A · doi:10.1103/physreva.61.052306 · Cited by 2,619
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
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
Entanglement measures and purification procedures
Vedral, V., & Plenio, M. B. (1998) · Physical Review A · doi:10.1103/physreva.57.1619 · Cited by 1,419 · cited 1×
“A measure that plays a fundamental role in the proof is the regularised relative entropy of entanglement [ 24 ,34], defined as”
BackgroundMixed-state entanglement and distillation: Is there a ‘bound’ entanglement in nature?
Horodecki, M., Horodecki, P., & Horodecki, R. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.5239 · Cited by 1,208
Proof of the strong subadditivity of quantum-mechanical entropy
Lieb, E. H., & Ruskai, M. B. (1973) · Journal of Mathematical Physics · doi:10.1063/1.1666274 · Cited by 831 · cited 2×
“This measure is also always non-negative, as a consequence of the celebrated strong subadditivity inequality for the von Neumann entropy proved by Lieb and Ruskai [ 2 ].”
BackgroundOhya, M., & Petz, D. (1993) · doi:10.1007/978-3-642-57997-4 · Cited by 764
Monogamy of quantum entanglement and other correlations
Koashi, M., & Winter, A. (2004) · Physical Review A · doi:10.1103/physreva.69.022309 · Cited by 609 · cited 3×
“The key point in the proof of Corollary 2 is the fact that squashed entanglement satisfies the so-called monogamy inequality [ 11 ], namely”
BackgroundInfluentialStructure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality
Hayden, P., Jozsa, R., Petz, D., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1049-z · Cited by 429
Entanglement theory and the second law of thermodynamics
Brandão, F. G. S. L., & Plenio, M. B. (2008) · Nature Physics · doi:10.1038/nphys1100 · Cited by 189
Self-citation
Cited by
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
Fundamental 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 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
“Moreover, it was recently shown using an ingenious argument that Esq is always strictly positive for entangled states [37].”
BackgroundComputing quantum discord is NP-complete
Huang, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033027 · Cited by 286
Metadata
- Authors
- Brandão, F. G. S. L., Christandl, M., & Yard, J.
- Venue
- Communications in Mathematical Physics
- Published
- 2011-08-02
- Volume
- 306
- Issue
- 3
- Pages
- 805-830
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W1968165454
- Cited by
- 200
- References
- 13
- FWCI
- 12.12
- 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.