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

IEEE International Symposium on Information Theory (ISIT)

Quantum Markov chains and logarithmic trace inequalities

David Sutter, Mario Berta, Marco Tomamichel

Published Jun 1, 2017• 5 citations
Publisher

Abstract

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.

DOI
10.1109/isit.2017.8006877

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

Necessary Criterion for Approximate Recoverability

David Sutter, Renato Renner

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.

arXiv:1705.06749•Annales Henri Poincaré•Aug 4, 2018•14 citations

Quantum Markov chains, sufficiency of quantum channels, and Rényi information measures

Nilanjana Datta, Mark M. Wilde

Abstract A short quantum Markov chain is a tripartite state such that system A can be recovered perfectly by acting on system C of the reduced state Such states have conditional mutual information equal to zero and are the only states with this property. A quantum channel is sufficient for two states ρ and σ if there exists a recovery channel using which one can perfectly recover ρ from and σ from The relative entropy difference is equal to zero if and only if is sufficient for ρ and σ . In this paper, we show that these properties extend to Rényi generalizations of these information measures which were proposed in (Berta et al 2015 J. Math. Phys. 56 022205 ; Seshadreesan et al 2015 J. Phys. A: Math. Theor. 48 395303 ), thus providing an alternate characterization of short quantum Markov chains and sufficient quantum channels. These results give further support to these quantities as being legitimate Rényi generalizations of the conditional mutual information and the relative entropy difference. Along the way, we solve some open questions of Ruskai and Zhang, regarding the trace of particular matrices that arise in the study of monotonicity of relative entropy under quantum operations and strong subadditivity of the von Neumann entropy.

arXiv:1501.05636•Journal of Physics A Mathematical and Theoretical•Nov 19, 2015•23 citations

Multivariate Trace Inequalities

David Sutter, Mario Berta, Marco Tomamichel

We prove several trace inequalities that extend the Golden–Thompson and the Araki–Lieb–Thirring inequality to arbitrarily many matrices. In particular, we strengthen Lieb’s triple matrix inequality. As an example application of our four matrix extension of the Golden–Thompson inequality, we prove remainder terms for the monotonicity of the quantum relative entropy and strong sub-additivity of the von Neumann entropy in terms of recoverability. We find the first explicit remainder terms that are tight in the commutative case. Our proofs rely on complex interpolation theory as well as asymptotic spectral pinching, providing a transparent approach to treat generic multivariate trace inequalities.

arXiv:1604.03023•Communications in Mathematical Physics•Oct 18, 2016•120 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

Optimal Tomography of Quantum Markov Chains via Continuity of Petz Recovery States

Li Gao, Nengkun Yu

In this work, we show that the Petz recovered state ρ1/2BC(ρ−1/2BρABρ−1/2B⊗IC)ρ1/2BCis continuous regarding its marginals ρABand ρBC. In terms of infidelity 1 −F(ρ, σ) = 1 − tr | √ ρ √ σ| and trace norm ∥ ρ − σ ∥1= tr(|ρ − σ|), we obtain the following dimension-independent estimate 1 −F(ρAB, σAB) ≤ δ, 1 −F(ρBC, σBC) ≤ δ =⇒ 1 −F(ρABC, σABC) ≤ 18δ, ∥ ρAB− σAB∥1≤ ε, ∥ ρBC− σBC∥1≤ ε =⇒∥ ρABC− σABC∥≤ ε + 4ε1/2. As applications, we obtain the following applications in tomography of quantum Markov chains: • The sample complexity of quantum Markov chain tomography, i.e., how many copies of an unknown quantum Markov chain are necessary and sufficient to determine the state, is ˜Θ ((d2A+d2C)d2B/δ), and ˜Θ((d2A+d2C)d2B/ϵ2), where δ denotes infidelity error and ϵ denotes trace distance. • The sample complexity of quantum Markov chain certification, i.e., to certify whether a tripartite state equals a given quantum Markov chain σABCor at least δ-far from σABC, is Θ((dA+dC)dB/δ), and Θ((dA+dC)dB/ϵ2). • Õ(mindAd3Bd3C,d3Ad3BdC/ϵ2) copies of sample are sufficient to certify whether ρABCis a quantum Markov chain or ϵ-far from its Petz recovered state in trace distance. This implies that full state tomography is not always necessary for testing whether ρABCis a quantum Markov chain (equals to its Petz recovered state) or not.

