Related papers: More on a trace inequality in quantum information …

Let $\phi$ be a linear map from the $n\times n$ matrices ${\mathcal M}_n$ to the $m\times m$ matrices ${\mathcal M}_m$. It is known that $\phi$ is $2$-positive if and only if for all $K\in {\mathcal M}_n$ and all strictly positive $X\in…

In this paper, we aim to replace in the definitions of covariance and correlation the usual trace {\rm Tr} by a tracial positive map between unital $C^*$-algebras and to replace the functions $x^{\alpha}$ and $x^{1-\alpha}$ by functions $f$…

Let $\mathcal{A}$ be a unital $C^\ast$-algebra equipped with a faithful tracial positive linear functional $\tau$. Denote by $\mathcal{A}_+$ its positive cone. For $p>0$ and $A,B\in\mathcal{A}_+$, we consider the operations $$ A\kappa_p B…

This paper formulates Young-type inequalities for singular values (or $s$-numbers) and traces in the context of von Neumann algebras. In particular, it shown that if $\t(\cdot)$ is a faithful semifinite normal trace on a semifinite von…

We provide a class of positive and trace-preserving maps based on symmetric measurements. From these positive maps we present separability criteria, entanglement witnesses, as well as the lower bounds of concurrence. We show by detailed…

Quantum information theory has generated several interesting conjectures involving products of completely positive maps on matrix algebras, also known as quantum channels. In particular it is conjectured that the output state with maximal…

With techniques borrowed from quantum information theory, we develop a method to systematically obtain operator inequalities and identities in several matrix variables. These take the form of trace polynomials: polynomial-like expressions…

We explain how a slight variant in the use of our recursive algorithm leads to improve the known lower bounds for the absolute trace of a totally positive algebraic integer. We also link the absolute trace of a totally positive algebraic…

In information theory, the well-known log-sum inequality is a fundamental tool which indicates the non-negativity for the relative entropy. In this article, we establish a set of inequalities which are similar to the log-sum inequality…

This article provides sufficient conditions for positive maps on the Schatten classes $\mathcal J_{p}, 1\le p<\infty$ of bounded operators on a separable Hilbert space such that a corresponding Perron-Frobenius theorem holds. With…

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…

Let $A$ be a positive semidefinite $m\times m$ block matrix with each block $n$-square, then the following determinantal inequality for partial traces holds \[ (\mathrm{tr} A)^{mn} - \det(\mathrm{tr}_2 A)^n \ge \bigl| \det A -…

We give necessary and sufficient conditions in order that inequalities of the type $$ \| T_K f\|_{L^q(d\mu)}\leq C \|f\|_{L^p(d\sigma)}, \qquad f \in L^p(d\sigma), $$ hold for a class of integral operators $T_K f(x) = \int_{R^n} K(x, y)…

Quantum information methods have been brought to bear on high-energy physics, including the study of entanglement and Bell nonlocality in collider experiments. Quantum information observables have also been employed to constrain possible…

We consider the following trace function on n-tuples of positive operators: \Phi_p(A_1,A_2,...,A_n) = Trace (\sum_{j=1}^n A_j^p)^{1/p} and prove that it is jointly concave for 0<p\le 1 and convex for p=2. We then derive from this a…

We investigate the evolution of open quantum systems in the presence of initial correlations with an environment. Here the standard formalism of describing evolution by completely positive trace preserving (CPTP) quantum operations can fail…

Computing $p \rightarrow q$ norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing $p \rightarrow q $ norm for a matrix with nonnegative entries. Here we define an…

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…

A class of quantum channels and completely positive maps (CPMs) are introduced and investigated. These, which we call subspace preserving (SP) CPMs has, in the case of trace preserving CPMs, a simple interpretation as those which preserve…

Recently, a new multi-step temporal learning algorithm, called $Q(\sigma)$, unifies $n$-step Tree-Backup (when $\sigma=0$) and $n$-step Sarsa (when $\sigma=1$) by introducing a sampling parameter $\sigma$. However, similar to other…