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:2501.09708 · Annales Henri Poincaré

Belavkin–Staszewski Quantum Markov Chains

Andreas Blühm, Ángela Capel, Pablo Costa Rico, Anna Jenčová

Published Nov 13, 2025• 1 citation
arXivHTMLPDF

Abstract

Abstract It is well known that the conditional mutual information of a quantum state is zero if, and only if, the quantum state is a quantum Markov chain. Replacing the Umegaki relative entropy in the definition of the conditional mutual information by the Belavkin–Staszewski (BS) relative entropy, we obtain the BS-conditional mutual information, and we call the states with zero BS-conditional mutual information Belavkin–Staszewski quantum Markov chains. In this article, we establish a correspondence which relates quantum Markov chains and BS-quantum Markov chains. This correspondence allows us to find a recovery map for the BS-entropy in the spirit of the Petz recovery map. Furthermore, we show that, over the set of BS-quantum Markov chains, this correspondence constitutes an entanglement-breaking map. Moreover, we prove a structural decomposition of the Belavkin–Staszewski quantum Markov chains and also study states for which the BS-conditional mutual information is only approximately zero. We subsequently extend the aforementioned correspondence, structural decomposition, and recovery map to arbitrary pairs of states and quantum channels. As an application of the correspondence, we find a family of states with non-vanishing conditional mutual information for which it decays superexponentially fast with the size of the middle system.

DOI
10.1007/s00023-025-01644-1

Related papers

Belavkin–Staszewski Relative Entropy, Conditional Entropy, and Mutual Information

Yuan Zhai, Bo Yang, Zhengjun Xi

Belavkin-Staszewski relative entropy can naturally characterize the effects of the possible noncommutativity of quantum states. In this paper, two new conditional entropy terms and four new mutual information terms are first defined by replacing quantum relative entropy with Belavkin-Staszewski relative entropy. Next, their basic properties are investigated, especially in classical-quantum settings. In particular, we show the weak concavity of the Belavkin-Staszewski conditional entropy and obtain the chain rule for the Belavkin-Staszewski mutual information. Finally, the subadditivity of the Belavkin-Staszewski relative entropy is established, i.e., the Belavkin-Staszewski relative entropy of a joint system is less than the sum of that of its corresponding subsystems with the help of some multiplicative and additive factors. Meanwhile, we also provide a certain subadditivity of the geometric Rényi relative entropy.

Entropy•Jun 17, 2022•8 citations

Exact characterizations for quantum conditional mutual information and some other entropies

Zhou Gang

Lieb and Ruskai's strong subadditivity theorem, which shows that the conditional mutual information must be nonnegative, is fundamental in quantum theory. It has numerous applications, such as in quantum error correction. When the mutual information is zero, the Petz recovery map can be used to reconstruct the quantum channel. When the mutual information is small, one seeks to define an optimal recovery channel. To this end, a mathematical characterization of the mutual information is desirable. We address this problem by providing an exact characterization of the mutual information, along with characterizations for other entropies. Our controls are sharp, leaving no room for improvement, in the sense that we provide equalities, regardless of whether the mutual information (or remainder) is small or large. We transform the definitions of these entropies into a summation of explicitly constructed terms, and the definition of each term obviously demonstrates the desired positivity/convexity/concavity. The summation converges rapidly and absolutely in a chosen elementary norm.

quant-pharXiv:2603.14650•Mar 17, 2026•0 citations

Conditional Independence of 1D Gibbs States with Applications to Efficient Learning

Alvaro Martin Alhambra, Ángela Capel, Paul Gondolf +2 more

Abstract We show that spin chains in thermal equilibrium have a correlation structure in which individual regions are strongly correlated at most with their near vicinity. We quantify this with alternative notions of the conditional mutual information, defined through the so-called Belavkin–Staszewski relative entropy. We prove that these measures decay superexponentially at every positive temperature, under the assumption that the spin chain Hamiltonian is translation-invariant. Using a recovery map associated with these measures, we sequentially construct tensor network approximations in terms of marginals of small (sublogarithmic) size. As a main application, we show that classical representations of the states can be learned efficiently from local measurements with a polynomial sample complexity. We also prove an approximate factorization condition for the purity of the entire Gibbs state, which implies that it can be efficiently estimated to a small multiplicative error from a small number of local measurements. The results extend from strictly local to exponentially-decaying interactions above a threshold temperature, albeit only with exponential decay rates. As a technical step of independent interest, we show an upper bound to the decay of the Belavkin–Staszewski relative entropy upon the application of a conditional expectation.

arXiv:2402.18500•Annales Henri Poincaré•May 5, 2026•0 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•0 citations

Log-Euclidean Rényi Conditional Mutual Information

Roberto Rubboli, Amir Arqand, Mark M. Wilde

Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit $α\to 1$. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.

quant-pharXiv:2609.34699•Sep 29, 2026•0 citations

Decay of quantum conditional mutual information for purely generated finitely correlated states

Pavel Svetlichnyy, T. A. B. Kennedy

The connection between quantum state recovery and quantum conditional mutual information (QCMI) is studied for the class of purely generated finitely correlated states (pgFCSs) of one-dimensional quantum spin chains. For a tripartition of the chain into two subsystems separated by a buffer region, it is shown that a pgFCS is an approximate quantum Markov chain (QMC) and, stronger, may be approximated by a quantum Markov chain in trace distance, with an error exponentially small in the buffer size. This implies that (1) a locally corrupted state can be approximately recovered by action of a quantum channel on the buffer system, and (2) QCMI is exponentially small in the size of the buffer region. Bounds on the exponential decay rate of QCMI and examples of quantum recovery channels are presented.

