Searcharxiv⌕ Search

arXiv subjects

Koenraad M. R. Audenaert

Publications and source records attributed to Koenraad M. R. Audenaert.

At least 37 records · Page 2Linked to original sources
arXiv2011

On norm sub-additivity and super-additivity inequalities for concave and convex functions

Sub-additive and super-additive inequalities for concave and convex functions have been generalized to the case of matrices by several authors over a period of time. These lead to some interesting inequalities for matrices, which in some cases coincide with, and in other cases are at variance with the corresponding inequalities for real numbers. We survey some of these matrix inequalities and do further investigations into these. We introduce the novel notion of dominated majorization between the spectra of two Hermitian matrices $B$ and $C$, dominated by a third Hermitian matrix $A$. Based on an explicit formula for the gradient of the sum of the $k$ largest eigenvalues of a Hermitian matrix, we show that under certain conditions dominated majorization reduces to a linear majorization-like relation between the diagonal elements of $B$ and $C$ in a certain basis. We use this notion as a tool to give new, elementary proofs for the sub-additivity inequality for non-negative concave functions first proved by Bourin and Uchiyama and the corresponding super-additivity inequality for non-negative convex functions first proven by Kosem. Finally, we present counterexamples to some conjectures that Ando's inequality for operator convex functions could more generally hold, e.g.\ for ordinary convex, non-negative functions.

math.FA↗
arXiv2011

Telescopic Relative Entropy

We introduce the telescopic relative entropy (TRE), which is a new regularisation of the relative entropy related to smoothing, to overcome the problem that the relative entropy between pure states is either zero or infinity and therefore useless as a distance measure in this case. We study basic properties of this quantity, and find interesting relationships between the TRE and the trace norm distance. We then exploit the same techniques to obtain a new and shorter proof of a lower bound on the relative Renyi entropies in terms of the trace norm distance, $\traceρ^{1-p}σ^p \ge 1-(||ρ-σ||_1)/2$.

math-ph↗
arXiv2011

Telescopic Relative Entropy--II Triangle inequalities

In previous work (see arxiv:1102.3040), we have defined the telescopic relative entropy (TRE), which is a regularisation of the quantum relative entropy $S(ρ||σ)=\traceρ(\logρ-\logσ)$, by replacing the second argument $σ$ by a convex combination of the first and the second argument, $τ=aρ+(1-a)σ$ and dividing the result by $-\log a$. We also explored some basic properties of the TRE. In this follow-up paper we state and prove two upper bounds on the variation of the TRE when either the first or the second argument changes. These bounds are close in spirit to a triangle inequality. For the ordinary relative entropy no such bounds are possible due to the fact that the variation could be infinite.

math-ph↗
arXiv2011

A Characterisation of Anti-Lowner Functions

According to a celebrated result by Löwner, a real-valued function $f$ is operator monotone if and only if its Löwner matrix, which is the matrix of divided differences $L_f=(\frac{f(x_i)-f(x_j)}{x_i-x_j})_{i,j=1}^N$, is positive semidefinite for every integer $N>0$ and any choice of $x_1,x_2,...,x_N$. In this paper we answer a question of R. Bhatia, who asked for a characterisation of real-valued functions $g$ defined on $(0,+\infty)$ for which the matrix of divided sums $K_g=(\frac{g(x_i)+g(x_j)}{x_i+x_j})_{i,j=1}^N$, which we call its anti-Löwner matrix, is positive semidefinite for every integer $N>0$ and any choice of $x_1,x_2,...,x_N\in(0,+\infty)$. Such functions, which we call anti-Löwner functions, have applications in the theory of Lyapunov-type equations.

math.FA↗
arXiv2010

In-betweenness: a geometric monotonicity property for operator means

We introduce the notions of in-betweenness and monotonicity with respect to a metric, for operator means. These notions can be seen as generalising their natural counterpart for scalar means, and as a relaxation of the notion of geodesity. We exhibit two classes of non-trivial means that are monotonic with respect to the Euclidean metric. We also show that all Kubo-Ando means are monotonic with respect to the trace metric, which is the natural metric for the geometric mean.

math.FA↗
arXiv2010

Impressions of convexity - An illustration for commutator bounds

