Physics 4999E Final: 12

• School: Western University
• Department: Physics
• Course: Physics 4999E
• Professor: john stockholm

Document Summary

Cs 766/qic 820 theory of quantum information (fall 2011) In this lecture we will prove holevo"s theorem. This is a famous theorem in quantum information theory, which is often informally summarized by a statement along the lines of this: It is not possible to communicate more than n classical bits of information by the transmission of n qubits alone. Although this is an implication of holevo"s theorem, the theorem itself says more, and is stated in more precise terms that has no resemblance to the above statement. Holevo"s theorem, we will discuss an interesting application of this theorem to the notion of a quantum random access code. In particular, we will prove nayak"s bound, which demonstrates that quantum random access codes are surprisingly limited in power. We will rst discuss some of the concepts that holevo"s theorem concerns, and then state and prove the theorem itself.