arXiv:2209.02240•IEEE Transactions on Information Theory•Jul 1, 2025•3 citations
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.
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 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.
Abstract A short quantum Markov chain is a tripartite state such that system A can be recovered perfectly by acting on system C of the reduced state Such states have conditional mutual information equal to zero and are the only states with this property. A quantum channel is sufficient for two states ρ and σ if there exists a recovery channel using which one can perfectly recover ρ from and σ from The relative entropy difference is equal to zero if and only if is sufficient for ρ and σ . In this paper, we show that these properties extend to Rényi generalizations of these information measures which were proposed in (Berta et al 2015 J. Math. Phys. 56 022205 ; Seshadreesan et al 2015 J. Phys. A: Math. Theor. 48 395303 ), thus providing an alternate characterization of short quantum Markov chains and sufficient quantum channels. These results give further support to these quantities as being legitimate Rényi generalizations of the conditional mutual information and the relative entropy difference. Along the way, we solve some open questions of Ruskai and Zhang, regarding the trace of particular matrices that arise in the study of monotonicity of relative entropy under quantum operations and strong subadditivity of the von Neumann entropy.
We prove several trace inequalities that extend the Golden–Thompson and the Araki–Lieb–Thirring inequality to arbitrarily many matrices. In particular, we strengthen Lieb’s triple matrix inequality. As an example application of our four matrix extension of the Golden–Thompson inequality, we prove remainder terms for the monotonicity of the quantum relative entropy and strong sub-additivity of the von Neumann entropy in terms of recoverability. We find the first explicit remainder terms that are tight in the commutative case. Our proofs rely on complex interpolation theory as well as asymptotic spectral pinching, providing a transparent approach to treat generic multivariate trace inequalities.
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.
In this work, we show that the Petz recovered state ρ1/2BC(ρ−1/2BρABρ−1/2B⊗IC)ρ1/2BCis continuous regarding its marginals ρABand ρBC. In terms of infidelity 1 −F(ρ, σ) = 1 − tr | √ ρ √ σ| and trace norm ∥ ρ − σ ∥1= tr(|ρ − σ|), we obtain the following dimension-independent estimate 1 −F(ρAB, σAB) ≤ δ, 1 −F(ρBC, σBC) ≤ δ =⇒ 1 −F(ρABC, σABC) ≤ 18δ, ∥ ρAB− σAB∥1≤ ε, ∥ ρBC− σBC∥1≤ ε =⇒∥ ρABC− σABC∥≤ ε + 4ε1/2. As applications, we obtain the following applications in tomography of quantum Markov chains: • The sample complexity of quantum Markov chain tomography, i.e., how many copies of an unknown quantum Markov chain are necessary and sufficient to determine the state, is ˜Θ ((d2A+d2C)d2B/δ), and ˜Θ((d2A+d2C)d2B/ϵ2), where δ denotes infidelity error and ϵ denotes trace distance. • The sample complexity of quantum Markov chain certification, i.e., to certify whether a tripartite state equals a given quantum Markov chain σABCor at least δ-far from σABC, is Θ((dA+dC)dB/δ), and Θ((dA+dC)dB/ϵ2). • Õ(mindAd3Bd3C,d3Ad3BdC/ϵ2) copies of sample are sufficient to certify whether ρABCis a quantum Markov chain or ϵ-far from its Petz recovered state in trace distance. This implies that full state tomography is not always necessary for testing whether ρABCis a quantum Markov chain (equals to its Petz recovered state) or not.