Related papers: On trace inequalities and their applications to no…

We prove a matrix trace inequality for completely monotone functions and for Bernstein functions. As special cases we obtain non-trivial trace inequalities for the power function x->x^q, which for certain values of q complement McCarthy's…

Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering,…

We give a sufficient and necessary condition for a probability measure $\mu$ on the real line to satisfy the logarithmic Sobolev inequality for convex functions. The condition is expressed in terms of the unique left-continuous and…

It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…

Some inequalities for quantum f-divergence of trace class operators in Hilbert spaces are obtained. It is shown that for normalised convex functions it is nonnegative. Some upper bounds for quantum f-divergence in terms of variational and…

We prove a trace Hardy type inequality with the best constant on the polyhedral convex cones which generalizes recent results of Alvino et al. and of Tzirakis on the upper half space. We also prove some trace Hardy-Sobolev-Maz'ya type…

Let $A$ be an $m\times m$ positive semidefinite block matrix with each block being $n$-square. We write $\mathrm{tr}_1$ and $\mathrm{tr}_2$ for the first and second partial trace, respectively. In this paper, we prove the following…

This note provides a succinct proof of a 1973 theorem of Lieb that establishes the concavity of a certain trace function. The development relies on a deep result from quantum information theory, the joint convexity of quantum relative…

In this note we generalize the trace inequality derived by [1] to the case where the number of terms of the sum (denoted by K) is arbitrary.

One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix--the minimum rank of a matrix which is entrywise close to the…

We prove several trace inequalities that extend the Golden-Thompson and the Araki-Lieb-Thirring inequality to arbitrarily many matrices. In particular, we strengthen Lieb's triple matrix inequality. As an example application of our four…

We study matrix inequalities involving partial traces for positive semidefinite block matrices. First of all, we present a new method to prove a celebrated result of Choi [Linear Algebra Appl. 516 (2017)]. Our method also allows us to prove…

We establish that trace inequalities $$\|D^{k-1}u\|_{L^{\frac{n-s}{n-1}}(\mathbb{R}^{n},d\mu)} \leq c \|\mu\|_{L^{1,n-s}(\mathbb{R}^{n})}^{\frac{n-1}{n-s}}\|\mathbb{A}[D]u\|_{L^{1}(\mathbb{R}^{n},d\mathscr{L}^{n})}$$ hold for vector fields…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

A measure of quantum non-Markovianity for an open system dynamics, based on revivals of the distinguishability between system states, has been introduced in the literature using the trace distance as quantifier for distinguishability.…

We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every…

In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of quantum covering-type problems, such as soft covering,…

We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite length regime and is strong enough to demonstrate…

Quantum functional inequalities (e.g. the logarithmic Sobolev- and Poincar\'e inequalities) have found widespread application in the study of the behavior of primitive quantum Markov semigroups. The classical counterparts of these…

Holevo introduced a fidelity between quantum states that is symmetric and as effective as the trace norm in evaluating their similarity. This fidelity is bounded by a function of the trace norm, a relationship to which we will refer as…