Holevo's theorem

Key takeaways

Holevo's theorem belongs to physics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Holevo's theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Holevo's theorem from memory before moving on to harder problems.

Reference excerpt

Holevo's theorem is a result in quantum information theory. It is sometimes called Holevo's bound, since it gives an upper bound on the accessible information, which is amount of information that can be known about a quantum state. It was first published by Alexander Holevo in 1973.

Statement

Setting 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 { ρ 1 , . . . , ρ n } {\displaystyle \{\rho _{1},...,\rho _{n}\}} , with the i-th state prepared with probability p i {\displaystyle p_{i}} . Let X {\displaystyle X} be the classical register containing the choice of state made by Alice. Bob's objective is to recover the value of X {\displaystyle X} by measuring a POVM on the state he received. Let Y {\displaystyle Y} be the classical register containing Bob's measurement outcome, which is a random variable whose distribution depends on Bob's choice of measurement. Holevo's theorem bounds the amount of correlation between the classical registers X {\displaystyle X} and Y {\displaystyle Y} , independently of Bob's measurement choice, in terms of the Holevo information. The Holevo information does not depend on the measurement choice, and so this gives a bound which does not require optimizing over all possible measurements.

Precise statement Define the accessible information between X {\displaystyle X} and Y {\displaystyle Y} as the (classical) mutual information between the two registers maximized over all possible choices of Bob's measurements:

I a c c ( X : Y ) = sup { Π i B } i I ( X : Y | { Π i B } i ) , {\displaystyle I_{\rm {acc}}(X:Y)=\sup _{\{\Pi _{i}^{B}\}_{i}}I(X:Y|\{\Pi _{i}^{B}\}_{i}),}

where I ( X : Y | { Π i B } i ) {\displaystyle I(X:Y|\{\Pi _{i}^{B}\}_{i})} is the classical mutual information of the joint probability distribution given by p i j = p i Tr ⁡ ( Π j B ρ i ) {\displaystyle p_{ij}=p_{i}\operatorname {Tr} (\Pi _{j}^{B}\rho _{i})} . There is no known formula for the accessible information in general. However, there is always an upper bound

I a c c ( X : Y ) ≤ χ ( η ) ≡ S ( ∑ i p i ρ i ) − ∑ i p i S ( ρ i ) , {\displaystyle I_{\rm {acc}}(X:Y)\leq \chi (\eta )\equiv S\left(\sum _{i}p_{i}\rho _{i}\right)-\sum _{i}p_{i}S(\rho _{i}),}

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Holevo's theorem

Start with the simplest possible case. Write down what Holevo's theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In physics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Holevo's theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Holevo's theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Holevo's theorem

In research: Holevo's theorem appears in physics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Holevo's theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Holevo's theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Limits of computation, Quantum information theory, Quantum mechanical entropy, so understanding it makes those chapters shorter.
In everyday life: Look for Holevo's theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Holevo's theorem in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Holevo's theorem means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Holevo's theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Holevo's theorem in simple terms?

Holevo's theorem is a result in quantum information theory. It is sometimes called Holevo's bound, since it gives an upper bound on the accessible information, which is amount of information that can be known about a quantum state.

Why does Holevo's theorem matter?

Because it connects several physics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Holevo's theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Holevo's theorem.