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:2406.01699 · IEEE Transactions on Information Theory

Doubly Minimized Petz and Sandwiched Rényi Mutual Information: Properties

Laura Burri

Published Mar 26, 2026• 6 citations
arXivHTMLPDF

Abstract

The doubly minimized Petz Rényi mutual information of order α is defined as the minimization of the Petz divergence of order α of a fixed bipartite quantum state relative to any product state. The doubly minimized sandwiched Rényi mutual information is defined analogously using the sandwiched divergence in place of the Petz divergence. In this work, we establish several properties of these two types of Rényi mutual information. In particular, for the Petz case, we prove additivity for α ∈ [1/2, 2]. For the sandwiched case, we establish a novel duality relation for α ∈ [2/3,∞] via Sion’s minimax theorem, and we subsequently use this duality relation to prove additivity for the same range of α. Previously, additivity for the sandwiched case was known only for α ∈ [1,∞], but it had been conjectured to hold for α ∈ [1/2,∞].

DOI
10.1109/tit.2026.3677886

Related papers

Doubly Minimized Petz and Sandwiched Rényi Mutual Information: Operational Interpretation From Binary Quantum State Discrimination

Laura Burri

The doubly minimized Petz Rényi mutual information of order α is defined as the minimum of the Petz divergence of order α of a given bipartite quantum state relative to all product states. The doubly minimized sandwiched Rényi mutual information is defined analogously, with the Petz divergence replaced by the sandwiched divergence. In this work, we study certain binary quantum state discrimination problems related to correlation detection. We show that the corresponding direct exponent is determined by the doubly minimized Petz Rényi mutual information of order α ∈ (1/2, 1), and that the strong converse exponent is determined by the doubly minimized sandwiched Rényi mutual information of order α ∈ (1,∞). This provides an operational interpretation of these types of Rényi mutual information and generalizes previous results for classical probability distributions to the quantum setting. For completeness, we also study the corresponding moderate deviation regime both below and above the threshold, and determine the Stein exponent and the second-order asymptotics.

arXiv:2406.03213•IEEE Transactions on Information Theory•May 20, 2026•6 citations

Tumula information and doubly minimized Petz Renyi lautum information

Lukas Schmitt, Filippo Girardi, Laura Burri

We study a doubly minimized variant of the lautum information - a reversed analogue of the mutual information - defined as the minimum relative entropy between any product state and a fixed bipartite quantum state; we refer to this measure as the tumula information. In addition, we introduce the corresponding Petz Renyi version, which we call the doubly minimized Petz Renyi lautum information (PRLI). We derive several general properties of these correlation measures and provide an operational interpretation in the context of hypothesis testing. Specifically, we show that the reverse direct exponent of certain binary quantum state discrimination problems is quantified by the doubly minimized PRLI of order $α\in (0,1/2)$, and that the Sanov exponent is determined by the tumula information. Furthermore, we investigate the extension of the tumula information to channels and compare its properties with previous results on the channel umlaut information [Girardi et al., arXiv:2503.21479].

quant-pharXiv:2603.17005•Mar 19, 2026•0 citations

Alternating minimization for computing doubly minimized Petz Renyi mutual information

Laura Burri

The doubly minimized Petz Renyi mutual information (PRMI) of order $α$ is defined as the minimization of the Petz divergence of order $α$ of a fixed bipartite quantum state $ρ_{AB}$ relative to any product state $σ_A\otimes τ_B$. To date, no closed-form expression for this measure has been found, necessitating the development of numerical methods for its computation. In this work, we show that alternating minimization over $σ_A$ and $τ_B$ asymptotically converges to the doubly minimized PRMI for any $α\in (\frac{1}{2},1)\cup (1,2]$, by proving linear convergence of the objective function values with respect to the number of iterations for $α\in (1,2]$ and sublinear convergence for $α\in (\frac{1}{2},1)$. Previous studies have only addressed the specific case where $ρ_{AB}$ is a classical-classical state, while our results hold for any quantum state $ρ_{AB}$.

arXiv:2507.05205•Jul 7, 2025•1 citation

Sandwiched Rényi divergence satisfies data processing inequality

Salman Beigi

