Universal recovery map for approximate Markov chains
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
A central question in quantum information theory is to determine how well lost information can be reconstructed. Crucially, the corresponding recovery operation should perform well without knowing the information to be reconstructed. In this work, we show that the quantum conditional mutual information measures the performance of such recovery operations. More precisely, we prove that the conditional mutual information I(A:C|B) of a tripartite quantum state ρABCcan be bounded from below by its distance to the closest recovered state RB→BC(ρAB), where the C-part is reconstructed from the B-part only and the recovery map RB→BC merely depends on ρBC. One particular application of this result implies the equivalence between two different approaches to define topological order in quantum systems.
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
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911 · cited 4×
“5 in the electronic supplementary material), the continuity of the fidelity [12,13] implies that ρABC → F(ρABC,RB→BC(ρAB)) is continuous, which then establishes property (iii).”
InfluentialThe ‘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
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
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
Wilde, M. M., Winter, A., & Yang, D. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2122-x · Cited by 516 · cited 1×
“Let Dα(·||·) be the α-Quantum Rényi Divergence as defined in [22, 33] with D1(ρ||σ) = D(ρ||σ) := tr(ρ(log ρ− log σ)).”
Structure 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
Sufficient subalgebras and the relative entropy of states of a von Neumann algebra
Petz, D. (1986) · Communications in Mathematical Physics · doi:10.1007/bf01212345 · Cited by 333
Reversing quantum dynamics with near-optimal quantum and classical fidelity
Barnum, H., & Knill, E. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1459754 · Cited by 280 · cited 3×
“F The transpose map is not square-root optimal As discussed in Section 6, for pure states ρABC it is known [2] that F (A;C|B)ρ ≤ √”
InfluentialSUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS
PETZ, D. (1988) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/39.1.97 · Cited by 246
MONOTONICITY OF QUANTUM RELATIVE ENTROPY REVISITED
PETZ, D. (2003) · Reviews in Mathematical Physics · doi:10.1142/s0129055x03001576 · Cited by 164 · cited 3×
“(1) An equivalent characterization of ρABC being a Markov chain is that the conditional mutual information I(A : C|B)ρ := H(AB)ρ + H(BC)ρ − H(B)ρ − H(ABC)ρ is zero [21, 24, 25] where H(A)ρ := −tr(ρA log2 ρA) is the von Neumann entropy.”
Cited by
The entropy of bulk quantum fields and the entanglement wedge of an evaporating black hole
Almheiri, A., Engelhardt, N., Marolf, D., & Maxfield, H. (2019) · Journal of High Energy Physics · doi:10.1007/jhep12(2019)063 · Cited by 818
Universal Recovery Maps and Approximate Sufficiency of Quantum Relative Entropy
Junge, M., Renner, R., Sutter, D., Wilde, M. M., & Winter, A. (2018) · Annales Henri Poincaré · doi:10.1007/s00023-018-0716-0 · Cited by 118
Self-citationCode Properties from Holographic Geometries
Pastawski, F., & Preskill, J. (2017) · Physical Review X · doi:10.1103/physrevx.7.021022 · Cited by 52
“(65), and its approximate version [36], is stated in terms of von Neumann entanglement entropies.”
Background
Metadata
- Authors
- Sutter, D., Fawzi, O., & Renner, R.
- Venue
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2016-02
- Volume
- 472
- Issue
- 2186
- Pages
- 20150623
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W1914854949
- Cited by
- 56
- References
- 10
- FWCI
- 8.58
- Type
- journal article
- Language
- en
- Open access
- bronze
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.