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

Classical and Quantum Information Measures Characterizing Convertibility: An Axiomatic Approach

Frits Verhagen

quant-phcs.ITmath-phmath.PRSubmitted Oct 12, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

In this PhD thesis, we take an axiomatic approach to studying multivariate divergences, which are measures of the information content of a tuple of classical or quantum states. These divergences are studied in the context of large-sample and catalytic convertibility of tuples of states. This type of convertibility is characterized by the ordering of an axiomatically defined family of divergences. In this thesis, we identify this family of divergences explicitly for two scenarios, one classical and one quantum. In the classical setting, we show that the relevant divergences are certain generalizations of the bivariate Rényi divergences. Unlike previous studies, we do not require the distributions to have the same support, yielding interesting new divergences. In the quantum setting, we consider pairs of classical-quantum states with pure component states, and find that majorization is characterized by all $α$-$z$ relative entropies for $α<1$. This demonstrates the first operational interpretation of these relative entropies.

AI Summary

This thesis studies when one channel can simultaneously convert a tuple of classical or quantum states into another, either exactly on sufficiently many tensor copies or with a catalyst returned unchanged. It seeks additive, data-processing-monotone divergences that characterize these conversion orders. For finite classical experiments, it extends earlier equal-support results to distributions with nonempty common support, considering both unrestricted support relations and a distinguished distribution whose support contains the others. The resulting monotones are multivariate Rényi divergences supplemented by support-intersection-restricted quantities; the dominating-support case also requires higher-order Rényi and max-divergence constraints. Strict inequalities give sufficient conditions for exact large-sample and catalytic conversion, while conversion implies non-strict inequalities. Under additional input assumptions, non-strict inequalities characterize conversion to arbitrarily close perturbed targets. For pairs of classical–quantum states with pure conditional states, the corresponding characterization uses $\alpha$–$z$ relative entropies with $0<\alpha<1$ and $z>\max\{\alpha,1-\alpha\}$, providing an operational interpretation in this restricted setting. The analysis applies existing preordered-semiring comparison theorems after classifying monotone homomorphisms and derivations. It also derives optimal exact conversion rates as $\min_D D(P)/D(Q)$ and proves, in selected settings, that deleting any nonempty open parameter subset makes the monotone family insufficient. The results require restrictive power-universality conditions on inputs, often tied to support structure. Approximation concerns a perturbed single-copy target before tensoring, not directly vanishing global tensor-product error. General mixed quantum-state pairs, broader support patterns, and removal of power-universality assumptions remain open.

No sign of AI-generated textStrong assumptions

Central claim may not hold: The abstract's quantum parameter claim needs qualification because the demonstrated characterization concerns a restricted α–z parameter region, not arbitrary z with α<1. The abstract omits substantive power-universality hypotheses on source tuples that restrict the applicability of the large-sample characterizations.

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

Comments
PhD thesis at the Centre for Quantum Technologies, National University of Singapore; contains corrections of some minor errors appearing in the published papers that this thesis is based on

Related papers

Entropies and Relative Entropies

Gilad Gour

Chapter 6 builds upon the foundation of divergences from Chapter 5, advancing into entropies and relative entropies with an axiomatic approach, and the inclusion of the additivity axiom. The chapter delves into the classical and quantum relative entropies, establishing their core properties and revealing the significance of the KL-divergence introduced in Chapter 5, notably characterized by asymptotic continuity. Quantum relative entropies are addressed as generalizations of classical ones, with a focus on the conditions necessary for these measures in the quantum framework. Several variants of relative entropies are discussed, including Renyi relative entropies and their extensions to quantum domain such as the Petz quantum Renyi divergence, minimal quantum Renyi divergence, and the maximal quantum Renyi divergence. This discourse underlines the relevance of continuity and its relation to faithfulness in relative entropies. The concept of entropy is portrayed as a measure with a broad spectrum of interpretations and applications across fields, from thermodynamics and information theory to cosmology and economics.

Cambridge University Press eBooks•Apr 10, 2025•0 citations

α - z -Rényi relative entropies

Koenraad M. R. Audenaert, Nilanjana Datta

We consider a two-parameter family of Rényi relative entropies Dα,z(ρ ∥ σ) that are quantum generalisations of the classical Rényi divergence Dα(p ∥ q). This family includes many known relative entropies (or divergences) such as the quantum relative entropy, the recently defined quantum Rényi divergences, as well as the quantum Rényi relative entropies. All its members satisfy the quantum generalizations of Rényi’s axioms for a divergence. We consider the range of the parameters α, z for which the data-processing inequality holds. We also investigate a variety of limiting cases for the two parameters, obtaining explicit formulas for each one of them.

