1. Bit
  2. Qubit
  3. Superposition
  4. Measurement
  5. Entanglement
  6. Circuits
  7. Fourier
  8. Shor
  9. Grover
  10. Correction

Chapter 03 · Measurement

Asking a question changes the answer

Measuring is the only moment when a quantum computer hands over classical information, and the only non-reversible step. Observables are Hermitian matrices, outcomes are their eigenvalues, and two incompatible questions cannot both have sharp answers.

In 1922 Otto Stern and Walther Gerlach fired silver atoms through an inhomogeneous magnetic field in Frankfurt. Classically, the atoms' small magnetic moments should have been deflected by any amount and produced a smeared band. Instead, two separate spots appeared on the glass plate: the measured quantity, the spin, took only two values. It was the first measurement of a qubit.

Observables and the spectral theorem

In quantum mechanics, each measurable quantity (an observable) is represented by a Hermitian matrix: A=A†. The possible outcomes of measuring it are its eigenvalues. That this makes sense is guaranteed by one of the central theorems of linear algebra.

Theorem (spectral theorem, Hermitian case)

If A∈ℂd×d is Hermitian, its eigenvalues λ1,…,λd are real and there is an orthonormal basis {|ei⟩} of eigenvectors, so that

A=∑i=1dλi|ei⟩⟨ei|.
Proof of the two key facts

Real eigenvalues. If A|v⟩=λ|v⟩ with |v⟩≠0, then λ⟨v|v⟩=⟨v|A|v⟩=⟨v|A†|v⟩=λ‾⟨v|v⟩, so λ=λ‾.

Orthogonal eigenvectors. If A|u⟩=μ|u⟩ and A|v⟩=λ|v⟩ with μ≠λ, then μ⟨u|v⟩=⟨u|A|v⟩=λ⟨u|v⟩, so ⟨u|v⟩=0. Completeness (that there are d of them) follows by induction: the orthogonal complement of an eigenvector is invariant under A.

Postulate (projective measurement)

Measuring the observable A=∑iλi|ei⟩⟨ei| on the state |ψ⟩ gives the outcome λi with probability |⟨ei|ψ⟩|2, and leaves the system in the state |ei⟩. The average value is

⟨A⟩=∑iλi|⟨ei|ψ⟩|2=⟨ψ|A|ψ⟩.

For a qubit, the three basic observables are the Pauli matrices, which measure the spin along the three axes of the Bloch sphere:

X=(0110),Y=(0−ii0),Z=(100−1).

All three have eigenvalues ±1. And for a state with Bloch vector 𝐫, the averages are exactly its coordinates: ⟨X⟩=rx, ⟨Y⟩=ry, ⟨Z⟩=rz.

Sequential measurements

A chain of Stern–Gerlach analysers. The first one keeps the atoms that come out “up” along its axis; the second and third measure along the angles you choose. Measuring along z, then x, then z again does not give back the original certainty: measuring x erased the information about z. The probability of passing an analyser at an angle θ from the previous one is cos2⁡(θ/2).

The uncertainty relation

Two observables that do not commute cannot both have sharp values. In 1927 Werner Heisenberg stated it for position and momentum; in 1929 Howard Robertson proved the general version, which follows directly from the Cauchy–Schwarz inequality.

Theorem (Robertson, 1929)

For Hermitian A, B and every state |ψ⟩, with σA2=⟨A2⟩−⟨A⟩2,

σAσB≥12|⟨ψ|[A,B]|ψ⟩|,[A,B]=AB−BA.
Proof

Let |f⟩=(A−⟨A⟩)|ψ⟩ and |g⟩=(B−⟨B⟩)|ψ⟩, so that ⟨f|f⟩=σA2 and ⟨g|g⟩=σB2. By Cauchy–Schwarz, σA2σB2≥|⟨f|g⟩|2≥(Im⟨f|g⟩)2. Now ⟨f|g⟩−⟨g|f⟩=⟨ψ|[A,B]|ψ⟩, and ⟨f|g⟩−⟨f|g⟩‾=2iIm⟨f|g⟩. Combining both gives the inequality.

For the Pauli matrices, [X,Z]=−2iY, so σXσZ≥|⟨Y⟩|. Uncertainty is not a limitation of our instruments: it is a property of the vectors themselves.

Mixed states

Sometimes we do not know which pure state a system is in: with probability pk it is in |ψk⟩. In 1927 von Neumann proposed describing that situation with a density matrix:

ρ=∑kpk|ψk⟩⟨ψk|,ρ⪰0,Trρ=1,P(i)=⟨ei|ρ|ei⟩.

For a qubit, every density matrix has the form ρ=12(I+rxX+ryY+rzZ) with ‖𝐫‖≤1: mixed states fill the interior of the sphere (the Bloch ball), and the centre is the maximally mixed state, a fair coin. Two very different mixtures can have the same ρ and, by then, be indistinguishable by any measurement. Density matrices will be essential for describing noise and decoherence.

You cannot copy a qubit

Copying a classical bit is trivial. Copying an unknown qubit is impossible, a fact that William Wootters and Wojciech Zurek, and independently Dennis Dieks, proved in 1982 in a few lines.

Theorem (no-cloning)

There is no unitary U and fixed state |s⟩ such that U(|ψ⟩⊗|s⟩)=|ψ⟩⊗|ψ⟩ for every state |ψ⟩.

Proof

Suppose it works for |ψ⟩ and |ϕ⟩. Unitaries preserve inner products, so ⟨ϕ|ψ⟩⟨s|s⟩=⟨ϕ|ψ⟩2, that is, ⟨ϕ|ψ⟩=⟨ϕ|ψ⟩2. Then ⟨ϕ|ψ⟩ is 0 or 1: the machine can only copy states that are equal or orthogonal, never arbitrary ones.

No-cloning is a limitation (no backup copies, which makes error correction tricky) and an opportunity: an eavesdropper cannot copy qubits without disturbing them, which is the basis of quantum cryptography (BB84, Bennett and Brassard, 1984). And it is consistent with the Holevo bound: if amplitudes could be cloned, a qubit could be copied many times and measured over and over to extract them.

References

  1. W. Gerlach and O. Stern (1922). “Der experimentelle Nachweis der Richtungsquantelung im Magnetfeld”. Zeitschrift für Physik, 9.
  2. W. Heisenberg (1927). “Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik”. Zeitschrift für Physik, 43.
  3. H. P. Robertson (1929). “The Uncertainty Principle”. Physical Review, 34.
  4. W. K. Wootters and W. H. Zurek (1982). “A single quantum cannot be cloned”. Nature, 299.
  5. D. Dieks (1982). “Communication by EPR devices”. Physics Letters A, 92(6).
  6. C. H. Bennett and G. Brassard (1984). “Quantum cryptography: Public key distribution and coin tossing”. Proceedings of IEEE ICCSSP.