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:2609.34699

Log-Euclidean Rényi Conditional Mutual Information

Roberto Rubboli, Amir Arqand, Mark M. Wilde

quant-phSubmitted Sep 28, 2026• Announced Sep 29, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

Quantum conditional mutual information (QCMI) characterizes quantum Markov chains, but Rényi extensions face competing requirements of data processing, additivity and parameter monotonicity. This paper introduces a log-Euclidean version, $I_\alpha^\flat(A:B|C)_\rho=(\alpha-1)^{-1}\log\operatorname{Tr}\exp[\alpha\log\rho_{ABC}+(1-\alpha)(\log\rho_{AC}+\log\rho_{BC}-\log\rho_C)]$, and a variant optimized over auxiliary marginal states. The non-optimized quantity obeys data processing under channels on $A$ and $B$ for $0<\alpha<1$, is additive and increasing in $\alpha$ for all $\alpha>0$, and converges to QCMI at $\alpha=1$. Both variants vanish exactly on quantum Markov chains for $0<\alpha<1$. The optimized variant obeys data processing in that range and is additive for $\alpha\in[1/2,2]$. Gibbs variational formulas reduce these properties to ordinary relative entropy and QCMI; optimized additivity additionally uses convexity, minimax arguments and fixed-point optimality conditions. Multivariate trace inequalities yield lower and upper recovery bounds involving rotated Petz maps. At $\alpha\to1$, these bound QCMI between rotation-averaged divergences involving Keyl’s rate function and a complementary quantum KL extension. The lower bound strengthens the corresponding fidelity bound but is not universally ordered with the measured-relative-entropy bound. Further results include Rényi chain inequalities and bounds involving distances to Markov and separable states. Data processing is not established above $\alpha=1$; optimized additivity remains open below $1/2$. Recovery upper bounds assume full rank because extensions by approximation may be path dependent. The dual quantity fails data processing. Operational applications, including strong-converse problems and Rényi squashed entanglement, remain future directions.

Little sign of AI-generated textAI use disclosedOverclaims
ChatGPT was used for proofreading, mathematical and bibliographic checks, and assistance with some derivations

Central claim may not hold: The abstract leaves local-channel monotonicity unqualified, whereas the paper establishes the complete structural package only for 0<α≤1, not throughout the non-optimized quantity's domain α>0. The abstract does not mention that its recovery-based upper bound on QCMI requires a full-rank tripartite state, unlike the lower bound.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Rényi generalizations of the conditional quantum mutual information

Mario Berta, Kaushik P. Seshadreesan, Mark M. Wilde

The conditional quantum mutual information I(A; B|C) of a tripartite state ρABC is an information quantity which lies at the center of many problems in quantum information theory. Three of its main properties are that it is non-negative for any tripartite state, that it decreases under local operations applied to systems A and B, and that it obeys the duality relation I(A; B|C) = I(A; B|D) for a four-party pure state on systems ABCD. The conditional mutual information also underlies the squashed entanglement, an entanglement measure that satisfies all of the axioms desired for an entanglement measure. As such, it has been an open question to find Rényi generalizations of the conditional mutual information, that would allow for a deeper understanding of the original quantity and find applications beyond the traditional memoryless setting of quantum information theory. The present paper addresses this question, by defining different α-Rényi generalizations Iα(A; B|C) of the conditional mutual information, some of which we can prove converge to the conditional mutual information in the limit α → 1. Furthermore, we prove that many of these generalizations satisfy non-negativity, duality, and monotonicity with respect to local operations on one of the systems A or B (with it being left as an open question to prove that monotonicity holds with respect to local operations on both systems). The quantities defined here should find applications in quantum information theory and perhaps even in other areas of physics, but we leave this for future work. We also state a conjecture regarding the monotonicity of the Rényi conditional mutual informations defined here with respect to the Rényi parameter α. We prove that this conjecture is true in some special cases and when α is in a neighborhood of one.

arXiv:1403.6102•Journal of Mathematical Physics•Feb 1, 2015•92 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

