The inequalities of quantum information theory
Author:
- 15 April 2003
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 49 (4) , 773-789
Abstract
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/.Keywords
This publication has 11 references indexed in Scilit:
- On characterization of entropy function via information inequalitiesIEEE Transactions on Information Theory, 1998
- A framework for linear information inequalitiesIEEE Transactions on Information Theory, 1997
- A non-Shannon-type conditional inequality of information quantitiesIEEE Transactions on Information Theory, 1997
- Polymatroidal dependence structure of a set of random variablesInformation and Control, 1978
- Nonnegative entropy measures of multivariate symmetric correlationsInformation and Control, 1978
- Proof of the strong subadditivity of quantum-mechanical entropyJournal of Mathematical Physics, 1973
- Entropy inequalitiesCommunications in Mathematical Physics, 1970
- Mean Entropy of States in Quantum-Statistical MechanicsJournal of Mathematical Physics, 1968
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948
- Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmenMathematische Annalen, 1907