Abstract

Consider a function F(X, Y) of pairs of positive matrices with values in the positive matrices such that whenever X and Y commute $$F(X,Y)= X^pY^q.$$ Our first main result gives conditions on F such that $$\mathrm{Tr}[ X \log (F(Z,Y))] \le \mathrm{Tr}[X(p\log X + q \log Y)]$$ for all X, Y, Z such that $$\mathrm{Tr}Z =\mathrm{Tr}X$$ . (Note that Z is absent from the right side of the inequality.) We give several examples of functions F to which the theorem applies. Our theorem allows us to give simple proofs of the well known logarithmic inequalities of Hiai and Petz and several new generalizations of them which involve three variables X, Y, Z instead of just X, Y alone. The investigation of these logarithmic inequalities is closely connected with three quantum relative entropy functionals: The standard Umegaki quantum relative entropy $$D(X||Y) = \mathrm{Tr}[X(\log X-\log Y])$$ , and two others, the Donald relative entropy $$D_D(X||Y)$$ , and the Belavkin–Stasewski relative entropy $$D_{BS}(X||Y)$$ . They are known to satisfy $$D_D(X||Y) \le D(X||Y)\le D_{BS}(X||Y)$$ . We prove that the Donald relative entropy provides the sharp upper bound, independent of Z on $$\mathrm{Tr}[ X \log (F(Z,Y))]$$ in a number of cases in which F(Z, Y) is homogeneous of degree 1 in Z and −1 in Y. We also investigate the Legendre transforms in X of $$D_D(X||Y)$$ and $$D_{BS}(X||Y)$$ , and show how our results about these Legendre transforms lead to new refinements of the Golden–Thompson inequality.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.