World Library  
Flag as Inappropriate
Email this Article

Holevo's theorem

 

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 which can be known about a quantum state (accessible information). It was published by Alexander Holevo in 1973.

Contents

  • Accessible Information 1
  • Statement of the theorem 2
  • Proof 3
  • Comments and remarks 4
  • Footnotes 5
  • See also 6
  • References 7
  • External links 8

Accessible Information

As for several concepts in quantum information theory, accessible information is best understood in terms of a 2-party communication. So we introduce two parties, Alice and Bob. Alice has a classical random variable X, which can take the values {1, 2, ..., n} with corresponding probabilities {p1, p2, ..., pn}. Alice then prepares a quantum state, represented by the density matrix ρX chosen from a set {ρ1, ρ2, ... ρn}, and gives this state to Bob. Bob's goal is to find the value of X, and in order to do that, he performs a measurement on the state ρX, obtaining a classical outcome, which we denote with Y. In this context, the amount of accessible information, that is, the amount of information that Bob can get about the variable X, is the maximum value of the mutual information I(X : Y) between the random variables X and Y over all the possible measurements that Bob can do.[1]

There is currently no known formula to compute the accessible information. There are however several upper bounds, the best-known of which is the Holevo bound, which is specified in the following theorem.[1]

Statement of the theorem

Let {ρ1, ρ2, ..., ρn} be a set of mixed states and let ρX be one of these states drawn according to the probability distribution P = {p1, p2, ..., pn}.

Then, for any measurement described by POVM elements {EY} and performed on \rho= \sum_X p_X \rho_X, the amount of accessible information about the variable X knowing the outcome Y of the measurement is bounded from above as follows:

I(X:Y) \leq S(\rho) - \sum_i p_i S(\rho_i)

where \rho = \sum_i p_i \rho_i and S(\cdot) is the von Neumann entropy.

The quantity on the right hand side of this inequality is called the Holevo information or Holevo χ quantity:

\chi := S(\rho) - \sum_i p_i S(\rho_i) .

Proof

The proof can be given using three quantum systems, called P, Q, M. P can be intuitively thought as the preparation, Q can be thought as the quantum state prepared by Alice and given to Bob, and M can be thought as Bob's measurement apparatus.

The compound system P \otimes Q \otimes M at the beginning is in the state

\rho^{PQM} := \sum_x p_x |x\rangle \langle x| \otimes \rho_x \otimes |0\rangle \langle0|

This can be thought as Alice having the value x for the random variable X. Then the preparation state is the mixed state described by the density matrix \sum_x p_x |x\rangle \langle x|, and the quantum state given to Bob is \sum_x p_x \rho_x, and Bob's measurement apparatus is in its initial or rest state |0\rangle . Using known results of quantum information theory it can be shown that

S(P';M') \leq S(P;Q)

which, after some algebraic manipulation, can be shown to be equivalent to the statement of the theorem.[1]

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. This is surprising, for two reasons: (1) quantum computing is so often more powerful than classical computing, that results which show it to be only as good or inferior to conventional techniques are unusual, and (2) because it takes 2^n-1 complex numbers to encode the qubits which represent a mere n bits.

Footnotes

  1. ^ a b c Nielsen & Chuang (2000)

See also

References

  •  
  • (see page 531, subsection 12.1.1 - equation (12.6) )  
  • Wilde, Mark M. (2011). "From Classical to Quantum Shannon Theory". . See in particular Section 11.6 and following. Holevo's theorem is presented as exercise 11.9.1 on page 288.  

External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.