Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1705.06749 · Annales Henri Poincaré

Necessary Criterion for Approximate Recoverability

David Sutter, Renato Renner

Published Aug 4, 2018• 14 citations
arXivHTMLPDF

Abstract

A tripartite state $$\rho _{ABC}$$ forms a Markov chain if there exists a recovery map $$\mathcal {R}_{B \rightarrow BC}$$ acting only on the B-part that perfectly reconstructs $$\rho _{ABC}$$ from $$\rho _{AB}$$ . To achieve an approximate reconstruction, it suffices that the conditional mutual information $$I(A:C|B)_{\rho }$$ is small, as shown recently. Here we ask what conditions are necessary for approximate state reconstruction. This is answered by a lower bound on the relative entropy between $$\rho _{ABC}$$ and the recovered state $$\mathcal {R}_{B\rightarrow BC}(\rho _{AB})$$ . The bound consists of the conditional mutual information and an entropic correction term that quantifies the disturbance of the B-part by the recovery map.

DOI
10.1007/s00023-018-0715-1

Related papers

Universal recovery map for approximate Markov chains

David Sutter, Omar Fawzi, Renato Renner

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 ρ ABC can be bounded from below by its distance to the closest recovered state R B → B C ( ρ A B ) , where the C -part is reconstructed from the B -part only and the recovery map R B → B C merely depends on ρ BC . One particular application of this result implies the equivalence between two different approaches to define topological order in quantum systems.

arXiv:1504.07251•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Feb 1, 2016•82 citations

Quantum Conditional Mutual Information and Approximate Markov Chains

Omar Fawzi, Renato Renner

A state on a tripartite quantum system $${A \otimes B \otimes C}$$ forms a Markov chain if it can be reconstructed from its marginal on $${A \otimes B}$$ by a quantum operation from B to $${B \otimes C}$$ . We show that the quantum conditional mutual information I(A : C|B) of an arbitrary state is an upper bound on its distance to the closest reconstructed state. It thus quantifies how well the Markov chain property is approximated.

arXiv:1410.0664•Communications in Mathematical Physics•Sep 9, 2015•297 citations

Note on Strong Quantum Markov Properties

Chi-Fang Chen

Quantum many-body Gibbs states satisfy an approximate local Markov property~\cite{chen2025GibbsMarkov}: local noise can be approximately recovered by a quasi-local recovery map, and the conditional mutual information decays for the corresponding tripartition. Recent work~\cite{bergamaschi2025structural} extends this property to approximate stationary states (metastable states) of certain master equations modeling system--bath dynamics, and proposes a strengthened post-selected recovery property requiring recovery to hold for each measurement outcome. In this note, we characterize this \textit{strong Markov property}: it holds if and only if the state additionally satisfies correlation decay for suitable pairs of observables. We further prove several structural and operational consequences of the strong Markov property in the presence of an underlying master equation. First, one can estimate multiple observables from a \textit{single copy} of the state via a repeated measurement--recovery protocol. Second, any two strongly Markov states must have local marginals that are either very close or well separated. Third, if a strongly Markov state can be expressed as a mixture of two strongly Markov states, then their local marginals must be nearly indistinguishable.

quant-pharXiv:2605.02877•May 5, 2026•3 citations

Quantum Markov chains and logarithmic trace inequalities

David Sutter, Mario Berta, Marco Tomamichel

A Markov chain is a tripartite quantum state ρABCwhere there exists a recovery map RB→BCsuch that ρABC= RB→BC(ρAB). More generally, an approximate Markov chain ρABCis a state whose distance to the closest recovered state RB→BC(ρAB) is small. Recently it has been shown that this distance can be bounded from above by the conditional mutual information I(A : C|B)ρof the state. We improve on this connection by deriving the first bound that is tight in the commutative case and features an explicit recovery map that only depends on the reduced state pBC. The key tool in our proof is a multivariate extension of the Golden-Thompson inequality, which allows us to extend logarithmic trace inequalities from two to arbitrarily many matrices.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•5 citations

