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

Operators and Matrices

On an inequality conjectured by Besenyei and Petz

Ayca Ileri, Selçuk Demir

Published Jan 1, 2022• 0 citations
Publisher

Abstract

In this paper we investigate the inequality Tr(T I 2 ) 12 (log q 12log q 1 I 2 -I 1 log q 2 ) 0 , where 12 is a density matrix and 0 T M m (C) . This inequality was conjectured by Besenyei and Petz in 2013, where it was proved to hold for the density matrices in M 2 (C) M 2 (C) . Here we prove this inequality for the density matrices in M m (C) M n (C) using some elementary matrix methods. We also obtain some new inequalities related to the operators (matrices) in this inequality.

DOI
10.7153/oam-2022-16-23

Related papers

Some trace inequalities for exponential and logarithmic functions

Eric A. Carlen, Élliott H. Lieb

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)=XpYq. Our first main result gives conditions on F such that Tr[X log(F(Z,Y))]≤Tr[X(p log X+q log Y)] for all X,Y,Z such that TrZ=TrX. (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)=Tr[X(log X− log Y]), and two others, the Donald relative entropy DD(X∥Y), and the Belavkin–Stasewski relative entropy DBS(X∥Y). They are known to satisfy DD(X∥Y)≤D(X∥Y)≤DBS(X∥Y). We prove that the Donald relative entropy provides the sharp upper bound, independent of Z on 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 DD(X∥Y) and DBS(X∥Y), and show how our results for these lead to new refinements of the Golden–Thompson inequality.

Bulletin of Mathematical Sciences•May 29, 2018•4 citations

Interpolation functions and inequalities

Hiroyuki Osaka, Yoichi Udagawa

Using interpolation classes and the generalized Petz's trace inequality we give a new matrix inequality which might play an important role in the quantum information theory: For any pair of positive definite matrices A,B∈Mn(C) we have Tr⁡((A−B)(exp⁡(A)−exp⁡(B))≤Tr⁡(|A(exp⁡(A)−1)−B(exp⁡(B)−1)|).

Linear and Multilinear Algebra•Mar 18, 2021•0 citations

Some Trace Inequalities of Quantum Information

Bo Liu

Aim: Supposebe Si be 2×2 is density matrix,π={πi}ni=1 is any a probability distribution,and A(s)≡∑i=1 n πiS11+si is invertible,for any 0≤s≤1,H(x)=-xlogx,and then Tr[A(s)s{∑j=1 n πjS11+sj(logS11+sj)2}-A(s)-1+s{∑j=1 n πjH(S11+sj)}2]≥0 which is a generalization of an inequality proved by K.Yanagi and others.Method: These problems are settled by applying Caushy-schwarz inequality,Jensen's inequality and some property of trace.Results: These inequalities related matrix logarithm give partial answer of the open problem posed by Yanagi.Conclusion: Some further studies on this base will been done because the results of those trace inequalities is just one case.

•Jan 1, 2010•0 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

More on a trace inequality in quantum information theory

Naresh Kumar Sharma

It is known that for a completely positive and trace preserving (cptp) map ${\cal N}$, $\text{Tr}$ $\exp$$\{ \log σ$ $+$ ${\cal N}^\dagger [\log {\cal N}(ρ)$ $-\log {\cal N}(σ)] \}$ $\leqslant$ $\text{Tr}$ $ρ$ when $ρ$, $σ$, ${\cal N}(ρ)$, and ${\cal N}(σ)$ are strictly positive. We state and prove a relevant version of this inequality for the hitherto unaddressed case of these matrices being nonnegative. Our treatment also provides an alternate proof for the strictly positive case.

arXiv:1512.00226•Dec 1, 2015•2 citations

Proof of a Conjectured 0-Rényi Entropy Inequality With Applications to Multipartite Entanglement

Zhiwei Song, Lin Chen, Yize Sun +1 more

Characterizing the relations among the three bipartite reduced density operators$ \rho _{AB}$,$ \rho _{AC}$and$ \rho _{BC}$of a tripartite mixed state$ \rho _{ABC}$has been an open problem in quantum information. One of such relations has been reduced by [Cadney et al, LAA. 452, 153, 2014] to a conjectured inequality in terms of matrix rank, namely$r(\rho _{AB}) \cdot r( \rho _{AC})\ge r( \rho _{BC})$for any$ \rho _{ABC}$. It is denoted as open problem 41 in the website “Open quantum problems-IQOQI Vienna”. We prove the inequality, and thus establish a complete picture of the four-party linear inequalities in terms of the 0-entropy. Our proof is based on the construction of a novel canonical form of bipartite matrices under local equivalence. We extend our result to inequalities in multipartite systems, as well as the condition when the inequality is saturated.

