Uncertainty Relations
Robertson, Schrödinger and entropic uncertainty relations.
Heisenberg's microscope is a story; Robertson's inequality is a theorem. This lesson proves the variance-based uncertainty relations, shows where they fall silent, and replaces them with entropic bounds that hold for every state and underpin the security of quantum cryptography.
What you’ll learn
- Prove the Robertson and Schrödinger uncertainty relations from the Cauchy–Schwarz inequality.
- Show that for a qubit, Schrödinger's relation for and is equivalent to the Bloch-ball condition.
- Derive the Maassen–Uffink entropic uncertainty relation by Riesz–Thorin interpolation.
- State the uncertainty relation with quantum memory and use it to explain QKD key rates.
- Distinguish preparation uncertainty from error–disturbance trade-offs.
Robertson and Schrödinger
Center both observables on the state.
Cauchy–Schwarz.
Expand, and split into its Hermitian and anti-Hermitian parts, whose expectation values are real and imaginary respectively.
Keeping both terms gives Schrödinger's relation; dropping the covariance term gives Robertson's. For mixed states, run the same argument with the semi-inner product .
With this becomes Kennard's (1927). Note what kind of statement it is: a constraint on preparations. No state has both spreads small. By itself it says nothing about one measurement disturbing another.
A qubit test case
For Pauli observables , with and . Write for the Bloch vector of the state.
Schrödinger's relation, with covariance term and commutator term .
Expand the left side; the terms cancel.
So for a qubit, Schrödinger's inequality for and is the statement that the state lies in the Bloch ball, with equality exactly for pure states. Robertson's weaker form, , is saturated by a pure state only when , that is, in the – or – plane.
Entropic uncertainty: Maassen–Uffink
The change of basis is unitary, and every entry of its matrix has modulus at most . These are the two endpoint bounds.
The Riesz–Thorin theorem (for complex scalars) interpolates between with norm and with norm .
Write , , and , so that . Take logarithms and use .
Multiply by , valid for . Letting gives the Shannon version.
For mutually unbiased bases and the bound is , attained by any basis vector of either basis; for qubit and , bit. Deutsch (1983) proved the first state-independent entropic bound, ; Kraus (1987) conjectured the sharper form that Maassen and Uffink proved.
Take the qubit state halfway between and on the Bloch sphere (, ). What is , in bits?
Show the answer
1.2 bits
Both outcome distributions are , each with entropy about bits, so the sum is about . The bound is attained by basis states (), not by this "balanced" state: entropic and variance-based relations have different minimizers.
Uncertainty with quantum memory
Without correlations () this is the Maassen–Uffink relation, strengthened by . With a maximally entangled memory, , and for mutually unbiased bases the bound drops to . Bob really can predict both outcomes: on , . This is the EPR paradox, made quantitative.
Alice and Bob share , and Alice measures or on her qubit. What is ?
- bit
- bits
- bit
Show the answer
A.
Bob can measure the same observable on his half and obtain Alice's outcome with certainty, so both conditional entropies vanish. The bound is : it is tight here.
Preparation versus measurement uncertainty
Heisenberg's original argument was about measurement: locating an electron with a short-wavelength photon kicks its momentum. Robertson and Maassen–Uffink constrain preparations. Turning the measurement story into a theorem is subtle, because "error" and "disturbance" must first be defined.
| Relation | Statement | Status |
|---|---|---|
| Kennard (1927); Robertson (1929) | Theorem about preparations; state-dependent | |
| Białynicki-Birula & Mycielski (1975) | for the differential entropies | Theorem; implies Kennard's relation, because Gaussians maximize entropy at fixed variance |
| Maassen & Uffink (1988) | Theorem about preparations; state-independent | |
| Ozawa (2003) | Theorem for state-dependent error and disturbance . The naive can fail, as neutron-spin experiments confirmed (Erhart et al., 2012) | |
| Busch, Lahti & Werner (2013) | Theorem with worst-case, state-independent error measures |
Key takeaways
- Robertson's and Schrödinger's relations follow from Cauchy–Schwarz. They are state-dependent and can be vacuous, for instance on eigenstates.
- For a qubit, Schrödinger's relation for and is exactly the Bloch-ball condition, with equality for pure states.
- Maassen–Uffink: , a state-independent bound equal to for mutually unbiased bases, proved by Riesz–Thorin interpolation.
- With quantum memory the bound gains , which entanglement can make negative. Its tripartite form powers QKD security proofs, such as the BB84 rate .
- Preparation uncertainty and error–disturbance trade-offs are different statements; the latter depend on how error is defined.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
For the state , what is Robertson's lower bound on , and is it attained?
- ; not attained
- ; attained
- ; attained, since
- ; not attained
Show the answer
C. ; attained, since
and for , so the bound is . Both and are coin flips for , so and the bound is attained.
For a qutrit measured in the computational basis and in the Fourier basis, what does the Maassen–Uffink relation guarantee?
- bit
- bits
- bits
- Nothing: the relation only applies to qubits
Show the answer
B. bits
The Fourier basis is unbiased to the computational basis, , so . A basis state attains it: .
What is the main advantage of the Maassen–Uffink relation over Robertson's?
- It applies to continuous variables
- It uses variances, which are easier to measure
- It is always numerically larger
- Its bound depends only on the two bases, not on the state, so it stays informative even for eigenstates of one observable
Show the answer
D. Its bound depends only on the two bases, not on the state, so it stays informative even for eigenstates of one observable
Robertson's bound depends on the state and vanishes on eigenstates. The entropic bound is a property of the two bases alone, and it is strictly positive whenever no vector of one basis coincides with a vector of the other.
In , with mutually unbiased qubit bases, when can the right-hand side reach ?
- When is maximally entangled with
- When is in a pure state
- When and are uncorrelated
- Never
Show the answer
A. When is maximally entangled with
For a maximally entangled pair of qubits , which cancels .
Further reading
- H. P. Robertson, "The uncertainty principle", Physical Review 34 (1929).
- H. Maassen & J. B. M. Uffink, "Generalized entropic uncertainty relations", Physical Review Letters 60 (1988).
- M. Berta, M. Christandl, R. Colbeck, J. M. Renes & R. Renner, "The uncertainty principle in the presence of quantum memory", Nature Physics 6 (2010).
- P. J. Coles, M. Berta, M. Tomamichel & S. Wehner, "Entropic uncertainty relations and their applications", Reviews of Modern Physics 89 (2017).
- P. Busch, P. Lahti & R. F. Werner, "Proof of Heisenberg's error-disturbance relation", Physical Review Letters 111 (2013).