The States |0⟩ and |1⟩
A quantum computer stores information in qubits. Before exploring superposition, you need to know the two states a qubit can be in when you measure it — the computational basis states and .
The two basis states
In Dirac (bra-ket) notation these states are written and . Behind the notation each state is a two-dimensional complex column vector:
Each entry is a probability amplitude: the probability of a particular measurement outcome equals
the squared modulus of the corresponding amplitude. The top entry corresponds to outcome and the
bottom entry to outcome . For the top amplitude is and the bottom is , giving
measurement probabilities and — so a measurement is certain to return 0.
For it is the other way around — measurement always returns 1.
These two vectors form an orthonormal basis for the two-dimensional Hilbert space : they are orthogonal () and each has unit length ().
Why column vectors?
Representing states as vectors lets us describe quantum gates as matrix multiplication. A gate maps a state to a new state by ordinary matrix–vector multiplication. Every gate in this course is an operation on the same (or a tensor product of copies of it), so getting the column-vector picture in your head now pays off everywhere else.
Try it
Qubits always start in . Prepare the state by flipping the qubit, then press Check to confirm the simulator agrees with the column vector .
After running, look at the State Vector panel. The amplitude of is and the amplitude of is , exactly matching the column vector above.
Sign in on the full site to ask questions and join the discussion.