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• 5 citations
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

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

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 proper entropies and additive capacities of quantum information channels

V. P. Belavkin

An elementary algebraic approach to unified quantum information theory is given. The operational meaning of entanglement as specifically quantum encoding is disclosed. General relative entropy as information divergence is introduced, and three most important types of relative information, namely, the Araki-Umegaki type (A-type), the Belavkin-Staszewski type (B-type), and the thermodynamical (C-type) are discussed. It is shown that true quantum entanglement-assisted entropy is greater than semiclassical (von Neumann) quantum entropy, and the proper positive quantum conditional entropy is introduced. The general quantum mutual information via entanglement is defined, and the corresponding types of quantum channel capacities as a supremum via the generalized encodings are formulated. The additivity problem for quantum logarithmic capacities for products of arbitrary quantum channels under appropriate constraints on encodings is discussed. It is proved that true quantum capacity, which is achieved on the standard entanglement as an optimal quantum encoding, retains the additivity property of the logarithmic quantum channel entanglement-assisted capacities on the products of quantum input states. This result for quantum logarithmic information of A-type, which was obtained earlier by the author, is extended to any type of quantum information.

Mathematical Notes•Feb 1, 2011•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 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.
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.
An elementary algebraic approach to unified quantum information theory is given. The operational meaning of entanglement as specifically quantum encoding is disclosed. General relative entropy as information divergence is introduced, and three most important types of relative information, namely, the Araki-Umegaki type (A-type), the Belavkin-Staszewski type (B-type), and the thermodynamical (C-type) are discussed. It is shown that true quantum entanglement-assisted entropy is greater than semiclassical (von Neumann) quantum entropy, and the proper positive quantum conditional entropy is introduced. The general quantum mutual information via entanglement is defined, and the corresponding types of quantum channel capacities as a supremum via the generalized encodings are formulated. The additivity problem for quantum logarithmic capacities for products of arbitrary quantum channels under appropriate constraints on encodings is discussed. It is proved that true quantum capacity, which is achieved on the standard entanglement as an optimal quantum encoding, retains the additivity property of the logarithmic quantum channel entanglement-assisted capacities on the products of quantum input states. This result for quantum logarithmic information of A-type, which was obtained earlier by the author, is extended to any type of quantum information.
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.