Recoverability from direct quantum correlations
From MaRDI portal
Recommendations
- Quantum conditional mutual information and approximate Markov chains
- Necessary criterion for approximate recoverability
- Petz recovery versus matrix reconstruction
- Decay of quantum conditional mutual information for purely generated finitely correlated states
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
Cites work
- scientific article; zbMATH DE number 3241743 (Why is no real title available?)
- A Note on Minimum Discrimination Information
- Approximate quantum Markov chains
- Approximating discrete probability distributions with dependence trees
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Can a quantum state over time resemble a quantum state at a single time?
- Consistency of Local Density Matrices Is QMA-Complete
- Information Theory and Statistical Mechanics
- MONOTONICITY OF QUANTUM RELATIVE ENTROPY REVISITED
- Monotone Riemannian metrics and relative entropy on noncommutative probability spaces
- Operator extension of strong subadditivity of entropy
- Pattern recognition and machine learning.
- Quantum conditional mutual information and approximate Markov chains
- Recoverability in quantum information theory
- Remarks on Kim's strong subadditivity matrix inequality: extensions and equality conditionsa)
- Solving the quantum many-body problem with artificial neural networks
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Sufficient subalgebras and the relative entropy of states of a von Neumann algebra
- Universal recovery map for approximate Markov chains
Cited in
(3)
This page was built for publication: Recoverability from direct quantum correlations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869959)
