In this paper we investigate quantum Hellinger type divergences which were studied by Bhatia-Gaubert-Jain (2019), Pitrik-Virosztek (2020), and Dinh-Lie-Osaka-Phan (2025). In particular, when [Formula: see text] is a convex function defined by the form [Formula: see text] ([Formula: see text]) and [Formula: see text] is an operator monotone function with [Formula: see text], we introduce the quantum quantitative measure [Formula: see text] for positive definite matrices [Formula: see text] and [Formula: see text], and show that [Formula: see text] is a quantum divergence in the sense of Bhatia-Gaubert-Jain and also show that it is jointly convex and satisfies the data processing property by a trace preserving positive unital map [Formula: see text], that is, [Formula: see text].
In this paper, we introduce new quantum divergences of the form Φ(A,B)=Tr(AσB−AτB),A,B>0,where σ and τ are Kubo–Ando operator means such that σ≥τ. More precisely, we show that Φ(A,B) is a quantum divergence when σ is the weighted Kubo–Ando matrix power mean and τ is the weighted geometric mean. In addition, we construct a new quantum Hellinger-type divergence using the linear approximation of the function x. We also study the least-squares problem, the data processing inequality, and in-betweenness property of the matrix means with respect to the quantum Hellinger-type divergence.
In this paper, we study a matrix equation involving the matrix geometric mean
A♮tB=A1/2(A−1/2BA−1/2)tA1/2, t∈(1,2) . We study several properties and inequalities for the unique solution of such an equation. We also use the weighted geometric mean
A♮tB to define a new quantum Hellinger divergence and show that the new quantum divergence satisfies the Data Processing Inequality.
Bhatia, Lim, and Yamazaki studied the norm minimality of several Kubo-Ando means of positive semidefinite matrices. Recently, Hiai proved a norm minimality result involving the the weighted geometric mean A♯1−αB=A1/2(A−1/2BA−1/2)1−αA1/2, 0≤α≤1 and its ‘naïve’ extension given by Qα,z(A,B)=(B1−α2zAαzB1−α2z)z, which is a matrix function in the definition of the quantum α-z-Rényi divergence. In connection to these results, for positive semidefinite matrices, we show that the inequality ∥A+B+2rA♯1−αB∥p≤∥A+B+2rQα,z(A,B)∥p, holds for p = 1, 2, α=1,z, and r≥0, among other related inequalities.
A notion of divergence is a very important and useful tool to measure the difference between probability distributions or between data (information). We consider a quantum divergence constructed by the difference of two-variable weighted arithmetic and harmonic means on the open convex cone of positive definite Hermitian matrices, called the arithmetic-harmonic quantum divergence. We see its invariance properties and study the barycenter minimizing the weighted sum of arithmetic-harmonic quantum divergences to given variables. We provide the lower bound for the barycenter of the arithmetic-harmonic quantum divergence in terms of Loewner order and its upper bound in terms of operator norm.
We introduce the geodesic quantum
f-divergences
Dft,
0≤t≤1, obtained from the affine-invariant geodesic between the standard and maximal relative modular operators. They reduce to the classical
f-divergence for commuting states. The logarithmic generator yields geodesic relative entropies joining the Umegaki and Belavkin-Staszewski entropies, while the power generators yield
(t,α)-Rényi divergences joining the Petz and geometric families.
Our first main result is data processing of
Dft for every finite operator-convex generator
f and every
t∈[0,1]. In particular, this gives DPI for the geodesic relative entropies and for the
(t,α)-Rényi divergences when
0<α<1 or
1<α≤2. Our second main result identifies equality in the DPI: for invertible states, every equality-determining operator-convex generator has, at each nonmaximal parameter
0≤t<1, exactly the Petz sufficiency class; at
t=1, this changes to the generally larger maximal, or BS, class, which also coincides with the equality class of the divergences associated with the quadratic generator for every
t. Our third main result is the corresponding collapse of invertible geodesic quantum Markov chains: for each of the three ordered conditional-mutual-information constructions, the
t-quantum Markov chains are precisely the quantum Markov chains for
0≤t<1, whereas at
t=1 they are the invertible BS quantum Markov chains, a class that can be strictly larger.
We also determine parameter-monotonicity regimes and the intersections with the
(α,z) family. We prove strengthened data-processing and reconstruction estimates; we compare the three conditional orientations; we establish continuity bounds under positive lower-eigenvalue assumptions together with complementary discontinuity results; and we give a capacity-per-unit-cost interpretation.