Representation of Qubit Superposition States
In conventional computers the elementary unit of information is the bit, which can be either 0 or 1 at any given moment. This binary restriction underpins all digital logic, from simple gates to complex processors. Quantum computing replaces the bit with the qubit (quantum bit). A qubit is not limited to a single definite value; instead, it can exist in a superposition of the logical states 0 and 1. This ability to be “in two places at once” is what gives quantum machines their extraordinary parallelism.
Mathematical Language of Superposition
Dirac Notation
Physicists describe quantum states with Dirac (bra‑ket) notation. The two computational basis states are written as
- |0⟩ (read “ket zero”)
- |1⟩ (read “ket one”)
In a two‑dimensional Hilbert space these correspond to the column vectors
[
|0⟩ = \begin{pmatrix}1\0\end{pmatrix},\qquad
|1⟩ = \begin{pmatrix}0\1\end{pmatrix}.
]
General Superposition
A qubit that is not locked to a basis state is expressed as a linear combination of the two basis vectors:
[
|\psi⟩ = \alpha,|0⟩ + \beta,|1⟩,
]
where α and β are complex numbers called probability amplitudes. The squared magnitudes (|\alpha|^{2}) and (|\beta|^{2}) give the probabilities of finding the qubit in |0⟩ or |1⟩ after a measurement.
Normalisation
Because a measurement must yield one of the two outcomes, the amplitudes obey the normalisation condition
[
|\alpha|^{2} + |\beta|^{2} = 1.
]
Only states that satisfy this equation represent physically realizable qubits.
Visualising a Qubit: The Bloch Sphere
Complex amplitudes are difficult to picture on a flat diagram. The Bloch sphere provides an intuitive three‑dimensional representation. Every pure qubit state maps to a point on the surface of a unit sphere:
- The north pole corresponds to |0⟩.
- The south pole corresponds to |1⟩.
- Any other point denotes a unique superposition.
By introducing two angles—θ (polar angle) and φ (azimuthal angle)—the state can be rewritten as
[
|\psi⟩ = \cos!\left(\frac{\theta}{2}\right)|0⟩ + e^{i\phi}\sin!\left(\frac{\theta}{2}\right)|1⟩.
]
- θ determines the relative weight of |0⟩ versus |1⟩ (the “latitude”).
- φ encodes the relative phase between the two components (the “longitude”).
The phase does not affect measurement probabilities directly, but it is crucial for interference—the mechanism that powers many quantum algorithms.
Measurement and Collapse
Superposition is fragile. When a qubit is observed, the wavefunction collapses to one of the basis states:
- With probability (|\alpha|^{2}) the outcome is 0 and the post‑measurement state becomes |0⟩.
- With probability (|\beta|^{2}) the outcome is 1 and the post‑measurement state becomes |1⟩.
This collapse is irreversible; the original amplitudes are lost. Consequently, a single measurement cannot reveal α or β. To estimate these amplitudes experimentally, one must repeat the preparation‑measurement cycle many times and compile statistics.
Creating Superposition: The Hadamard Gate
The most common way to generate a balanced superposition is to apply a Hadamard (H) gate to a basis state. In matrix form
[
H = \frac{1}{\sqrt{2}}
\begin{pmatrix}
1 & 1\
1 & -1
\end{pmatrix}.
]
Acting on |0⟩, the gate produces
[
H|0⟩ = \frac{1}{\sqrt{2}}|0⟩ + \frac{1}{\sqrt{2}}|1⟩ \equiv |+\rangle.
]
Here α = β = 1/√2, so the measurement probabilities are each 50 %. The state |+\rangle is called a uniform superposition and serves as the starting point for many quantum algorithms, such as Grover’s search and Shor’s factoring routine. By adjusting the gate sequence, one can engineer arbitrary values of θ and φ, thereby steering the qubit to any desired point on the Bloch sphere.
Why Superposition Matters
Exponential State Space
A classical register of n bits can represent only one of the (2^{n}) possible bit strings at a time. In contrast, n qubits in a superposition simultaneously encode all (2^{n}) strings, each with its own amplitude. For example, a 300‑qubit register can represent more than (10^{90}) amplitudes—far more than the estimated number of atoms in the observable universe.
Interference‑Based Speed‑ups
Quantum algorithms manipulate the phases (φ) of the amplitudes so that constructive interference amplifies the probability of correct answers while destructive interference suppresses wrong ones. This selective reinforcement is what enables exponential or polynomial speed‑ups over the best known classical methods for certain problems (e.g., integer factorisation, unstructured search).
Practical Implications
- Cryptography: Shor’s algorithm leverages superposition and interference to factor large numbers, threatening RSA‑type encryption.
- Optimization: Variational quantum eigensolvers and quantum approximate optimisation algorithms exploit superposition to explore large solution spaces efficiently.
- Simulation: Quantum chemistry simulations use superposed states to model electron configurations that are intractable for classical computers.
Summary
The representation of a qubit’s superposition state rests on three pillars:
- Linear combination of orthogonal basis vectors with complex amplitudes (α, β).
- Normalisation ensuring that measurement probabilities sum to unity.
- Geometric interpretation on the Bloch sphere, where the polar angle θ sets the amplitude balance and the azimuthal angle φ encodes relative phase.
Understanding these concepts is essential for anyone working with quantum circuits, because every gate, measurement, and algorithm ultimately manipulates the amplitudes and phases that define a qubit’s superposition. As quantum hardware matures, the ability to prepare, control, and read out these delicate states will determine the practical reach of quantum computing across cryptography, materials science, and beyond.