We determine the sharpest constant $C_{p,q,r}$ such that for all complex matrices $X$ and $Y$, and for Schatten $p$-, $q$- and $r$-norms the inequality $$ \|XY-YX\|_p\leq C_{p,q,r}\|X\|_q\|Y\|_r $$ is valid. The main theoretical tool in our investigations is complex interpolation theory.

math.FA↗
arXiv2009

Variance bounds, with an application to norm bounds for commutators

Murthy and Sethi (Sankhya Ser B \textbf{27}, 201--210 (1965)) gave a sharp upper bound on the variance of a real random variable in terms of the range of values of that variable. We generalise this bound to the complex case and, more importantly, to the matrix case. In doing so, we make contact with several geometrical and matrix analytical concepts, such as the numerical range, and introduce the new concept of radius of a matrix. We also give a new and simplified proof for a sharp upper bound on the Frobenius norm of commutators recently proven by Böttcher and Wenzel (Lin.\ Alg. Appl. \textbf{429} (2008) 1864--1885) and point out that at the heart of this proof lies exactly the matrix version of the variance we have introduced. As an immediate application of our variance bounds we obtain stronger versions of Böttcher and Wenzel's upper bound.

math.FA↗
arXiv2009

Quantum Tomographic Reconstruction with Error Bars: a Kalman Filter Approach

We present a novel quantum tomographic reconstruction method based on Bayesian inference via the Kalman filter update equations. The method not only yields the maximum likelihood/optimal Bayesian reconstruction, but also a covariance matrix expressing the measurement uncertainties in a complete way. From this covariance matrix the error bars on any derived quantity can be easily calculated. This is a first step towards the broader goal of devising an omnibus reconstruction method that could be adapted to any tomographic setup with little effort and that treats measurement uncertainties in a statistically well-founded way. In this first part we restrict ourselves to the important subclass of tomography based on measurements with discrete outcomes (as opposed to continuous ones), and we also ignore any measurement imperfections (dark counts, less than unit detector efficiency, etc.), which will be treated in a follow-up paper. We illustrate our general theory on real tomography experiments of quantum optical information processing elements.

quant-ph↗
arXiv2008

A Lieb-Thirring inequality for singular values

Let $A$ and $B$ be positive semidefinite matrices. We investigate the conditions under which the Lieb-Thirring inequality can be extended to singular values. That is, for which values of $p$ does the majorisation $σ(B^p A^p) \prec_w σ((BA)^p)$ hold, and for which values its reversed inequality $σ(B^p A^p) \succ_w σ((BA)^p)$.

math.FA↗
arXiv2008

Inverse moments of univariate discrete distributions via the Poisson expansion

In this note we present a series expansion of inverse moments of a non-negative discrete random variate in terms of its factorial cumulants, based on the Poisson-Charlier expansion of a discrete distribution. We apply the general method to the positive binomial distribution and obtain a convergent series for its inverse moments with an error residual that is uniformly bounded on the entire interval 0<=p<=1.

math.ST↗
arXiv2007

On Random Unitary Channels

In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure between a given CPT map and the set of random unitary maps, and methods for calculating it. In this way one could determine whether non-classical error mechanisms such as spontaneous decay or photon loss dominate over classical uncertainties, for example in a phase parameter. The present paper is a step towards achieving this goal.

quant-ph↗
arXiv2007

Notes on multiplicativity of maximal output purity for completely positive qubit maps

A problem in quantum information theory that has received considerable attention in recent years is the question of multiplicativity of the so-called maximal output purity (MOP) of a quantum channel. This quantity is defined as the maximum value of the purity one can get at the output of a channel by varying over all physical input states, when purity is measured by the Schatten $q$-norm, and is denoted by $ν_q$. The multiplicativity problem is the question whether two channels used in parallel have a combined $ν_q$ that is the product of the $ν_q$ of the two channels. A positive answer would imply a number of other additivity results in QIT. Very recently, P. Hayden has found counterexamples for every value of $q>1$. Nevertheless, these counterexamples require that the dimension of these channels increases with $1-q$ and therefore do not rule out multiplicativity for $q$ in intervals $[1,q_0)$ with $q_0$ depending on the channel dimension. I argue that this would be enough to prove additivity of entanglement of formation and of the classical capacity of quantum channels. More importantly, no counterexamples have as yet been found in the important special case where one of the channels is a qubit-channel, i.e. its input states are 2-dimensional. In this paper I focus attention to this qubit case and I rephrase the multiplicativity conjecture in the language of block matrices and prove the conjecture in a number of special cases.

