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

Reverse Test and Characterization of Quantum Relative Entropy

Keiji Matsumoto

Published Oct 5, 2010• 54 citations
arXivHTMLPDF

Abstract

The aim of the present paper is to give axiomatic characterization of quantum relative entropy utilizing resource conversion scenario. We consider two sets of axioms: non-asymptotic and asymptotic. In the former setting, we prove that the upperbound and the lowerbund of $\mathrm{D}^{Q}(ρ||σ) $ is $\mathrm{D}^{R}(ρ||σ) :=\mathrm{tr}% \,ρ\ln\sqrtρσ^{-1}\sqrtρ$ and $\mathrm{D}(ρ||σ) :=$ $\mathrm{tr}\,ρ(\lnρ-\lnσ) $, respectively. In the latter setting, we prove uniqueness of quantum relative entropy, that is, $\mathrm{D}^{Q}(ρ||σ) $ should equal a constant multiple of $\mathrm{D}(ρ||σ) $. In the analysis, we define and use reverse test and asymptotic reverse test, which are natural inverse of hypothesis test.

DOI
10.48550/arxiv.1010.1030

Related papers

Reverse test and quantum analogue of classical fidelity and generalized fidelity

Keiji Matsumoto

The aim of the present paper is to give axiomatic characterization of quantum relative entropy utilizing resource conversion scenario. We consider two sets of axioms: non-asymptotic and asymptotic. In the former setting, we prove that the upperbound and the lowerbund of D^{Q}(ρ||σ) is D^{R}(ρ||σ):=trρlnσ^{1/2}ρ^{-1}σ^{1/2} and D(ρ||σ):= trρ(lnρ-lnσ), respectively. In the latter setting, we prove uniqueness of quantum relative entropy, that is, D^{Q}(ρ||σ) should equal a constant multiple of D(ρ||σ). In the analysis, we define and use reverse test and asymptotic reverse test, which are natural inverse of hypothesis test.

arXiv:1006.0302•Jun 2, 2010•17 citations

Hypothesis testing and entropies of quantum channels

Xiao Yuan

Hypothesis testing is an important task in mathematics and physics. Hypothesis testing of two random variables is related to the Kullback-Leibler divergence of the two corresponding distributions. Similarly, quantum hypothesis testing of two quantum states is characterized by the quantum relative entropy. While a quantum state can be abstracted as a device that only has outputs but no inputs, the most general quantum device is a quantum channel that also has inputs. In this work, we extend hypothesis testing to general quantum channels. In both the one-shot and asymptotic scenario, we study several quantifiers for hypothesis testing under different assumptions of how the channels are used. As the quantifiers are analogs to the quantum relative entropy of states, we call them the quantum relative entropy of channels. Then, we define the entropy of channels based on relative entropies from the target channel to the completely depolarizing channel. We investigate the properties that the quantum relative entropy of channels should satisfy, and we study its interplay with entanglement. With the broad applications of the quantum relative entropy of states, our results can be useful for understanding general properties of quantum channels.

arXiv:1807.05958•Physical Review A•Mar 14, 2019•39 citations

Classical and Quantum Information Measures Characterizing Convertibility: An Axiomatic Approach

Frits Verhagen

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.

quant-pharXiv:2610.16267•Oct 13, 2026•0 citations

Reversible Framework for Quantum Resource Theories

Fernando G. S. L. Brandão, Gilad Gour

In recent years it has been recognized that properties of physical systems such as entanglement, athermality, and asymmetry, can be viewed as resources for important tasks in quantum information, thermodynamics, and other areas of physics. This recognition was followed by the development of specific quantum resource theories (QRTs), such as entanglement theory, determining how quantum states that cannot be prepared under certain restrictions may be manipulated and used to circumvent the restrictions. Here we discuss the general structure of QRTs, and show that under a few assumptions (such as convexity of the set of free states), a QRT is asymptotically reversible if its set of allowed operations is maximal, that is, if the allowed operations are the set of all operations that do not generate (asymptotically) a resource. In this case, the asymptotic conversion rate is given in terms of the regularized relative entropy of a resource which is the unique measure or quantifier of the resource in the asymptotic limit of many copies of the state. This measure also equals the smoothed version of the logarithmic robustness of the resource.

arXiv:1502.03149•Physical Review Letters•Aug 14, 2015•375 citations

The Proper Formula for Relative Entropy and its Asymptotics in Quantum Probability

Fumio Hiai, Dėnes Petz

