Chapter 01 · Qubits
A unit vector in a complex space
A qubit is not “0 and 1 at the same time”. It is a unit vector in , whose components are complex amplitudes; their squared moduli give the probabilities of each outcome. Geometrically, every qubit is a point on a sphere.
In this chapter
In 1900 Max Planck explained the spectrum of hot bodies by assuming that energy is exchanged in discrete packets, quanta. A quarter of a century later, Heisenberg (1925) and Schrödinger (1926) built two theories that looked different and turned out to be the same, and in 1932 John von Neumann gave them their definitive mathematical form: the states of a quantum system are vectors in a Hilbert space. The smallest non-trivial quantum system has a two-dimensional space: the qubit.
Hilbert spaces and Dirac notation
A vector space with the inner product , which is linear in the second argument, satisfies and , with equality only for .
Paul Dirac introduced in 1939 a notation that is still used everywhere. A column vector is a ket, ; its conjugate transpose, a row vector, is a bra, . Placed together they give a bra-ket, the inner product , and in the opposite order an operator: is the projector onto .
The qubit and the Born rule
The state of a qubit is a unit vector in :
The numbers and are amplitudes. They cannot be observed directly. What can be observed is the outcome of a measurement, and here Max Born, in a footnote to a 1926 paper, gave the rule that connects the formalism with the laboratory.
Measuring in the basis gives 0 with probability and 1 with probability . After the measurement the state becomes or , according to the outcome.
This is why a qubit is not “0 and 1 at once”: it is a state that, when measured, gives one definite result with probabilities set by the amplitudes. The difference from a probabilistic bit is that amplitudes are complex numbers that can cancel each other out, which we will see in the next chapter. Each amplitude can be pictured as an arrow in the complex plane: its length is the modulus and its angle is the phase, .
Global phase is invisible
For every real , the states and give the same probabilities for every possible measurement.
Proof
Any outcome has probability for some unit vector . Multiplying by gives , because .
On the other hand, the relative phase between and does matter: and give the same probabilities in the basis , but they are orthogonal states, perfectly distinguishable in another basis. They are called and .
The Bloch sphere
A qubit has four real parameters (two complex numbers), minus one for normalization and one for the invisible global phase: two remain. Two angles, like latitude and longitude on a sphere.
Up to a global phase, every state of a qubit can be written uniquely as
and the map is a bijection between pure states and the points of the unit sphere (with undefined at the poles). Orthogonal states correspond to antipodal points.
Proof
Write and . Multiplying by the global phase makes real and non-negative, and leaves . Since , there is a unique with and ; set .
For orthogonality: means that the angle between the two vectors in is 90°, and the half-angles in the formula double it into 180° on the sphere. Explicitly, the antipode of is , and .
How much information does a qubit hold?
Describing a qubit requires two real numbers, which in principle could have infinitely many decimal digits. Could a single qubit store an encyclopedia? No, and the reason is a theorem.
If a classical message is encoded in the state of qubits and the receiver measures them in any way, the mutual information between message and outcome is at most bits.
Each measurement collapses the state and yields just one bit per qubit. The information of the amplitudes is real, but it is not accessible all at once. The art of quantum algorithms consists in making the amplitudes interfere so that, when we finally measure, the useful bit appears with high probability.
We now have the static description of a qubit. In the next chapter we set it in motion, and the feature that sets amplitudes apart from probabilities appears: they can cancel each other out.
References
- M. Born (1926). “Zur Quantenmechanik der Stoßvorgänge”. Zeitschrift für Physik, 37.
- J. von Neumann (1932). Mathematische Grundlagen der Quantenmechanik. Springer.
- P. A. M. Dirac (1939). “A new notation for quantum mechanics”. Mathematical Proceedings of the Cambridge Philosophical Society, 35(3).
- F. Bloch (1946). “Nuclear Induction”. Physical Review, 70.
- A. S. Holevo (1973). “Bounds for the quantity of information transmitted by a quantum communication channel”. Problems of Information Transmission, 9(3).
- M. A. Nielsen and I. L. Chuang (2010). Quantum Computation and Quantum Information, 10th anniversary ed. Cambridge University Press.