arXiv:1310.7178•Journal of Mathematical Physics•Feb 1, 2015•158 citations

Maximal Rényi Relative Entropy for $α>2$

Roberto Rubboli

Quantum relative entropies play a fundamental role in quantum information theory. In the classical setting, Rényi relative entropies constitute, up to linear combinations, the most general class of relative entropies, naturally motivating the search for their minimal and maximal quantum extensions. The minimal extension is known to be the reverse sandwiched Rényi relative entropy for $α\in[0,1/2)$ and the sandwiched Rényi relative entropy for $α\geq 1/2$. In contrast, the maximal extension had previously been identified only for $α\in[0,2]$, where it is given by the geometric Rényi relative entropy. In this work, we complete this characterization by proving that for $α>2$, the maximal extension is given by the $α$-$z$ Rényi relative entropy with $z=α-1$. As an application, we determine when an energy-incoherent state can be transformed into an energy-coherent state by a Gibbs-preserving operation assisted by an uncorrelated catalyst, thereby fully characterizing the coherence-generating power of this class of operations in the catalytic setting.

quant-pharXiv:2608.01124•Aug 4, 2026•3 citations

Relations between different quantum Rényi divergences

Raban Iten

Quantum generalizations of Rényi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Rényi divergence $\bar{D}_α$ and the minimal quantum Rényi divergence $\widetilde{D}_α$. Moreover, the maximum quantum Rényi divergence $\widehat{D}_α$ is of particular mathematical interest. In this Master thesis, we investigate relations between these divergences and their applications in quantum information theory. Our main result is a reverse Araki-Lieb-Thirring inequality that implies a new relation between the minimal and the Petz divergence, namely that $α\bar{D}_α(ρ\| σ) \leqslant \widetilde{D}_α(ρ\| σ)$ for $α\in [0,1]$ and where $ρ$ and $σ$ are density operators. This bound suggests defining a "pretty good fidelity", whose relation to the usual fidelity implies the known relations between the optimal and pretty good measurement as well as the optimal and pretty good singlet fraction. In addition, we provide a new proof of the inequality $\widetilde{D}_{1}(ρ\| σ) \leqslant \widehat{D}_{1}(ρ\| σ)\, ,$ based on the Araki-Lieb-Thirring inequality. This leads to an elegant proof of the logarithmic form of the reverse Golden-Thompson inequality.

arXiv:2012.08327•Dec 12, 2020•2 citations

Efficient Quantum Measurements: Computational Max- and Measured Rényi Divergences and Applications

Álvaro Yángüez, Thomas A. Hahn, Jan Kochanowski

Quantum information processing is limited, in practice, to efficiently implementable operations. This motivates the study of quantum divergences that preserve their operational meaning while faithfully capturing these computational constraints. Using geometric, computational, and information theoretic tools, we define two new types of computational divergences, which we termcomputational max-divergence and computational measured Rényi divergences. Both are constrained by a family of efficient binary measurements, and thus useful for state discrimination tasks in the computational setting. We prove that, in the infinite-order limit, the computational measured Rényi divergence coincides with the computational max-divergence, mirroring the corresponding relation in the unconstrained information-theoretic setting. For the many-copy regime, we introduce regularized versions and establish a one-sided computational Stein bound on achievable hypothesis-testing exponents under efficient measurements, giving the regularized computational measured relative entropy an operational meaning. We further define resource measures induced by our computational divergences and prove an asymptotic continuity bound for the computational measured relative entropy of resource. Focusing on entanglement, we relate our results to previously proposed computational entanglement measures and provide explicit separations from the information-theoretic setting. Together, these results provide a principled, cohesive approach towards state discrimination tasks and resource quantification under computational constraints.

arXiv:2509.21308•IEEE Transactions on Information Theory•Apr 2, 2026•5 citations

Relative entropies and their use in quantum information theory

Felix Leditzky

This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic expansions and strong converse theorems. The dissertation consists of a mathematical and an information-theoretic part. In the mathematical part, we focus on the $α$-sandwiched Rényi divergence ($α$-SRD). We first investigate the limit $α\to 0$ to determine whether this recovers the well-known $0$-Rényi relative divergence. We then prove various new results for entropic quantities derived from the $α$-SRD, including dimension bounds and useful bounds in terms of the fidelity between two quantum states. Furthermore, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality (viz. monotonicity under quantum operations) for the $α$-SRD, and give applications to entropic bounds. In the information-theoretic part, we first derive the second order asymptotics of visible quantum source coding using a mixed source. For the achievability part, we develop universal quantum source codes achieving a given second order rate for a memoryless source. As a corollary of the main result, we obtain the second order asymptotics of quantum source coding using a single memoryless source. We then prove strong converse theorems for state redistribution (with or without feedback) and measurement compression with quantum side information. The key ingredients in proving these theorems are the aforementioned fidelity bounds on Rényi entropic quantities derived from the $α$-SRD.