Chain rules for a mutual information based on Rényi zero-relative entropy

Yuan Zhai, Bo Yang, Zhengjun Xi

Quantum R\'enyi relative entropies play a significant part in characterizing operational tasks in quantum information theory. In this paper, we first give some fundamental properties of the zero-relative entropy, and we find that the geometric R\'enyi relative entropy reduces to the zero-relative entropy in the limit case. Then, we define a new mutual information via the zero-relative entropy, and it is the so-called zero-mutual information. In particular, the zero-mutual information is a lower bound of the Petz-R\'enyi and geometric generalized mutual information. We establish the chain rules for the unsmoothed and smoothed versions of the zero-mutual information. As an application, we discuss generalized mutual information with the Petz-R\'enyi, sandwiched R\'enyi, and geometric R\'enyi types, our result gives a uniform chain rule inequality for quantum generalized mutual information.

Physical Review A•Jul 10, 2023•2 citations

Quantum Fisher information matrices from Rényi relative entropies

Mark M. Wilde

Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, $α$-$z$, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter $α$, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter $α$ even though the original quantities do not. Additionally, I derive and establish basic properties of $α$-$z$ information matrices resulting from the $α$-$z$ Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their $α$-$z$ information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.

arXiv:2510.02218•Oct 2, 2025•12 citations

Rényi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations

Alexander Clyde McKinlay

We investigate quantum Rényi entropic quantities, specifically those derived from 'sandwiched' divergence. This divergence is one of several proposed Rényi generalisations of the quantum relative entropy. We may define Rényi generalisations of the quantum conditional entropy and mutual information in terms of this divergence, from which they inherit many desirable properties. However, these quantities lack some of the convenient structure of their Shannon and von Neumann counterparts. We attempt to bridge this gap by establishing divergence inequalities for valid combinations of Rényi order which replicate the chain and decomposition rules of Shannon and von Neumann entropies. Although weaker in general, these inequalities recover equivalence when the Rényi parameters tend to one. To this end we present Rényi mutual information decomposition rules, a new approach to the Rényi conditional entropy tripartite chain rules and a more general bipartite comparison. The derivation of these results relies on a novel complex interpolation approach for general spaces of linear operators. These new comparisons allow us to employ techniques that until now were only available for Shannon and von Neumann entropies. We can therefore directly apply them to the derivation of Rényi entropic uncertainty relations. Accordingly, we establish a family of Rényi information exclusion relations and provide further generalisations and improvements to this and other known relations, including the Rényi bipartite uncertainty relations.

arXiv:2106.10415•Jun 19, 2021•0 citations

Rényi squashed entanglement, discord, and relative entropy differences

Kaushik P Seshadreesan, Mario Berta, Mark M. Wilde

Abstract The squashed entanglement quantifies the amount of entanglement in a bipartite quantum state, and it satisfies all of the axioms desired for an entanglement measure. The quantum discord is a measure of quantum correlations that are different from those due to entanglement. What these two measures have in common is that they are both based upon the conditional quantum mutual information. In Berta et al (2015 J. Math. Phys. 56 022205 ), we recently proposed Rényi generalizations of the conditional quantum mutual information of a tripartite state on ABC (with C being the conditioning system), which were shown to satisfy some properties that hold for the original quantity, such as non-negativity, duality, and monotonicity with respect to local operations on the system B (with it being left open to show that the Rényi quantity is monotone with respect to local operations on system A ). Here we define a Rényi squashed entanglement and a Rényi quantum discord based on a Rényi conditional quantum mutual information and investigate these quantities in detail. Taking as a conjecture that the Rényi conditional quantum mutual information is monotone with respect to local operations on both systems A and B , we prove that the Rényi squashed entanglement and the Rényi quantum discord satisfy many of the properties of the respective original von Neumann entropy based quantities. In our prior work (Berta et al 2015 Phys. Rev. A 91 022333 ), we also detailed a procedure to obtain Rényi generalizations of any quantum information measure that is equal to a linear combination of von Neumann entropies with coefficients chosen from the set . Here, we extend this procedure to include differences of relative entropies. Using the extended procedure and a conjectured monotonicity of the Rényi generalizations in the Rényi parameter, we discuss potential remainder terms for well known inequalities such as monotonicity of the relative entropy, joint convexity of the relative entropy, and the Holevo bound.

