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 this chapter
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: . The possible outcomes of measuring it are its eigenvalues. That this makes sense is guaranteed by one of the central theorems of linear algebra.
If is Hermitian, its eigenvalues are real and there is an orthonormal basis of eigenvectors, so that
Proof of the two key facts
Real eigenvalues. If with , then , so .
Orthogonal eigenvectors. If and with , then , so . Completeness (that there are of them) follows by induction: the orthogonal complement of an eigenvector is invariant under .
Measuring the observable on the state gives the outcome with probability , and leaves the system in the state . The average value is
For a qubit, the three basic observables are the Pauli matrices, which measure the spin along the three axes of the Bloch sphere:
All three have eigenvalues . And for a state with Bloch vector , the averages are exactly its coordinates: , , .
Sequential measurements
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.
For Hermitian , and every state , with ,
Proof
Let and , so that and . By Cauchy–Schwarz, . Now , and . Combining both gives the inequality.
For the Pauli matrices, , so . 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 it is in . In 1927 von Neumann proposed describing that situation with a density matrix:
For a qubit, every density matrix has the form with : 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.
There is no unitary and fixed state such that for every state .
Proof
Suppose it works for and . Unitaries preserve inner products, so , that is, . 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
- W. Gerlach and O. Stern (1922). “Der experimentelle Nachweis der Richtungsquantelung im Magnetfeld”. Zeitschrift für Physik, 9.
- W. Heisenberg (1927). “Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik”. Zeitschrift für Physik, 43.
- H. P. Robertson (1929). “The Uncertainty Principle”. Physical Review, 34.
- W. K. Wootters and W. H. Zurek (1982). “A single quantum cannot be cloned”. Nature, 299.
- D. Dieks (1982). “Communication by EPR devices”. Physics Letters A, 92(6).
- C. H. Bennett and G. Brassard (1984). “Quantum cryptography: Public key distribution and coin tossing”. Proceedings of IEEE ICCSSP.