Searcharxiv⌕ Search

arXiv subjects

Koenraad M. R. Audenaert

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

At least 19 recordsLinked to original sources

alpha-z-relative Renyi entropies

We consider a two-parameter family of Rényi relative entropies $D_{α,z}(ρ||σ)$ that are quantum generalisations of the classical Rényi divergence $D_α(p||q)$. This family includes many known relative entropies (or divergences) such as the quantum relative entropy, the recently defined quantum Rényi divergences, as well as the quantum Rényi relative entropies. All its members satisfy the quantum generalizations of Rényi's axioms for a divergence. We consider the range of the parameters $α,z$ for which the data processing inequality holds. We also investigate a variety of limiting cases for the two parameters, obtaining explicit formulas for each one of them.

quant-ph↗

A generalisation of Mirsky's singular value inequalities

We prove an f-version of Mirsky's singular value inequalities for differences of matrices. This f-version consists in applying a positive concave function f, with f(0)=0, to every singular value in the original Mirsky inequalities.

math.FA↗

Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination

We consider the multiple hypothesis testing problem for symmetric quantum state discrimination between r given states σ_1,...,σ_r. By splitting up the overall test into multiple binary tests in various ways we obtain a number of upper bounds on the optimal error probability in terms of the binary error probabilities. These upper bounds allow us to deduce various bounds on the asymptotic error rate, for which it has been hypothesised that it is given by the multi-hypothesis quantum Chernoff bound (or Chernoff divergence) C(σ_1,...,σ_r), as recently introduced by Nussbaum and Szkoła in analogy with Salikhov's classical multi-hypothesis Chernoff bound. This quantity is defined as the minimum of the pairwise binary Chernoff divergences min_{j<k}C(σ_j,σ_k). It was known already that the optimal asymptotic rate must lie between C/3 and C, and that for certain classes of sets of states the bound is actually achieved. It was known to be achieved, in particular, when the state pair that is closest together in Chernoff divergence is more than 6 times closer than the next closest pair. Our results improve on this in two ways. Firstly, we show that the optimal asymptotic rate must lie between C/2 and C. Secondly, we show that the Chernoff bound is already achieved when the closest state pair is more than 2 times closer than the next closest pair. We also show that the Chernoff bound is achieved when at least $r-2$ of the states are pure, improving on a previous result by Nussbaum and Szkoła. Finally, we indicate a number of potential pathways along which a proof (or disproof) may eventually be found that the multi-hypothesis quantum Chernoff bound is always achieved.

quant-ph↗

On a Block Matrix Inequality quantifying the Monogamy of the Negativity of Entanglement

We convert a conjectured inequality from quantum information theory, due to He and Vidal, into a block matrix inequality and prove a special case. Given $n$ matrices $A_i$, $i=1,\ldots,n$, of the same size, let $Z_1$ and $Z_2$ be the block matrices $Z_1:=(A_jA_i^*)_{i,j=1}^n$ and $Z_2:=(A_j^*A_i)_{i,j=1}^n$. Then the conjectured inequality is \[ \left(||Z_1||_1-\trace Z_1\right)^2 + \left(||Z_2||_1-\trace Z_2\right)^2 \le \left(\sum_{i\neq j} ||A_i||_2 ||A_j||_2\right)^2. \] We prove this inequality for the already challenging case $n=2$ with $A_1$ equal to the identity matrix.

math.FA↗

Quantum Skew Divergence

In this paper we study the quantum generalisation of the skew divergence, which is a dissimilarity measure between distributions introduced by L. Lee in the context of natural language processing. We provide an in-depth study of the quantum skew divergence, including its relation to other state distinguishability measures. Finally, we present a number of important applications: new continuity inequalities for the quantum Jensen-Shannon divergence and the Holevo information, and a new and short proof of Bravyi's Small Incremental Mixing conjecture.

math-ph↗

Quantitative entanglement witnesses

Entanglement witnesses provide tools to detect entanglement in experimental situations without the need of having full tomographic knowledge about the state. If one estimates in an experiment an expectation value smaller than zero, one can directly infer that the state has been entangled, or specifically multi-partite entangled, in the first place. In this article, we emphasize that all these tests - based on the very same data - give rise to quantitative estimates in terms of entanglement measures: "If a test is strongly violated, one can also infer that the state was quantitatively very much entangled". We consider various measures of entanglement, including the negativity, the entanglement of formation, and the robustness of entanglement, in the bipartite and multipartite setting. As examples, we discuss several experiments in the context of quantum state preparation that have recently been performed.

quant-ph↗

Comparisons between quantum state distinguishability measures

