arXiv:0705.1276 · Journal of Mathematical Physics

Subadditivity of q-entropies for q>1

Koenraad M. R. Audenaert

Published Aug 1, 2007• 78 citations

Abstract

I prove a basic inequality for Schatten q-norms of quantum states on a finite-dimensional bipartite Hilbert space H1⊗H2: 1+∥ρ∥q⩾∥Tr1ρ∥q+∥Tr2ρ∥q. This leads to a proof—in the finite-dimensional case—of Raggio’s conjecture [G. A. Raggio, J. Math. Phys. 36, 4785 (1995)] that the q-entropies Sq(ρ)=(1−Tr[ρq])∕(q−1) are subadditive for q>1; that is, for any state ρ, Sq(ρ) is not greater than the sum of the Sq of its reductions, Sq(ρ)⩽Sq(Tr1ρ)+Sq(Tr2ρ).

DOI: 10.1063/1.2771542

Related papers

Some inequalities for quantum Tsallis entropy related to the strong subadditivity

Dėnes Petz, Dániel Virosztek

In this paper we investigate the inequality Sq(ρ123) + Sq(ρ2) ≤ Sq(ρ12) + Sq(ρ23) (∗) where ρ123 is a state on a finite dimensional Hilbert space H1 ⊗ H2 ⊗ H3, and Sq is the Tsallis entropy. It is well-known that the strong subadditivity of the von Neumnann entropy can be derived from the monotonicity of the Umegaki relative entropy. Now, we present an equivalent form of (*), which is an inequality of relative quasi-entropies. We derive an inequality of the form Sq(ρ123) + Sq(ρ2) ≤ Sq(ρ12) + Sq(ρ23) + fq(ρ123), where f1(ρ123) = 0. Such a result can be considered as a generalization of the strong subadditivity of the von Neumnann entropy. One can see that (*) does not hold in general (a picturesque example is included in this paper), but we give a sufficient condition for this inequality, as well.

Jan 1, 201518 citations

Structure of states saturating an another version of strong subadditivity

Lin Zhang

Strong subadditivity inequality of quantum entropy, proved by Lieb and Ruskai, is a powerful tool in quantum information theory. The fact that the strong subadditivity inequality saturated only by a so-called Markov states is obtained in the recent literature [P. Hayden et al., Commun. Math. Phys. 246, 359 (2004).]. In this report, we will give a characterization to an another equivalent version of strong subadditivity inequality. The possible applications are discussed.

Sep 25, 20120 citations

Properties of q-entropies

G. A. Raggio

Basic properties of the q-entropy Sq[ρ]=(q−1)−1(1−tr(ρq)) (0<q≠1) for states of a quantum system are established: concavity, quasi-convexity, continuity, and failure of ‘‘additivity’’ and ‘‘subadditivity’’ for composite systems.

Journal of Mathematical PhysicsSep 1, 199587 citations

Superadditivity of the convex closure of the output entropy of a quantum channel

Максим Евгеньевич Широков

One of the main recent achievements of quantum information theory [1] is the proof of the equivalence of several (sub-, super-) additivity conjectures for finite-dimensional quantum channels and systems [2] (see the survey in [3]). The main purpose of this paper is to give a generalization of this result to the infinite-dimensional case. Let H and H ′ be separable Hilbert spaces. A quantum channel is a linear completely positive trace-preserving map Φ: T(H ) 7→ T(H ′), where T(H ) is the ideal of all trace class operators on H . In particular, Φ generates an affine map of the convex set S(H ) of states (that is, density operators) on the space H to the set S(H ′) of states on the space H ′ [1]. Important characteristics of a quantum channel are the output entropy HΦ(ρ) = H(Φ(ρ)), a lower-semicontinuous concave function on the input state space with values in [0,+∞], and its convex closure (see [4]), denoted by b HΦ(ρ) and called the b H-function of the channel Φ. It was shown in [5] that the convex closure of the output entropy of an arbitrary quantum channel Φ is given by the expression b HΦ(ρ) = inf μ Z

Russian Mathematical SurveysDec 31, 20062 citations

Inequalities for quantum entropy: A review with conditions for equality

Mary Beth Ruskai

This article presents self-contained proofs of the strong subadditivity inequality for von Neumann’s quantum entropy, S(ρ), and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, which is based on Klein’s inequality and Lieb’s theorem that the function A→Tr eK+log A is concave, allows one to obtain conditions for equality. In the case of strong subadditivity, which states that S(ρ123)+S(ρ2)⩽S(ρ12)+S(ρ23) where the subscripts denote subsystems of a composite system, equality holds if and only if log ρ123=log ρ12−log ρ2+log ρ23. Using the fact that the Holevo bound on the accessible information in a quantum ensemble can be obtained as a consequence of the monotonicity of relative entropy, we show that equality can be attained for that bound only when the states in the ensemble commute. The article concludes with an Appendix giving a short description of Epstein’s elegant proof of Lieb’s theorem.

arXiv:quant-ph/0205064Journal of Mathematical PhysicsSep 1, 2002185 citations

The inequalities of quantum information theory

Nicholas J. Pippenger

Let /spl rho/ denote the density matrix of a quantum state having n parts 1, ..., n. For I/spl sube/N={1, ..., n}, let /spl rho//sub I/=Tr/sub N/spl bsol/I/(/spl rho/) denote the density matrix of the state comprising those parts i such that i/spl isin/I, and let S(/spl rho//sub I/) denote the von Neumann (1927) entropy of the state /spl rho//sub I/. The collection of /spl nu/=2/sup n/ numbers {S(/spl rho//sub I/)}/sub I/spl sube/N/ may be regarded as a point, called the allocation of entropy for /spl rho/, in the vector space R/sup /spl nu//. Let A/sub n/ denote the set of points in R/sup /spl nu// that are allocations of entropy for n-part quantum states. We show that A~/sub n/~ (the topological closure of A/sub n/) is a closed convex cone in R/sup /spl nu//. This implies that the approximate achievability of a point as an allocation of entropy is determined by the linear inequalities that it satisfies. Lieb and Ruskai (1973) have established a number of inequalities for multipartite quantum states (strong subadditivity and weak monotonicity). We give a finite set of instances of these inequalities that is complete (in the sense that any valid linear inequality for allocations of entropy can be deduced from them by taking positive linear combinations) and independent (in the sense that none of them can be deduced from the others by taking positive linear combinations). Let B/sub n/ denote the polyhedral cone in R/sup /spl nu// determined by these inequalities. We show that A~/sub n/~=B/sub n/ for n/spl les/3. The status of this equality is open for n/spl ges/4. We also consider a symmetric version of this situation, in which S(/spl rho//sub I/) depends on I only through the number i=/spl ne/I of indexes in I and can thus be denoted S(/spl rho//sub i/). In this case, we give for each n a finite complete and independent set of inequalities governing the symmetric allocations of entropy {S(/spl rho//sub i/)}/sub 0/spl les/i/spl les/n/ in R/sup n+1/.

IEEE Transactions on Information TheoryApr 1, 2003106 citations