Let be a quantum channelcompletely positive and trace-preserving map
on a finite-dimensional Hilbert space , and let .
The Holevo capacity of is defined as
where supremum is over ensembles of quantum states and probability distributions . The HSW theorem (Holevo 1998; Schumacher and Westmoreland 1997) states that the product state classical capacity of a quantum channel is given by its Holevo capacity, thus providing the quantity with an operational meaning. It is well known that that the supremum may be restricted to ensembles of at most pure states; in fact, this is exercise 12.11 in the classic textbook (Nielsen and Chuang 2009).
To me, it’s not obvious how to prove this fact. Before discussing further, let us write the expression in a slightly different way. We can split up the supremum over all ensembles by first optimizing over the “average state” , and then over the ensemble of distributions yielding that fixed average state, by writing where is the set of density matrices on , the notation means , and we write for convenience. Since the first term only depends on the average state, we have Moreover, since is concave, we can restrict the infimum to pure state ensembles. However, not all pure state ensembles are the same; may act very differently on one pure state compared to on another. To this point, note that the eigendecomposition of the average state gives a pure state ensemble of size , but in the end we will only find a restriction to pure state ensembles of size , not (so it’s not because smaller ensembles don’t exist!). That the statement involves states suggests a use of Carathéodory’s theorem; after all, we can see self-adjoint operators on as a -dimensional real vector space, and density matrices as an affine hyperplane in the set of self-adjoint operators (with dimension as an affine space). Carathéodory’s theorem then tells us that any density matrix can be written as a convex combination of pure states, since the density matrices are the convex hull of the pure states. But the task remains to show that such a decomposition achieves the infimum in It turns out the relevant property of this quantity is that it is the convex roof of a continuous function (namely ). Let us sketch the proof of (Uhlmann 2010) (see also (Uhlmann 1997)) showing that indeed, the above quantity is maximized on some pure state ensemble of size at most .
Define where the infimum is taken over pure state ensembles of any size. To show that the supremum in the Holevo capacity can be restricted to pure state ensembles of size at most , it suffices to show that this infimum can be achieved by a ensemble with only terms, i.e.
Recall the following facts and definitions about a compact convex set . Here, (Simon 2011, chap. 8)which can also be found here
is a useful reference.
- A face of is a closed subset of such that if and are such that , then too. A proper face is one which is not equal to itself.
- Extreme points of are faces that are singletons.
- The extreme points of a face of are simply the extreme points of that also lie in .
- For any point , the relative boundary, for some proper face .
- An affine subspace of is a set of the form where is a vector subspace of and is a vector. The dimension of an affine subspace is the dimension of its associated vector space. Every convex set in has a unique affine subspace of so that as a subset of , has nonempty interior. The dimension of a convex set is the dimension of its associated affine subspace.
- The dimension of a proper face of is strictly smaller than the dimension of .
- Minkowski-Carathéodory theorem: if is compact and convex with dimension , then any point in is a convex combination of at most extreme points.
With these facts in hand, we proceed to sketch the proof of (eq. 2), following (Uhlmann 2010). In the following, is the set of self-adjoint operators on , and the set of pure states on .
Proof sketch:
- We recall is a compact, convex subset of , which is a real vector space of dimension . As a convex set, is of dimension .
- We enlarge by one dimension, yielding , and define is compact, using that is compact, and that is continuous on .
- Then is a compact convex set of dimension , whose extreme points are .
- By construction, for , we have
- Thus , the relative boundary of .
- Since is a convex, a point on the boundary of lies on one of it’s (proper) faces, , which is a convex set of dimension at most .
- Since , it can be written as a convex combination of elements of , using the Minkowski-Carathéodory theorem (and that the extreme points of are also extreme points of ). That is, Comparing each component, we see and thus we have identified a decomposition of with terms such that .
Note: in (1997), Uhlmann takes a slightly different approach; instead of explicitly adding a dimension, in that work he encodes the same information in the “tracial dimension” by fixing a reference state and considering instead of the pair . I chose his later approach (that of (2010)), since it accomplishes the same task more explicitly.
References
Holevo, A. S. 1998. “The Capacity of the Quantum Channel with General Signal States.” IEEE Transactions on Information Theory 44 (1): 269–73. https://doi.org/10.1109/18.651037.
Nielsen, Michael A., and Isaac L. Chuang. 2009. Quantum Computation and Quantum Information. Cambridge University Press. https://doi.org/10.1017/cbo9780511976667.
Schumacher, Benjamin, and Michael D. Westmoreland. 1997. “Sending Classical Information via Noisy Quantum Channels.” Physical Review A 56 (1): 131–38. https://doi.org/10.1103/PhysRevA.56.131.
Simon, Barry. 2011. Convexity: An Analytic Viewpoint. Cambridge Tracts in Mathematics 187. Cambridge, UK ; New York: Cambridge University Press.
Uhlmann, Armin. 1997. “Optimizing Entropy Relative to a Channel or a Subalgebra.” arXiv:Quant-Ph/9701014, January. http://arxiv.org/abs/quant-ph/9701014.
———. 2010. “Roofs and Convexity.” Entropy 12 (7): 1799–1832. https://doi.org/10.3390/e12071799.