Sandwiched (quantum) α-Rényi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint arXiv:1306.1586 (2013)] and Müller-Lennert et al. [“On quantum Rényi entropies: a new definition, some properties and several conjectures,” preprint arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate properties of this new quantum divergence. In particular, we show that sandwiched α-Rényi divergence satisfies the data processing inequality for all values of α > 1. Moreover we prove that α-Holevo information, a variant of Holevo information defined in terms of sandwiched α-Rényi divergence, is super-additive. Our results are based on Hölder's inequality, the Riesz-Thorin theorem and ideas from the theory of complex interpolation. We also employ Sion's minimax theorem.

arXiv:1306.5920•Journal of Mathematical Physics•Dec 1, 2013•286 citations

Min-reflected entropy = doubly minimized Petz Rényi mutual information of order 1/2

Laura Burri

Rényi reflected entropies of order n ≥ 2 are correlation measures that have been introduced in the field of holography and have since also attracted interest in many-body physics and quantum field theory. In this work, we put the spotlight on the min-reflected entropy, i.e., the Rényi reflected entropy in the limit n → ∞. We show that, for general bipartite quantum states, this measure is identical to another measure originating from the field of quantum information theory: the doubly minimized Petz Rényi mutual information of order 1/2. Furthermore, we demonstrate how this equality enables us to answer several previously open questions, each concerning one of the two correlation measures (or generalizations of them).

arXiv:2502.18433•Journal of Mathematical Physics•Aug 1, 2026•2 citations

Optimized Quantum F-Divergences

Mark M. Wilde

The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f-divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz-Renyi relative entropies. In this contribution, I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach. Interestingly, the sandwiched Renyi relative entropies are particular examples of the optimized f-divergence. Thus, one benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for both the Petz-Renyi and sandwiched Renyi relative entropies, for the full range of parameters for which it is known to hold. Full version of this paper is accessible at arXiv:1710.10252

arXiv:2103.16797•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•1 citation
The doubly minimized Petz Rényi mutual information of order α is defined as the minimization of the Petz divergence of order α of a fixed bipartite quantum state relative to any product state. The doubly minimized sandwiched Rényi mutual information is defined analogously using the sandwiched divergence in place of the Petz divergence. In this work, we establish several properties of these two types of Rényi mutual information. In particular, for the Petz case, we prove additivity for α ∈ [1/2, 2]. For the sandwiched case, we establish a novel duality relation for α ∈ [2/3,∞] via Sion’s minimax theorem, and we subsequently use this duality relation to prove additivity for the same range of α. Previously, additivity for the sandwiched case was known only for α ∈ [1,∞], but it had been conjectured to hold for α ∈ [1/2,∞].
The doubly minimized Petz Rényi mutual information of order α is defined as the minimum of the Petz divergence of order α of a given bipartite quantum state relative to all product states. The doubly minimized sandwiched Rényi mutual information is defined analogously, with the Petz divergence replaced by the sandwiched divergence. In this work, we study certain binary quantum state discrimination problems related to correlation detection. We show that the corresponding direct exponent is determined by the doubly minimized Petz Rényi mutual information of order α ∈ (1/2, 1), and that the strong converse exponent is determined by the doubly minimized sandwiched Rényi mutual information of order α ∈ (1,∞). This provides an operational interpretation of these types of Rényi mutual information and generalizes previous results for classical probability distributions to the quantum setting. For completeness, we also study the corresponding moderate deviation regime both below and above the threshold, and determine the Stein exponent and the second-order asymptotics.
We study a doubly minimized variant of the lautum information - a reversed analogue of the mutual information - defined as the minimum relative entropy between any product state and a fixed bipartite quantum state; we refer to this measure as the tumula information. In addition, we introduce the corresponding Petz Renyi version, which we call the doubly minimized Petz Renyi lautum information (PRLI). We derive several general properties of these correlation measures and provide an operational interpretation in the context of hypothesis testing. Specifically, we show that the reverse direct exponent of certain binary quantum state discrimination problems is quantified by the doubly minimized PRLI of order α∈(0,1/2)α\in (0,1/2)α∈(0,1/2), and that the Sanov exponent is determined by the tumula information. Furthermore, we investigate the extension of the tumula information to channels and compare its properties with previous results on the channel umlaut information [Girardi et al., arXiv:2503.21479].
The doubly minimized Petz Renyi mutual information (PRMI) of order ααα is defined as the minimization of the Petz divergence of order ααα of a fixed bipartite quantum state ρABρ_{AB}ρAB​ relative to any product state σA⊗τBσ_A\otimes τ_BσA​⊗τB​. To date, no closed-form expression for this measure has been found, necessitating the development of numerical methods for its computation. In this work, we show that alternating minimization over σAσ_AσA​ and τBτ_BτB​ asymptotically converges to the doubly minimized PRMI for any α∈(12,1)∪(1,2]α\in (\frac{1}{2},1)\cup (1,2]α∈(21​,1)∪(1,2], by proving linear convergence of the objective function values with respect to the number of iterations for α∈(1,2]α\in (1,2]α∈(1,2] and sublinear convergence for α∈(12,1)α\in (\frac{1}{2},1)α∈(21​,1). Previous studies have only addressed the specific case where ρABρ_{AB}ρAB​ is a classical-classical state, while our results hold for any quantum state ρABρ_{AB}ρAB​.
Sandwiched (quantum) α-Rényi divergence has been recently defined in the independent works of Wilde et al. [“Strong converse for the classical capacity of entanglement-breaking channels,” preprint arXiv:1306.1586 (2013)] and Müller-Lennert et al. [“On quantum Rényi entropies: a new definition, some properties and several conjectures,” preprint arXiv:1306.3142v1 (2013)]. This new quantum divergence has already found applications in quantum information theory. Here we further investigate properties of this new quantum divergence. In particular, we show that sandwiched α-Rényi divergence satisfies the data processing inequality for all values of α > 1. Moreover we prove that α-Holevo information, a variant of Holevo information defined in terms of sandwiched α-Rényi divergence, is super-additive. Our results are based on Hölder's inequality, the Riesz-Thorin theorem and ideas from the theory of complex interpolation. We also employ Sion's minimax theorem.
Rényi reflected entropies of order n ≥ 2 are correlation measures that have been introduced in the field of holography and have since also attracted interest in many-body physics and quantum field theory. In this work, we put the spotlight on the min-reflected entropy, i.e., the Rényi reflected entropy in the limit n → ∞. We show that, for general bipartite quantum states, this measure is identical to another measure originating from the field of quantum information theory: the doubly minimized Petz Rényi mutual information of order 1/2. Furthermore, we demonstrate how this equality enables us to answer several previously open questions, each concerning one of the two correlation measures (or generalizations of them).
The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f-divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz-Renyi relative entropies. In this contribution, I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach. Interestingly, the sandwiched Renyi relative entropies are particular examples of the optimized f-divergence. Thus, one benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for both the Petz-Renyi and sandwiched Renyi relative entropies, for the full range of parameters for which it is known to hold. Full version of this paper is accessible at arXiv:1710.10252