Universal Recovery Maps and Approximate Sufficiency of Quantum Relative Entropy

Marius Junge, Renato Renner, David Sutter +2 more

The data processing inequality states that the quantum relative entropy between two states $$\rho $$ and $$\sigma $$ can never increase by applying the same quantum channel $$\mathcal {N}$$ to both states. This inequality can be strengthened with a remainder term in the form of a distance between $$\rho $$ and the closest recovered state $$(\mathcal {R} \circ \mathcal {N})(\rho )$$ , where $$\mathcal {R}$$ is a recovery map with the property that $$\sigma = (\mathcal {R} \circ \mathcal {N})(\sigma )$$ . We show the existence of an explicit recovery map that is universal in the sense that it depends only on $$\sigma $$ and the quantum channel $$\mathcal {N}$$ to be reversed. This result gives an alternate, information-theoretic characterization of the conditions for approximate quantum error correction.

arXiv:1509.07127•Annales Henri Poincaré•Aug 6, 2018•207 citations

Robustness of Fixed Points of Quantum Channels and Application to Approximate Quantum Markov Chains

Salzmann, Robert, Bjarne Bergh, Nilanjana Datta

Given a quantum channel and a state which satisfy a fixed point equation approximately (say, up to an error $\varepsilon$), can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? It is interesting to ask this question for different choices of constraints on the structures of the original channel and state, and requiring that these are also satisfied by the new channel and state. We affirmatively answer the above question, under fairly general assumptions on these structures, through a compactness argument. Additionally, for channels and states satisfying certain specific structures, we find explicit upper bounds on the distances between the pairs of channels (and states) in question. When these distances decay quickly (in a particular, desirable manner) as $\varepsilon\to 0$, we say that the original approximate fixed point equation is rapidly fixable. We establish rapid fixability, not only for general quantum channels, but also when the original and new channels are both required to be unitary, mixed unitary or unital. In contrast, for the case of bipartite quantum systems with channels acting trivially on one subsystem, we prove that approximate fixed point equations are not rapidly fixable. In this case, the distance to the closest channel (and state) which satisfy an exact fixed point equation can depend on the dimension of the quantum system in an undesirable way. We apply our results on approximate fixed point equations to the question of robustness of quantum Markov chains (QMC) and establish the following: For any tripartite quantum state, there exists a dimension-dependent upper bound on its distance to the set of QMCs, which decays to zero as the conditional mutual information of the state vanishes.