arXiv:1410.1443•Journal of Physics A Mathematical and Theoretical•Sep 14, 2015•53 citations
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.
Quantum conditional mutual information (QCMI) characterizes quantum Markov chains, but Rényi extensions face competing requirements of data processing, additivity and parameter monotonicity. This paper introduces a log-Euclidean version,
Iα♭(A:B∣C)ρ=(α−1)−1log⁡Tr⁡exp⁡[αlog⁡ρABC+(1−α)(log⁡ρAC+log⁡ρBC−log⁡ρC)]I_\alpha^\flat(A:B|C)_\rho=(\alpha-1)^{-1}\log\operatorname{Tr}\exp[\alpha\log\rho_{ABC}+(1-\alpha)(\log\rho_{AC}+\log\rho_{BC}-\log\rho_C)]Iα♭​(A:B∣C)ρ​=(α−1)−1logTrexp[αlogρABC​+(1−α)(logρAC​+logρBC​−logρC​)],
and a variant optimized over auxiliary marginal states.
The non-optimized quantity obeys data processing under channels on AAA and BBB for 0<α<10<\alpha<10<α<1, is additive and increasing in α\alphaα for all α>0\alpha>0α>0, and converges to QCMI at α=1\alpha=1α=1. Both variants vanish exactly on quantum Markov chains for 0<α<10<\alpha<10<α<1. The optimized variant obeys data processing in that range and is additive for α∈[1/2,2]\alpha\in[1/2,2]α∈[1/2,2]. Gibbs variational formulas reduce these properties to ordinary relative entropy and QCMI; optimized additivity additionally uses convexity, minimax arguments and fixed-point optimality conditions.
Multivariate trace inequalities yield lower and upper recovery bounds involving rotated Petz maps. At α→1\alpha\to1α→1, these bound QCMI between rotation-averaged divergences involving Keyl’s rate function and a complementary quantum KL extension. The lower bound strengthens the corresponding fidelity bound but is not universally ordered with the measured-relative-entropy bound. Further results include Rényi chain inequalities and bounds involving distances to Markov and separable states.
Data processing is not established above α=1\alpha=1α=1; optimized additivity remains open below 1/21/21/2. Recovery upper bounds assume full rank because extensions by approximation may be path dependent. The dual quantity fails data processing. Operational applications, including strong-converse problems and Rényi squashed entanglement, remain future directions.
The conditional quantum mutual information I(A; B|C) of a tripartite state ρABC is an information quantity which lies at the center of many problems in quantum information theory. Three of its main properties are that it is non-negative for any tripartite state, that it decreases under local operations applied to systems A and B, and that it obeys the duality relation I(A; B|C) = I(A; B|D) for a four-party pure state on systems ABCD. The conditional mutual information also underlies the squashed entanglement, an entanglement measure that satisfies all of the axioms desired for an entanglement measure. As such, it has been an open question to find Rényi generalizations of the conditional mutual information, that would allow for a deeper understanding of the original quantity and find applications beyond the traditional memoryless setting of quantum information theory. The present paper addresses this question, by defining different α-Rényi generalizations Iα(A; B|C) of the conditional mutual information, some of which we can prove converge to the conditional mutual information in the limit α → 1. Furthermore, we prove that many of these generalizations satisfy non-negativity, duality, and monotonicity with respect to local operations on one of the systems A or B (with it being left as an open question to prove that monotonicity holds with respect to local operations on both systems). The quantities defined here should find applications in quantum information theory and perhaps even in other areas of physics, but we leave this for future work. We also state a conjecture regarding the monotonicity of the Rényi conditional mutual informations defined here with respect to the Rényi parameter α. We prove that this conjecture is true in some special cases and when α is in a neighborhood of one.
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.
Quantum R\'enyi relative entropies play a significant part in characterizing operational tasks in quantum information theory. In this paper, we first give some fundamental properties of the zero-relative entropy, and we find that the geometric R\'enyi relative entropy reduces to the zero-relative entropy in the limit case. Then, we define a new mutual information via the zero-relative entropy, and it is the so-called zero-mutual information. In particular, the zero-mutual information is a lower bound of the Petz-R\'enyi and geometric generalized mutual information. We establish the chain rules for the unsmoothed and smoothed versions of the zero-mutual information. As an application, we discuss generalized mutual information with the Petz-R\'enyi, sandwiched R\'enyi, and geometric R\'enyi types, our result gives a uniform chain rule inequality for quantum generalized mutual information.
Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the Rényi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, ααα-zzz, and geometric Rényi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the Rényi parameter ααα, the log-Euclidean Rényi relative entropy leads to the Kubo-Mori information matrix, and the geometric Rényi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the Rényi parameter ααα even though the original quantities do not. Additionally, I derive and establish basic properties of ααα-zzz information matrices resulting from the ααα-zzz Rényi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their ααα-zzz information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.
We investigate quantum Rényi entropic quantities, specifically those derived from 'sandwiched' divergence. This divergence is one of several proposed Rényi generalisations of the quantum relative entropy. We may define Rényi generalisations of the quantum conditional entropy and mutual information in terms of this divergence, from which they inherit many desirable properties. However, these quantities lack some of the convenient structure of their Shannon and von Neumann counterparts. We attempt to bridge this gap by establishing divergence inequalities for valid combinations of Rényi order which replicate the chain and decomposition rules of Shannon and von Neumann entropies. Although weaker in general, these inequalities recover equivalence when the Rényi parameters tend to one. To this end we present Rényi mutual information decomposition rules, a new approach to the Rényi conditional entropy tripartite chain rules and a more general bipartite comparison. The derivation of these results relies on a novel complex interpolation approach for general spaces of linear operators. These new comparisons allow us to employ techniques that until now were only available for Shannon and von Neumann entropies. We can therefore directly apply them to the derivation of Rényi entropic uncertainty relations. Accordingly, we establish a family of Rényi information exclusion relations and provide further generalisations and improvements to this and other known relations, including the Rényi bipartite uncertainty relations.
Abstract The squashed entanglement quantifies the amount of entanglement in a bipartite quantum state, and it satisfies all of the axioms desired for an entanglement measure. The quantum discord is a measure of quantum correlations that are different from those due to entanglement. What these two measures have in common is that they are both based upon the conditional quantum mutual information. In Berta et al (2015 J. Math. Phys. 56 022205 ), we recently proposed Rényi generalizations of the conditional quantum mutual information of a tripartite state on ABC (with C being the conditioning system), which were shown to satisfy some properties that hold for the original quantity, such as non-negativity, duality, and monotonicity with respect to local operations on the system B (with it being left open to show that the Rényi quantity is monotone with respect to local operations on system A ). Here we define a Rényi squashed entanglement and a Rényi quantum discord based on a Rényi conditional quantum mutual information and investigate these quantities in detail. Taking as a conjecture that the Rényi conditional quantum mutual information is monotone with respect to local operations on both systems A and B , we prove that the Rényi squashed entanglement and the Rényi quantum discord satisfy many of the properties of the respective original von Neumann entropy based quantities. In our prior work (Berta et al 2015 Phys. Rev. A 91 022333 ), we also detailed a procedure to obtain Rényi generalizations of any quantum information measure that is equal to a linear combination of von Neumann entropies with coefficients chosen from the set . Here, we extend this procedure to include differences of relative entropies. Using the extended procedure and a conjectured monotonicity of the Rényi generalizations in the Rényi parameter, we discuss potential remainder terms for well known inequalities such as monotonicity of the relative entropy, joint convexity of the relative entropy, and the Holevo bound.