arXiv:2210.09387•Journal of Mathematical Physics•Jul 1, 2022•8 citations
Abstract It is well known that the conditional mutual information of a quantum state is zero if, and only if, the quantum state is a quantum Markov chain. Replacing the Umegaki relative entropy in the definition of the conditional mutual information by the Belavkin–Staszewski (BS) relative entropy, we obtain the BS-conditional mutual information, and we call the states with zero BS-conditional mutual information Belavkin–Staszewski quantum Markov chains. In this article, we establish a correspondence which relates quantum Markov chains and BS-quantum Markov chains. This correspondence allows us to find a recovery map for the BS-entropy in the spirit of the Petz recovery map. Furthermore, we show that, over the set of BS-quantum Markov chains, this correspondence constitutes an entanglement-breaking map. Moreover, we prove a structural decomposition of the Belavkin–Staszewski quantum Markov chains and also study states for which the BS-conditional mutual information is only approximately zero. We subsequently extend the aforementioned correspondence, structural decomposition, and recovery map to arbitrary pairs of states and quantum channels. As an application of the correspondence, we find a family of states with non-vanishing conditional mutual information for which it decays superexponentially fast with the size of the middle system.
Belavkin-Staszewski relative entropy can naturally characterize the effects of the possible noncommutativity of quantum states. In this paper, two new conditional entropy terms and four new mutual information terms are first defined by replacing quantum relative entropy with Belavkin-Staszewski relative entropy. Next, their basic properties are investigated, especially in classical-quantum settings. In particular, we show the weak concavity of the Belavkin-Staszewski conditional entropy and obtain the chain rule for the Belavkin-Staszewski mutual information. Finally, the subadditivity of the Belavkin-Staszewski relative entropy is established, i.e., the Belavkin-Staszewski relative entropy of a joint system is less than the sum of that of its corresponding subsystems with the help of some multiplicative and additive factors. Meanwhile, we also provide a certain subadditivity of the geometric Rényi relative entropy.
Lieb and Ruskai's strong subadditivity theorem, which shows that the conditional mutual information must be nonnegative, is fundamental in quantum theory. It has numerous applications, such as in quantum error correction. When the mutual information is zero, the Petz recovery map can be used to reconstruct the quantum channel. When the mutual information is small, one seeks to define an optimal recovery channel. To this end, a mathematical characterization of the mutual information is desirable. We address this problem by providing an exact characterization of the mutual information, along with characterizations for other entropies. Our controls are sharp, leaving no room for improvement, in the sense that we provide equalities, regardless of whether the mutual information (or remainder) is small or large. We transform the definitions of these entropies into a summation of explicitly constructed terms, and the definition of each term obviously demonstrates the desired positivity/convexity/concavity. The summation converges rapidly and absolutely in a chosen elementary norm.
Abstract We show that spin chains in thermal equilibrium have a correlation structure in which individual regions are strongly correlated at most with their near vicinity. We quantify this with alternative notions of the conditional mutual information, defined through the so-called Belavkin–Staszewski relative entropy. We prove that these measures decay superexponentially at every positive temperature, under the assumption that the spin chain Hamiltonian is translation-invariant. Using a recovery map associated with these measures, we sequentially construct tensor network approximations in terms of marginals of small (sublogarithmic) size. As a main application, we show that classical representations of the states can be learned efficiently from local measurements with a polynomial sample complexity. We also prove an approximate factorization condition for the purity of the entire Gibbs state, which implies that it can be efficiently estimated to a small multiplicative error from a small number of local measurements. The results extend from strictly local to exponentially-decaying interactions above a threshold temperature, albeit only with exponential decay rates. As a technical step of independent interest, we show an upper bound to the decay of the Belavkin–Staszewski relative entropy upon the application of a conditional expectation.
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.
Quantum conditional mutual information (QCMI) is a fundamental measure of conditional independence, with central applications throughout quantum information theory and many-body physics. Despite its importance, finding a fully quantum Rényi generalization that satisfies all desirable structural properties has remained an open question. In this work, we introduce a quantum Rényi conditional mutual information possessing these desirable properties: it is monotone under local quantum channels, additive under tensor products, monotone in the Rényi parameter, and converges to the QCMI in the limit α→1α\to 1α→1. We establish bounds on this quantity in terms of relative entropies to the Petz-recovered state, showing that it provides a distinct measure of approximate conditional independence. As a consequence, we derive recovery-based upper and lower bounds on the QCMI in terms of quantum generalizations of the Kullback-Leibler divergence, improving upon the best known results in certain regimes. Finally, we establish bounds in terms of relative entropies to the sets of Markov and separable states and derive Rényi chain rules, which appear to be novel even in the classical setting.
The connection between quantum state recovery and quantum conditional mutual information (QCMI) is studied for the class of purely generated finitely correlated states (pgFCSs) of one-dimensional quantum spin chains. For a tripartition of the chain into two subsystems separated by a buffer region, it is shown that a pgFCS is an approximate quantum Markov chain (QMC) and, stronger, may be approximated by a quantum Markov chain in trace distance, with an error exponentially small in the buffer size. This implies that (1) a locally corrupted state can be approximately recovered by action of a quantum channel on the buffer system, and (2) QCMI is exponentially small in the size of the buffer region. Bounds on the exponential decay rate of QCMI and examples of quantum recovery channels are presented.