arXiv:2405.01532•May 2, 2024•2 citations
A tripartite state ρABC\rho _{ABC}ρABC​ forms a Markov chain if there exists a recovery map RB→BC\mathcal {R}_{B \rightarrow BC}RB→BC​ acting only on the B-part that perfectly reconstructs ρABC\rho _{ABC}ρABC​ from ρAB\rho _{AB}ρAB​ . To achieve an approximate reconstruction, it suffices that the conditional mutual information I(A:C∣B)ρI(A:C|B)_{\rho }I(A:C∣B)ρ​ is small, as shown recently. Here we ask what conditions are necessary for approximate state reconstruction. This is answered by a lower bound on the relative entropy between ρABC\rho _{ABC}ρABC​ and the recovered state RB→BC(ρAB)\mathcal {R}_{B\rightarrow BC}(\rho _{AB})RB→BC​(ρAB​) . The bound consists of the conditional mutual information and an entropic correction term that quantifies the disturbance of the B-part by the recovery map.
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 ρ ABC can be bounded from below by its distance to the closest recovered state R B → B C ( ρ A B ) , where the C -part is reconstructed from the B -part only and the recovery map R B → B C merely depends on ρ BC . One particular application of this result implies the equivalence between two different approaches to define topological order in quantum systems.
A state on a tripartite quantum system A⊗B⊗C{A \otimes B \otimes C}A⊗B⊗C forms a Markov chain if it can be reconstructed from its marginal on A⊗B{A \otimes B}A⊗B by a quantum operation from B to B⊗C{B \otimes C}B⊗C . We show that the quantum conditional mutual information I(A : C|B) of an arbitrary state is an upper bound on its distance to the closest reconstructed state. It thus quantifies how well the Markov chain property is approximated.
Quantum many-body Gibbs states satisfy an approximate local Markov property~\cite{chen2025GibbsMarkov}: local noise can be approximately recovered by a quasi-local recovery map, and the conditional mutual information decays for the corresponding tripartition. Recent work~\cite{bergamaschi2025structural} extends this property to approximate stationary states (metastable states) of certain master equations modeling system--bath dynamics, and proposes a strengthened post-selected recovery property requiring recovery to hold for each measurement outcome. In this note, we characterize this \textit{strong Markov property}: it holds if and only if the state additionally satisfies correlation decay for suitable pairs of observables. We further prove several structural and operational consequences of the strong Markov property in the presence of an underlying master equation. First, one can estimate multiple observables from a \textit{single copy} of the state via a repeated measurement--recovery protocol. Second, any two strongly Markov states must have local marginals that are either very close or well separated. Third, if a strongly Markov state can be expressed as a mixture of two strongly Markov states, then their local marginals must be nearly indistinguishable.
A Markov chain is a tripartite quantum state ρABCwhere there exists a recovery map RB→BCsuch that ρABC= RB→BC(ρAB). More generally, an approximate Markov chain ρABCis a state whose distance to the closest recovered state RB→BC(ρAB) is small. Recently it has been shown that this distance can be bounded from above by the conditional mutual information I(A : C|B)ρof the state. We improve on this connection by deriving the first bound that is tight in the commutative case and features an explicit recovery map that only depends on the reduced state pBC. The key tool in our proof is a multivariate extension of the Golden-Thompson inequality, which allows us to extend logarithmic trace inequalities from two to arbitrarily many matrices.
The data processing inequality states that the quantum relative entropy between two states ρ\rho ρ and σ\sigma σ can never increase by applying the same quantum channel N\mathcal {N}N to both states. This inequality can be strengthened with a remainder term in the form of a distance between ρ\rho ρ and the closest recovered state (R∘N)(ρ)(\mathcal {R} \circ \mathcal {N})(\rho )(R∘N)(ρ) , where R\mathcal {R}R is a recovery map with the property that σ=(R∘N)(σ)\sigma = (\mathcal {R} \circ \mathcal {N})(\sigma )σ=(R∘N)(σ) . We show the existence of an explicit recovery map that is universal in the sense that it depends only on σ\sigma σ and the quantum channel N\mathcal {N}N to be reversed. This result gives an alternate, information-theoretic characterization of the conditions for approximate quantum error correction.
Given a quantum channel and a state which satisfy a fixed point equation approximately (say, up to an error ε\varepsilonε), can one find a new channel and a state, which are respectively close to the original ones, such that they satisfy an exact fixed point equation? It is interesting to ask this question for different choices of constraints on the structures of the original channel and state, and requiring that these are also satisfied by the new channel and state. We affirmatively answer the above question, under fairly general assumptions on these structures, through a compactness argument. Additionally, for channels and states satisfying certain specific structures, we find explicit upper bounds on the distances between the pairs of channels (and states) in question. When these distances decay quickly (in a particular, desirable manner) as ε→0\varepsilon\to 0ε→0, we say that the original approximate fixed point equation is rapidly fixable. We establish rapid fixability, not only for general quantum channels, but also when the original and new channels are both required to be unitary, mixed unitary or unital. In contrast, for the case of bipartite quantum systems with channels acting trivially on one subsystem, we prove that approximate fixed point equations are not rapidly fixable. In this case, the distance to the closest channel (and state) which satisfy an exact fixed point equation can depend on the dimension of the quantum system in an undesirable way. We apply our results on approximate fixed point equations to the question of robustness of quantum Markov chains (QMC) and establish the following: For any tripartite quantum state, there exists a dimension-dependent upper bound on its distance to the set of QMCs, which decays to zero as the conditional mutual information of the state vanishes.