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

WORLD SCIENTIFIC eBooks

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

Fumio Hiai, Dėnes Petz

Published Feb 1, 2005• 6 citations
Publisher

Abstract

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.

DOI
10.1142/9789812563071_0004

Related papers

Quantum Stein's lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb

Igor Bjelaković, Rainer Siegmund‐Schultze

We derive the monotonicity of the quantum relative entropy by an elementary operational argument based on Stein's lemma in quantum hypothesis testing. For the latter we present an elementary and short proof that requires the law of large numbers only. Joint convexity of the quantum relative entropy is proven too, resulting in a self-contained elementary version of Tropp's approach to Lieb's concavity theorem, according to which the map tr(exp(h+log a)) is concave in a on positive operators for self-adjoint h.

arXiv:quant-ph/0307170•Jul 24, 2003•29 citations

On the Relation between Kullback Divergence and Fisher Information: From Classical Systems to Quantum Systems

Hiroshi Nagaoka

Kullback divergence D(p ∥ q) for a couple of probability distributions {p, q} and Fisher information J(θ) for a parametric family of probability distributions {p θ } are very important notions in the classical theory of statistical inference. Quantum analogues of these notions are known as Umegaki's relative entropy D(ρ ‖ σ) for a couple of density operators {ρ, σ} and the quantum Fisher information J(θ) based on the pymmetric logarithmic derivatives for a parametric family of density operators {ρ Θ }. In the classical case, the relation holds, which connects the asymptotic theory of hypothesis testing and that of parameter estimation. In the quantum case, the relation defines , which is not equal to J(θ) in general and is another quantum analogue of Fisher information. We show the inequality and elucidate its meaning in connection with the statistical inference for quantum states.

WORLD SCIENTIFIC eBooks•Feb 1, 2005•8 citations

Asymptotics of quantum relative entropy from a representation theoretical viewpoint

Masahito Hayashi

In this paper it is proved that the quantum relative entropy D (ρ||σ) can be asymptotically attained by the relative entropy of probabilities given by a certain sequence of positive-operator-valued measures (POVMs). The sequence of POVMs depends on σ, but is independent of the choice of ρ.

arXiv:quant-ph/9704040•Journal of Physics A Mathematical and General•Apr 10, 2001•50 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

Rényi relative entropies of quantum Gaussian states

Kaushik P. Seshadreesan, Ludovico Lami, Mark M. Wilde

The quantum Rényi relative entropies play a prominent role in quantum information theory, finding applications in characterizing error exponents and strong converse exponents for quantum hypothesis testing and quantum communication theory. On a different thread, quantum Gaussian states have been intensely investigated theoretically, motivated by the fact that they are more readily accessible in the laboratory than are other, more exotic quantum states. In this paper, we derive formulas for the quantum Rényi relative entropies of quantum Gaussian states. We consider both the traditional (Petz) Rényi relative entropy as well as the more recent sandwiched Rényi relative entropy, finding formulas that are expressed solely in terms of the mean vectors and covariance matrices of the underlying quantum Gaussian states. Our development handles the hitherto elusive case for the Petz–Rényi relative entropy when the Rényi parameter is larger than one. Finally, we also derive a formula for the max-relative entropy of two quantum Gaussian states, and we discuss some applications of the formulas derived here.

arXiv:1706.09885•Journal of Mathematical Physics•Jul 1, 2018•40 citations

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
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.
We derive the monotonicity of the quantum relative entropy by an elementary operational argument based on Stein's lemma in quantum hypothesis testing. For the latter we present an elementary and short proof that requires the law of large numbers only. Joint convexity of the quantum relative entropy is proven too, resulting in a self-contained elementary version of Tropp's approach to Lieb's concavity theorem, according to which the map tr(exp(h+log a)) is concave in a on positive operators for self-adjoint h.
Kullback divergence D(p ∥ q) for a couple of probability distributions {p, q} and Fisher information J(θ) for a parametric family of probability distributions {p θ } are very important notions in the classical theory of statistical inference. Quantum analogues of these notions are known as Umegaki's relative entropy D(ρ ‖ σ) for a couple of density operators {ρ, σ} and the quantum Fisher information J(θ) based on the pymmetric logarithmic derivatives for a parametric family of density operators {ρ Θ }. In the classical case, the relation holds, which connects the asymptotic theory of hypothesis testing and that of parameter estimation. In the quantum case, the relation defines , which is not equal to J(θ) in general and is another quantum analogue of Fisher information. We show the inequality and elucidate its meaning in connection with the statistical inference for quantum states.
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.
The quantum Rényi relative entropies play a prominent role in quantum information theory, finding applications in characterizing error exponents and strong converse exponents for quantum hypothesis testing and quantum communication theory. On a different thread, quantum Gaussian states have been intensely investigated theoretically, motivated by the fact that they are more readily accessible in the laboratory than are other, more exotic quantum states. In this paper, we derive formulas for the quantum Rényi relative entropies of quantum Gaussian states. We consider both the traditional (Petz) Rényi relative entropy as well as the more recent sandwiched Rényi relative entropy, finding formulas that are expressed solely in terms of the mean vectors and covariance matrices of the underlying quantum Gaussian states. Our development handles the hitherto elusive case for the Petz–Rényi relative entropy when the Rényi parameter is larger than one. Finally, we also derive a formula for the max-relative entropy of two quantum Gaussian states, and we discuss some applications of the formulas derived here.
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.