We provide a compendium of inequalities between several quantum state distinguishability measures. For each measure these inequalities consist of the sharpest possible upper and lower bounds in terms of another measure. Some of these inequalities are already known, but new or more general proofs are given, whereas other inequalities are new. We also supply cases of equality to show that all inequalities are indeed the sharpest possible.

quant-ph↗

On matrix inequalities between the power means: counterexamples

We prove that the known sufficient conditions on the real parameters $(p,q)$ for which the matrix power mean inequality $((A^p+B^p)/2)^{1/p}\le((A^q+B^q)/2)^{1/q}$ holds for every pair of matrices $A,B>0$ are indeed best possible. The proof proceeds by constructing $2\times2$ counterexamples. The best possible conditions on $(p,q)$ for which $Φ(A^p)^{1/p}\leΦ(A^q)^{1/q}$ holds for every unital positive linear map $Φ$ and $A>0$ are also clarified.

math.FA↗

On the asymmetry of the relative entropy

The quantum relative entropy $S(ρ||σ)$ is a widely used dissimilarity measure between quantum states, but it has the peculiarity of being asymmetric in its arguments. We quantify the amount of asymmetry by providing a sharp upper bound in terms of two parameters: the trace norm distance between the two states, and the smallest of the smallest eigenvalues of both states. The bound is essentially the asymmetry between two binary distributions governed by these two parameters.

math-ph↗

Schur multiplier norms for Loewner matrices

We study upper bounds on the Schur multiplier norm of Loewner matrices for concave and convex functions. These bounds then immediately lead to upper bounds on the ratio of Schatten $q$-norms of commutators $||\;[A,f(B)]\;||_q/||\;[A,B]\;||_q$. We also consider operator monotone functions, for which sharper bounds are obtained.

math.FA↗

Quantum state discrimination bounds for finite sample size

In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of two given and completely known states, rho or sigma. In general, it is not possible to decide the identity of the true state with certainty, and the optimal measurement strategy depends on whether the two possible errors (mistaking rho for sigma, or the other way around) are treated as of equal importance or not. Results on the quantum Chernoff and Hoeffding bounds and the quantum Stein's lemma show that, if several copies of the system are available then the optimal error probabilities decay exponentially in the number of copies, and the decay rate is given by a certain statistical distance between rho and sigma (the Chernoff distance, the Hoeffding distances, and the relative entropy, respectively). While these results provide a complete solution to the asymptotic problem, they are not completely satisfying from a practical point of view. Indeed, in realistic scenarios one has access only to finitely many copies of a system, and therefore it is desirable to have bounds on the error probabilities for finite sample size. In this paper we provide finite-size bounds on the so-called Stein errors, the Chernoff errors, the Hoeffding errors and the mixed error probabilities related to the Chernoff and the Hoeffding errors.

quant-ph↗

An Araki-Lieb-Thirring inequality for geometrically concave and geometrically convex functions

For positive definite matrices $A$ and $B$, the Araki-Lieb-Thirring inequality amounts to an eigenvalue log-submajorisation relation for fractional powers $$λ(A^t B^t) \prec_{w(\log)} λ^t(AB), \quad 0<t\le 1,$$ while for $t\ge1$, the reversed inequality holds. In this paper I generalise this inequality, replacing the fractional powers $x^t$ by a larger class of functions. Namely, a continuous, non-negative, geometrically concave function $f$ with domain $\dom(f)=[0,x_0)$ for some positive $x_0$ (possibly infinity) satisfies $$λ(f(A) f(B)) \prec_{w(\log)} f^2(λ^{1/2}(AB)),$$ for all positive semidefinite $A$ and $B$ with spectrum in $\dom(f)$, if and only if $0\le xf'(x)\le f(x)$ for all $x\in\dom(f)$. The reversed inequality holds for continuous, non-negative, geometrically convex functions if and only if they satisfy $xf'(x)\ge f(x)$ for all $x\in\dom(f)$. As an application I derive a complementary inequality to the Golden-Thompson inequality.

math.FA↗

Continuity bounds on the quantum relative entropy - II

The quantum relative entropy is frequently used as a distance measure between two quantum states, and inequalities relating it to other distance measures are important mathematical tools in many areas of quantum information theory. We have derived many such inequalities in our previous work (K.M.R. Audenaert and J. Eisert, J. Math. Phys. 46, 102104 (2005)). The present paper is a follow-up on this, and provides sharp upper bounds on the relative entropy in terms of the trace norm distance and of the smallest eigenvalues of both states concerned. The results obtained here are more general than the corresponding one from our previous work, and also corrects a mistake in one of its proofs. As a by-product, we obtain a sharp upper bound on the regularised relative entropy introduced by Lendi, Farhadmotamed and van Wonderen.

math-ph↗