arXiv:2105.07679•IEEE Transactions on Information Theory•Dec 9, 2022•9 citations
In this paper we investigate the inequality Tr(T I 2 ) 12 (log q 12log q 1 I 2 -I 1 log q 2 ) 0 , where 12 is a density matrix and 0 T M m (C) . This inequality was conjectured by Besenyei and Petz in 2013, where it was proved to hold for the density matrices in M 2 (C) M 2 (C) . Here we prove this inequality for the density matrices in M m (C) M n (C) using some elementary matrix methods. We also obtain some new inequalities related to the operators (matrices) in this inequality.
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)=XpYq. Our first main result gives conditions on F such that Tr[X log(F(Z,Y))]≤Tr[X(p log X+q log Y)] for all X,Y,Z such that TrZ=TrX. (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)=Tr[X(log X− log Y]), and two others, the Donald relative entropy DD(X∥Y), and the Belavkin–Stasewski relative entropy DBS(X∥Y). They are known to satisfy DD(X∥Y)≤D(X∥Y)≤DBS(X∥Y). We prove that the Donald relative entropy provides the sharp upper bound, independent of Z on 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 DD(X∥Y) and DBS(X∥Y), and show how our results for these lead to new refinements of the Golden–Thompson inequality.
Aim: Supposebe Si be 2×2 is density matrix,π={πi}ni=1 is any a probability distribution,and A(s)≡∑i=1 n πiS11+si is invertible,for any 0≤s≤1,H(x)=-xlogx,and then Tr[A(s)s{∑j=1 n πjS11+sj(logS11+sj)2}-A(s)-1+s{∑j=1 n πjH(S11+sj)}2]≥0 which is a generalization of an inequality proved by K.Yanagi and others.Method: These problems are settled by applying Caushy-schwarz inequality,Jensen's inequality and some property of trace.Results: These inequalities related matrix logarithm give partial answer of the open problem posed by Yanagi.Conclusion: Some further studies on this base will been done because the results of those trace inequalities is just one case.
It is known that for a completely positive and trace preserving (cptp) map N{\cal N}N, Tr\text{Tr}Tr exp⁡\expexp{log⁡σ\{ \log σ{logσ +++ N†[log⁡N(ρ){\cal N}^\dagger [\log {\cal N}(ρ)N†[logN(ρ) −log⁡N(σ)]}-\log {\cal N}(σ)] \}−logN(σ)]} ⩽\leqslant⩽ Tr\text{Tr}Tr ρρρ when ρρρ, σσσ, N(ρ){\cal N}(ρ)N(ρ), and N(σ){\cal N}(σ)N(σ) are strictly positive. We state and prove a relevant version of this inequality for the hitherto unaddressed case of these matrices being nonnegative. Our treatment also provides an alternate proof for the strictly positive case.
Characterizing the relations among the three bipartite reduced density operators$ \rho _{AB},,, \rho _{AC}andandand \rho _{BC}ofatripartitemixedstateof a tripartite mixed stateofatripartitemixedstate \rho _{ABC}hasbeenanopenprobleminquantuminformation.Oneofsuchrelationshasbeenreducedby[Cadneyetal,LAA.452,153,2014]toaconjecturedinequalityintermsofmatrixrank,namelyhas been an open problem in quantum information. One of such relations has been reduced by [Cadney et al, LAA. 452, 153, 2014] to a conjectured inequality in terms of matrix rank, namelyhasbeenanopenprobleminquantuminformation.Oneofsuchrelationshasbeenreducedby[Cadneyetal,LAA.452,153,2014]toaconjecturedinequalityintermsofmatrixrank,namelyr(\rho _{AB}) \cdot r( \rho _{AC})\ge r( \rho _{BC})foranyfor anyforany \rho _{ABC}$. It is denoted as open problem 41 in the website “Open quantum problems-IQOQI Vienna”. We prove the inequality, and thus establish a complete picture of the four-party linear inequalities in terms of the 0-entropy. Our proof is based on the construction of a novel canonical form of bipartite matrices under local equivalence. We extend our result to inequalities in multipartite systems, as well as the condition when the inequality is saturated.