quant-ph↗
arXiv2007

Subadditivity of q-entropies for q>1

I prove a basic inequality for Schatten q-norms of quantum states on a finite-dimensional bipartite Hilbert space H_1\otimes H_2: 1+||ρ||_q \ge ||\trace_1ρ||_q + ||\trace_2ρ||_q. This leads to a proof--in the finite dimensional case--of Raggio's conjecture (G.A. Raggio, J. Math. Phys.\ \textbf{36}, 4785--4791 (1995)) that the q-entropies S_q(ρ)=(1-\trace[ρ^q])/(q-1) are subadditive for q > 1; that is, for any state ρ, S_q(ρ) is not greater than the sum of the S_q of its reductions, S_q(ρ) \le S_q(\trace_1ρ)+S_q(\trace_2ρ).

math-ph↗
arXiv2007

On Ando's inequalities for convex and concave functions

For positive semidefinite matrices $A$ and $B$, Ando and Zhan proved the inequalities $||| f(A)+f(B) ||| \ge ||| f(A+B) |||$ and $||| g(A)+g(B) ||| \le ||| g(A+B) |||$, for any unitarily invariant norm, and for any non-negative operator monotone $f$ on $[0,\infty)$ with inverse function $g$. These inequalities have very recently been generalised to non-negative concave functions $f$ and non-negative convex functions $g$, by Bourin and Uchiyama, and Kosem, respectively. In this paper we consider the related question whether the inequalities $||| f(A)-f(B) ||| \le ||| f(|A-B|) |||$, and $||| g(A)-g(B) ||| \ge ||| g(|A-B|) |||$, obtained by Ando, for operator monotone $f$ with inverse $g$, also have a similar generalisation to non-negative concave $f$ and convex $g$. We answer exactly this question, in the negative for general matrices, and affirmatively in the special case when $A\ge ||B||$. In the course of this work, we introduce the novel notion of $Y$-dominated majorisation between the spectra of two Hermitian matrices, where $Y$ is itself a Hermitian matrix, and prove a certain property of this relation that allows to strengthen the results of Bourin-Uchiyama and Kosem, mentioned above.

math.FA↗
arXiv2007

On the Araki-Lieb-Thirring inequality

We prove an inequality that complements the famous Araki-Lieb-Thirring (ALT) inequality for positive matrices $A$ and $B$, by giving a lower bound on the quantity $\trace[A^r B^r A^r]^q$ in terms of $\trace[ABA]^{rq}$ for $0\le r\le 1$ and $q\ge0$, whereas the ALT inequality gives an upper bound. The bound contains certain norms of $A$ and $B$ as additional ingredients and is therefore of a different nature than the Kantorovich type inequality obtained by Bourin (\textit{Math. Inequal. Appl.} \textbf{8}(2005) pp. 373--378) and others. Secondly, we also prove a generalisation of the ALT inequality to general matrices.

math.FA↗
arXiv2007

On a Norm Compression Inequality for 2XN Partitioned Block Matrices

We conjecture the following so-called norm compression inequality for $2\times N$ partitioned block matrices and the Schatten $p$-norms: for $p\ge 2$, $$ ||({array}{cccc} A_1 & A_2 & ... & A_N B_1 & B_2 & >... & B_N {array})||_p \le ||({array}{cccc} ||A_1||_p & ||A_2||_p & ... & ||A_N||_p \ ||B_1||_p & ||B_2||_p & ... & ||B_N||_p {array})||_p $$ while for $1\le p\le 2$ the ordering of the inequality is reversed. This inequality includes Hanner's inequality for matrices as a special case. We prove several special cases of this inequality and give examples for $3\times 3$ and larger partitionings where it does not hold.

math.FA↗
arXiv2006

A Sharp Fannes-type Inequality for the von Neumann Entropy

We derive an inequality relating the entropy difference between two quantum states to their trace norm distance, sharpening a well-known inequality due to M. Fannes. In our inequality, equality can be attained for every prescribed value of the trace norm distance.

quant-ph↗