Holevo's Theorem

Holevo's theorem is an important limitative theorem in quantum computing, an interdisciplinary field of physics and computer science. It is sometimes called Holevo's bound, since it establishes an upper bound to the amount of information that can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973.

Statement of the theorem

Suppose Alice wants to send a classical message to Bob by encoding it into a quantum state, and suppose she can prepare a state from some fixed set $\$, with the i-th state prepared with probability $p_i$. Let $X$ be the classical register containing the choice of state made by Alice. Bob's objective is to recover the value of $X$ from measurement results on the state he received. Let $Y$ be the classical register containing Bob's measurement outcome. Note that $Y$ is therefore a random variable whose probability distribution depends on Bob's choice of measurement.

Holevo's theorem bounds the amount of correlation between the classical registers $X$ and $Y$, regardless of Bob's measurement choice, in terms of the ''Holevo information''. This is useful in practice because the Holevo information does not depend on the measurement choice, and therefore its computation does not require performing an optimization over the possible measurements.

More precisely, define the ''accessible information'' between $X$ and $Y$ as the (classical) mutual information between the two registers maximized over all possible choices of measurements on Bob's side:$I_(X:Y) = \sup_ I(X:Y, \_i),$where $I(X:Y, \_i)$ is the (classical) mutual information of the joint probability distribution given by $p_ = p_i \operatorname(\Pi^B_j \rho_i)$. There is currently no known formula to analytically solve the optimization in the definition of accessible information in the general case. Nonetheless, we always have the upper bound:$I_ (X : Y) \leq \chi(\eta) \equiv S\left(\sum_i p_i \rho_i\right) - \sum_i p_i S(\rho_i),$where $\eta\equiv\_i$ is the ensemble of states Alice is using to send information, and $S$ is the von Neumann entropy. This $\chi(\eta)$ is called the Holevo information or Holevo ''χ'' quantity.

Note that the Holevo information also equals the quantum mutual information of the classical-quantum state corresponding to the ensemble:$\chi(\eta) = I\left(\sum_i p_i , i\rangle\!\langle i, \otimes \rho_i\right),$with $I(\rho_) \equiv S(\rho_A)+S(\rho_B) - S(\rho_)$ the quantum mutual information of the bipartite state $\rho_$. It follows that Holevo's theorem can be concisely summarized as a bound on the accessible information in terms of the quantum mutual information for classical-quantum states.

Proof

Consider the composite system that describes the entire communication process, which involves Alice's classical input $X$, the quantum system $Q$, and Bob's classical output $Y$. The classical input $X$ can be written as a classical register $\rho^X := \sum\nolimits_^n p_x , x\rangle \langle x,$ with respect to some orthonormal basis $\_^n$. By writing $X$ in this manner, the von Neumann entropy $S(X)$ of the state $\rho^X$ corresponds to the Shannon entropy $H(X)$ of the probability distribution $\_^n$:
:$S(X) = -\operatorname\left(\rho^X \log \rho^X \right) = -\operatorname\left(\sum_^n p_x \log p_x , x\rangle\langle x, \right) = -\sum_^n p_x \log p_x = H(X).$

The initial state of the system, where Alice prepares the state $\rho_x$ with probability $p_x$, is described by
:$\rho^ := \sum_^n p_x , x\rangle \langle x, \otimes\rho_x.$

Afterwards, Alice sends the quantum state to Bob. As Bob only has access to the quantum system $Q$ but not the input $X$, he receives a mixed state of the form $\rho := \operatorname_X\left(\rho^\right) = \sum\nolimits_^n p_x \rho_x$. Bob measures this state with respect to the POVM elements $\_^m$, and the probabilities $\_^m$ of measuring the outcomes $y=1,2,\dots,m$ form the classical output $Y$. This measurement process can be described as a quantum instrument
:$\mathcal^(\rho_x) = \sum_^m q_ \rho_ \otimes , y\rangle \langle y, ,$
where $q_ = \operatorname\left(E_y\rho_x\right)$ is the probability of outcome $y$ given the state $\rho_x$, while $\rho_ = W\sqrt\rho_x\sqrtW^\dagger/q_$ for some unitary $W$ is the normalised post-measurement state. Then, the state of the entire system after the measurement process is
:\rho^ := \left mathcal^\otimes\mathcal^\right!\left(\rho^\right) = \sum_^n\sum_^m p_x q_ , x\rangle \langle x, \otimes\rho_\otimes , y\rangle \langle y, .

Here $\mathcal^X$ is the identity channel on the system $X$. Since $\mathcal^Q$ is a quantum channel, and the quantum mutual information is monotonic under completely positive trace-preserving maps, $S(X:Q'Y) \leq S(X:Q)$. Additionally, as the partial trace over $Q'$ is also completely positive and trace-preserving, $S(X:Y) \leq S(X:Q'Y)$. These two inequalities give
:$S(X:Y) \leq S(X:Q).$

On the left-hand side, the quantities of interest depend only on
:$\rho^ := \operatorname_\left(\rho^\right) = \sum_^n\sum_^m p_x q_ , x\rangle \langle x, \otimes , y\rangle \langle y, = \sum_^n\sum_^m p_ , x,y\rangle \langle x,y, ,$
with joint probabilities $p_=p_x q_$. Clearly, $\rho^$ and $\rho^Y := \operatorname_X(\rho^)$, which are in the same form as $\rho^X$, describe classical registers. Hence,
:$S(X:Y) = S(X)+S(Y)-S(XY) = H(X)+H(Y)-H(XY) = I(X:Y).$

Meanwhile, $S(X:Q)$ depends on the term
:$\log \rho^ = \log\left(\sum_^n p_x , x\rangle \langle x, \otimes\rho_x\right) = \sum_^n , x\rangle \langle x, \otimes \log\left(p_x\rho_x\right) = \sum_^n \log p_x , x\rangle \langle x, \otimes I^Q + \sum_^n , x\rangle \langle x, \otimes \log\rho_x,$
where $I^Q$ is the identity operator on the quantum system $Q$. Then, the right-hand side is
:$\begin S(X:Q) &= S(X)+S(Q)-S(XQ) \\ &= S(X) + S(\rho) + \operatorname\left(\rho^\log\rho^\right) \\ &= S(X) + S(\rho) + \operatorname\left(\sum_^n p_x\log p_x , x\rangle \langle x, \otimes \rho_x\right) + \operatorname\left(\sum_^n p_x, x\rangle \langle x, \otimes \rho_x\log\rho_x\right)\\ &= S(X) + S(\rho) + \underbrace_ + \operatorname\left(\sum_^n p_x \rho_x\log\rho_x\right)\\ &= S(\rho) + \sum_^n p_x \underbrace_ \\ &= S(\rho) - \sum_^n p_x S(\rho_x), \end$
which completes the proof.

Comments and remarks

In essence, the Holevo bound proves that given ''n'' qubits, although they can "carry" a larger amount of (classical) information (thanks to quantum superposition), the amount of classical information that can be ''retrieved'', i.e. ''accessed'', can be only up to ''n'' classical (non-quantum encoded) bits. It was also established, both theoretically and experimentally, that there are computations where quantum bits carry more information through the process of the computation than is possible classically.

See also

* Superdense coding

References

Further reading

*
* (see page 531, subsection 12.1.1 - equation (12.6) )
* . See in particular Section 11.6 and following. Holevo's theorem is presented as exercise 11.9.1 on page 288.

{{Quantum computing

Quantum mechanical entropy
Quantum information theory
Limits of computation