arXiv:1611.08802•Nov 27, 2016•30 citations
In this PhD thesis, we take an axiomatic approach to studying multivariate divergences, which are measures of the information content of a tuple of classical or quantum states. These divergences are studied in the context of large-sample and catalytic convertibility of tuples of states. This type of convertibility is characterized by the ordering of an axiomatically defined family of divergences. In this thesis, we identify this family of divergences explicitly for two scenarios, one classical and one quantum. In the classical setting, we show that the relevant divergences are certain generalizations of the bivariate Rényi divergences. Unlike previous studies, we do not require the distributions to have the same support, yielding interesting new divergences. In the quantum setting, we consider pairs of classical-quantum states with pure component states, and find that majorization is characterized by all ααα-zzz relative entropies for α<1α<1α<1. This demonstrates the first operational interpretation of these relative entropies.
This thesis studies when one channel can simultaneously convert a tuple of classical or quantum states into another, either exactly on sufficiently many tensor copies or with a catalyst returned unchanged. It seeks additive, data-processing-monotone divergences that characterize these conversion orders.
For finite classical experiments, it extends earlier equal-support results to distributions with nonempty common support, considering both unrestricted support relations and a distinguished distribution whose support contains the others. The resulting monotones are multivariate Rényi divergences supplemented by support-intersection-restricted quantities; the dominating-support case also requires higher-order Rényi and max-divergence constraints. Strict inequalities give sufficient conditions for exact large-sample and catalytic conversion, while conversion implies non-strict inequalities. Under additional input assumptions, non-strict inequalities characterize conversion to arbitrarily close perturbed targets.
For pairs of classical–quantum states with pure conditional states, the corresponding characterization uses α\alphaα–zzz relative entropies with 0<α<10<\alpha<10<α<1 and z>max⁡{α,1−α}z>\max\{\alpha,1-\alpha\}z>max{α,1−α}, providing an operational interpretation in this restricted setting. The analysis applies existing preordered-semiring comparison theorems after classifying monotone homomorphisms and derivations. It also derives optimal exact conversion rates as min⁡DD(P)/D(Q)\min_D D(P)/D(Q)minD​D(P)/D(Q) and proves, in selected settings, that deleting any nonempty open parameter subset makes the monotone family insufficient.
The results require restrictive power-universality conditions on inputs, often tied to support structure. Approximation concerns a perturbed single-copy target before tensoring, not directly vanishing global tensor-product error. General mixed quantum-state pairs, broader support patterns, and removal of power-universality assumptions remain open.
Chapter 6 builds upon the foundation of divergences from Chapter 5, advancing into entropies and relative entropies with an axiomatic approach, and the inclusion of the additivity axiom. The chapter delves into the classical and quantum relative entropies, establishing their core properties and revealing the significance of the KL-divergence introduced in Chapter 5, notably characterized by asymptotic continuity. Quantum relative entropies are addressed as generalizations of classical ones, with a focus on the conditions necessary for these measures in the quantum framework. Several variants of relative entropies are discussed, including Renyi relative entropies and their extensions to quantum domain such as the Petz quantum Renyi divergence, minimal quantum Renyi divergence, and the maximal quantum Renyi divergence. This discourse underlines the relevance of continuity and its relation to faithfulness in relative entropies. The concept of entropy is portrayed as a measure with a broad spectrum of interpretations and applications across fields, from thermodynamics and information theory to cosmology and economics.
We consider a two-parameter family of Rényi relative entropies Dα,z(ρ ∥ σ) that are quantum generalisations of the classical Rényi divergence Dα(p ∥ q). This family includes many known relative entropies (or divergences) such as the quantum relative entropy, the recently defined quantum Rényi divergences, as well as the quantum Rényi relative entropies. All its members satisfy the quantum generalizations of Rényi’s axioms for a divergence. We consider the range of the parameters α, z for which the data-processing inequality holds. We also investigate a variety of limiting cases for the two parameters, obtaining explicit formulas for each one of them.
Maximal Rényi Relative Entropy for α>2α>2α>2
Quantum relative entropies play a fundamental role in quantum information theory. In the classical setting, Rényi relative entropies constitute, up to linear combinations, the most general class of relative entropies, naturally motivating the search for their minimal and maximal quantum extensions. The minimal extension is known to be the reverse sandwiched Rényi relative entropy for α∈[0,1/2)α\in[0,1/2)α∈[0,1/2) and the sandwiched Rényi relative entropy for α≥1/2α\geq 1/2α≥1/2. In contrast, the maximal extension had previously been identified only for α∈[0,2]α\in[0,2]α∈[0,2], where it is given by the geometric Rényi relative entropy. In this work, we complete this characterization by proving that for α>2α>2α>2, the maximal extension is given by the ααα-zzz Rényi relative entropy with z=α−1z=α-1z=α−1. As an application, we determine when an energy-incoherent state can be transformed into an energy-coherent state by a Gibbs-preserving operation assisted by an uncorrelated catalyst, thereby fully characterizing the coherence-generating power of this class of operations in the catalytic setting.
Quantum generalizations of Rényi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Rényi divergence Dˉα\bar{D}_αDˉα​ and the minimal quantum Rényi divergence D~α\widetilde{D}_αDα​. Moreover, the maximum quantum Rényi divergence D^α\widehat{D}_αDα​ is of particular mathematical interest. In this Master thesis, we investigate relations between these divergences and their applications in quantum information theory. Our main result is a reverse Araki-Lieb-Thirring inequality that implies a new relation between the minimal and the Petz divergence, namely that αDˉα(ρ∥σ)⩽D~α(ρ∥σ)α\bar{D}_α(ρ\| σ) \leqslant \widetilde{D}_α(ρ\| σ)αDˉα​(ρ∥σ)⩽Dα​(ρ∥σ) for α∈[0,1]α\in [0,1]α∈[0,1] and where ρρρ and σσσ are density operators. This bound suggests defining a "pretty good fidelity", whose relation to the usual fidelity implies the known relations between the optimal and pretty good measurement as well as the optimal and pretty good singlet fraction. In addition, we provide a new proof of the inequality D~1(ρ∥σ)⩽D^1(ρ∥σ) ,\widetilde{D}_{1}(ρ\| σ) \leqslant \widehat{D}_{1}(ρ\| σ)\, ,D1​(ρ∥σ)⩽D1​(ρ∥σ), based on the Araki-Lieb-Thirring inequality. This leads to an elegant proof of the logarithmic form of the reverse Golden-Thompson inequality.
Quantum information processing is limited, in practice, to efficiently implementable operations. This motivates the study of quantum divergences that preserve their operational meaning while faithfully capturing these computational constraints. Using geometric, computational, and information theoretic tools, we define two new types of computational divergences, which we termcomputational max-divergence and computational measured Rényi divergences. Both are constrained by a family of efficient binary measurements, and thus useful for state discrimination tasks in the computational setting. We prove that, in the infinite-order limit, the computational measured Rényi divergence coincides with the computational max-divergence, mirroring the corresponding relation in the unconstrained information-theoretic setting. For the many-copy regime, we introduce regularized versions and establish a one-sided computational Stein bound on achievable hypothesis-testing exponents under efficient measurements, giving the regularized computational measured relative entropy an operational meaning. We further define resource measures induced by our computational divergences and prove an asymptotic continuity bound for the computational measured relative entropy of resource. Focusing on entanglement, we relate our results to previously proposed computational entanglement measures and provide explicit separations from the information-theoretic setting. Together, these results provide a principled, cohesive approach towards state discrimination tasks and resource quantification under computational constraints.
This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic expansions and strong converse theorems. The dissertation consists of a mathematical and an information-theoretic part. In the mathematical part, we focus on the ααα-sandwiched Rényi divergence (ααα-SRD). We first investigate the limit α→0α\to 0α→0 to determine whether this recovers the well-known 000-Rényi relative divergence. We then prove various new results for entropic quantities derived from the ααα-SRD, including dimension bounds and useful bounds in terms of the fidelity between two quantum states. Furthermore, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality (viz. monotonicity under quantum operations) for the ααα-SRD, and give applications to entropic bounds. In the information-theoretic part, we first derive the second order asymptotics of visible quantum source coding using a mixed source. For the achievability part, we develop universal quantum source codes achieving a given second order rate for a memoryless source. As a corollary of the main result, we obtain the second order asymptotics of quantum source coding using a single memoryless source. We then prove strong converse theorems for state redistribution (with or without feedback) and measurement compression with quantum side information. The key ingredients in proving these theorems are the aforementioned fidelity bounds on Rényi entropic quantities derived from the ααα-SRD.