Qubits and the Bloch sphere
A classical bit is 0 or 1. A qubit can be in any of a continuum of states: any point on a sphere. That sounds like infinitely more information. But measure it and you get one bit, 0 or 1, and the state is gone. Alexander Holevo proved in 1973 that no cleverness can get more than one classical bit out of one qubit. The power of quantum computing comes not from storing more, but from how amplitudes combine before you look.
On the plate: a qubit on the Bloch sphere, and the outcomes of measuring many copies.
The state of one qubit
Any two-level quantum system, the spin of Chapter 40, a photon’s polarization, two levels of an ion, is a qubit. Its state is with . Multiplying the whole state by a phase changes nothing measurable, so up to that global phase,
a point on the Bloch sphere at polar angle and azimuth (Chapter 40). Set 60°, 0°. The relative phase is physical: it decides how the state interferes. Established
Measuring in any basis
Measuring along gives 0 with probability . You can measure along any axis instead, by rotating first: , , . Then . The fraction of “+” results approaches , where is the Bloch vector. One measurement tells you almost nothing about the state; to learn it you need many copies and all three bases, which is state tomography.
Holevo’s bound
Suppose Alice encodes a message by sending one of several qubit states, each with some probability, and Bob measures however he likes. The information Bob can extract is at most the Holevo quantity
with the quantum entropy of Chapter 105 and for a qubit. So one qubit carries at most one bit. Sending with equal probability, the four states of the BB84 key-distribution protocol (Chapter 132), gives : the average state is maximally mixed, and four states still give only one bit. Established
So where does the power come from?
Not from storage. From three things you will see repeatedly: a register of qubits is described by amplitudes (Chapter 98); gates act on all of them at once; and amplitudes, unlike probabilities, can cancel. An algorithm arranges for wrong answers to interfere destructively and right ones constructively, so that the one bit string you finally read is likely to be useful. Without interference, a quantum computer is just a randomized classical one.
What you now have
The qubit state and its Bloch-sphere picture, global versus relative phase, measurement in any basis and tomography, Holevo’s bound, and where quantum computing’s advantage does and does not come from.
· · ·
Three questions to carry with you.
And one to work out. For , what is the probability of measuring 0 in the z basis?
Sources: A. S. Holevo, Problems Inf. Transm. 9, 177 (1973). M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, ch. 1. N. D. Mermin, Quantum Computer Science. J. Preskill, Caltech Ph219 notes, ch. 2. Checked by code: χ(BB84 ensemble) = S(𝟙/2) = 1 bit; P(0) = cos²(θ/2); simulated shot statistics converge to ½(1 + n̂·r).