Umegaki's relative entropy S(ω, φ) = Tr D ω ( log D ω − log D φ ) (of states ω and φ with density operators D ω and D φ , respectively) is shown to be an asymptotic exponent considered from the quantum hypothesis testing viewpoint. It is also proved that some other versions of the relative entropy give rise to the same asymptotics as Umegaki's one. As a byproduct, the inequality Tr A log AB ≥ Tr A( log A + log B) is obtained for positive definite matrices A and B.

WORLD SCIENTIFIC eBooks•Feb 1, 2005•6 citations

From asymptotic hypothesis testing to entropy inequalities

Christoph Hirche

This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-$2$ entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.

arXiv:1812.05142•Dec 12, 2018•4 citations
The aim of the present paper is to give axiomatic characterization of quantum relative entropy utilizing resource conversion scenario. We consider two sets of axioms: non-asymptotic and asymptotic. In the former setting, we prove that the upperbound and the lowerbund of DQ(ρ∣∣σ)\mathrm{D}^{Q}(ρ||σ) DQ(ρ∣∣σ) is DR(ρ∣∣σ):=tr\mathrm{D}^{R}(ρ||σ) :=\mathrm{tr}% \,ρ\ln\sqrtρσ^{-1}\sqrtρDR(ρ∣∣σ):=tr and D(ρ∣∣σ):=\mathrm{D}(ρ||σ) :=D(ρ∣∣σ):= tr ρ(ln⁡ρ−ln⁡σ)\mathrm{tr}\,ρ(\lnρ-\lnσ) trρ(lnρ−lnσ), respectively. In the latter setting, we prove uniqueness of quantum relative entropy, that is, DQ(ρ∣∣σ)\mathrm{D}^{Q}(ρ||σ) DQ(ρ∣∣σ) should equal a constant multiple of D(ρ∣∣σ)\mathrm{D}(ρ||σ) D(ρ∣∣σ). In the analysis, we define and use reverse test and asymptotic reverse test, which are natural inverse of hypothesis test.
The aim of the present paper is to give axiomatic characterization of quantum relative entropy utilizing resource conversion scenario. We consider two sets of axioms: non-asymptotic and asymptotic. In the former setting, we prove that the upperbound and the lowerbund of D^{Q}(ρ||σ) is D^{R}(ρ||σ):=trρlnσ^{1/2}ρ^{-1}σ^{1/2} and D(ρ||σ):= trρ(lnρ-lnσ), respectively. In the latter setting, we prove uniqueness of quantum relative entropy, that is, D^{Q}(ρ||σ) should equal a constant multiple of D(ρ||σ). In the analysis, we define and use reverse test and asymptotic reverse test, which are natural inverse of hypothesis test.
Hypothesis testing is an important task in mathematics and physics. Hypothesis testing of two random variables is related to the Kullback-Leibler divergence of the two corresponding distributions. Similarly, quantum hypothesis testing of two quantum states is characterized by the quantum relative entropy. While a quantum state can be abstracted as a device that only has outputs but no inputs, the most general quantum device is a quantum channel that also has inputs. In this work, we extend hypothesis testing to general quantum channels. In both the one-shot and asymptotic scenario, we study several quantifiers for hypothesis testing under different assumptions of how the channels are used. As the quantifiers are analogs to the quantum relative entropy of states, we call them the quantum relative entropy of channels. Then, we define the entropy of channels based on relative entropies from the target channel to the completely depolarizing channel. We investigate the properties that the quantum relative entropy of channels should satisfy, and we study its interplay with entanglement. With the broad applications of the quantum relative entropy of states, our results can be useful for understanding general properties of quantum channels.
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.
In recent years it has been recognized that properties of physical systems such as entanglement, athermality, and asymmetry, can be viewed as resources for important tasks in quantum information, thermodynamics, and other areas of physics. This recognition was followed by the development of specific quantum resource theories (QRTs), such as entanglement theory, determining how quantum states that cannot be prepared under certain restrictions may be manipulated and used to circumvent the restrictions. Here we discuss the general structure of QRTs, and show that under a few assumptions (such as convexity of the set of free states), a QRT is asymptotically reversible if its set of allowed operations is maximal, that is, if the allowed operations are the set of all operations that do not generate (asymptotically) a resource. In this case, the asymptotic conversion rate is given in terms of the regularized relative entropy of a resource which is the unique measure or quantifier of the resource in the asymptotic limit of many copies of the state. This measure also equals the smoothed version of the logarithmic robustness of the resource.
This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-222 entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.