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

Tumula information and doubly minimized Petz Renyi lautum information

Lukas Schmitt, Filippo Girardi, Laura Burri

quant-phcs.ITSubmitted Mar 17, 2026• Announced Mar 19, 2026• 0 citations
arXivHTMLPDF

Abstract

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].

Comments
18+19 pages, 2 figures, 3 tables

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

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

Laura Burri

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,∞].

arXiv:2406.01699•IEEE Transactions on Information Theory•Mar 26, 2026•6 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•1 citation

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

Quantum umlaut information

Filippo Girardi, Aadil Oufkir, Bartosz Regula +3 more

We study the quantum umlaut information, a correlation measure defined for bipartite quantum states $ρ_{AB}$ as a reversed variant of the quantum mutual information: $U(A;B)_ρ= \min_{σ_B} D(ρ_A\otimes σ_B\|ρ_{AB})$ in terms of the quantum relative entropy $D$. As in the classical case [Girardi et al., arXiv:2503.18910], this definition allows for a closed-form expression and has an operational interpretation as the asymptotic error exponent in the hypothesis testing task of deciding whether a given bipartite state is product or not. We generalise the umlaut information to quantum channels, where it also extends the notion of `oveloh information' [Nuradha et al., arXiv:2404.16101]. We prove that channel umlaut information is additive for classical-quantum channels, while we observe additivity violations for fully quantum channels. Inspired by recent results in entanglement theory, we then show as our main result that the regularised umlaut information constitutes a fundamental measure of the quality of classical information transmission over a quantum channel -- as opposed to the capacity, which quantifies the quantity of information that can be sent. This interpretation applies to coding assisted by activated non-signalling correlations, and the channel umlaut information is in general larger than the corresponding expression for unassisted communication as obtained by Dalai for the classical-quantum case [IEEE Trans. Inf. Theory 59, 8027 (2013)]. Combined with prior works on non-signalling--assisted zero-error channel capacities, our findings imply a dichotomy between the settings of zero-rate error exponents and zero-error communication. While our results are single-letter only for classical-quantum channels, we also give a single-letter bound for fully quantum channels in terms of the `geometric' version of umlaut information.

arXiv:2503.21479•Mar 27, 2025•6 citations

Correlation detection and an operational interpretation of the Rényi mutual information

Masahito Hayashi, Marco Tomamichel

A variety of new measures of quantum Rényi mutual information and quantum Rényi conditional entropy have recently been proposed, and some of their mathematical properties explored. Here, we show that the Rényi mutual information attains operational meaning in the context of composite hypothesis testing, when the null hypothesis is a fixed bipartite state and the alternative hypothesis consists of all product states that share one marginal with the null hypothesis. This hypothesis testing problem occurs naturally in channel coding, where it corresponds to testing whether a state is the output of a given quantum channel or of a “useless” channel whose output is decoupled from the environment. Similarly, we establish an operational interpretation of Rényi conditional entropy by choosing an alternative hypothesis that consists of product states that are maximally mixed on one system. Specialized to classical probability distributions, our results also establish an operational interpretation of Rényi mutual information and Rényi conditional entropy.

arXiv:1408.6894•Journal of Mathematical Physics•Oct 1, 2016•124 citations
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 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.
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,∞].
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.
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).
We study the quantum umlaut information, a correlation measure defined for bipartite quantum states ρABρ_{AB}ρAB​ as a reversed variant of the quantum mutual information: U(A;B)ρ=min⁡σBD(ρA⊗σB∥ρAB)U(A;B)_ρ= \min_{σ_B} D(ρ_A\otimes σ_B\|ρ_{AB})U(A;B)ρ​=minσB​​D(ρA​⊗σB​∥ρAB​) in terms of the quantum relative entropy DDD. As in the classical case [Girardi et al., arXiv:2503.18910], this definition allows for a closed-form expression and has an operational interpretation as the asymptotic error exponent in the hypothesis testing task of deciding whether a given bipartite state is product or not. We generalise the umlaut information to quantum channels, where it also extends the notion of `oveloh information' [Nuradha et al., arXiv:2404.16101]. We prove that channel umlaut information is additive for classical-quantum channels, while we observe additivity violations for fully quantum channels. Inspired by recent results in entanglement theory, we then show as our main result that the regularised umlaut information constitutes a fundamental measure of the quality of classical information transmission over a quantum channel -- as opposed to the capacity, which quantifies the quantity of information that can be sent. This interpretation applies to coding assisted by activated non-signalling correlations, and the channel umlaut information is in general larger than the corresponding expression for unassisted communication as obtained by Dalai for the classical-quantum case [IEEE Trans. Inf. Theory 59, 8027 (2013)]. Combined with prior works on non-signalling--assisted zero-error channel capacities, our findings imply a dichotomy between the settings of zero-rate error exponents and zero-error communication. While our results are single-letter only for classical-quantum channels, we also give a single-letter bound for fully quantum channels in terms of the `geometric' version of umlaut information.
A variety of new measures of quantum Rényi mutual information and quantum Rényi conditional entropy have recently been proposed, and some of their mathematical properties explored. Here, we show that the Rényi mutual information attains operational meaning in the context of composite hypothesis testing, when the null hypothesis is a fixed bipartite state and the alternative hypothesis consists of all product states that share one marginal with the null hypothesis. This hypothesis testing problem occurs naturally in channel coding, where it corresponds to testing whether a state is the output of a given quantum channel or of a “useless” channel whose output is decoupled from the environment. Similarly, we establish an operational interpretation of Rényi conditional entropy by choosing an alternative hypothesis that consists of product states that are maximally mixed on one system. Specialized to classical probability distributions, our results also establish an operational interpretation of Rényi mutual information and Rényi conditional entropy.