From Bits to Qubits
Classical computers run on bits — tiny switches that are either 0 or 1. Every piece of data on your phone, every frame of a video, every email is ultimately a long sequence of these binary choices.
A qubit (quantum bit) is different in a fundamental way: it doesn't have to commit to being 0 or 1 until you look at it. Before measurement, a qubit can exist in a superposition — a blend of both 0 and 1 simultaneously.
Superposition is not randomness. The qubit isn't randomly flickering between 0 and 1. It's genuinely in both states at once, with specific amplitudes that determine the probability of each outcome when measured.
The State Vector
We describe a qubit's state using a state vector:
|ψ⟩ = α|0⟩ + β|1⟩
Where:
αis the complex amplitude for the |0⟩ stateβis the complex amplitude for the |1⟩ state- The constraint
|α|² + |β|² = 1ensures total probability = 100%
When you measure the qubit, you get |0⟩ with probability |α|² and |1⟩ with probability |β|².
The Equal Superposition: |+⟩
The most famous qubit state is the equal superposition:
|+⟩ = (1/√2)|0⟩ + (1/√2)|1⟩
This gives exactly 50% probability of measuring 0 and 50% of measuring 1. The Hadamard gate creates this state from |0⟩.
On the Bloch sphere, the |+⟩ state points along the +X axis — halfway between north (|0⟩) and south (|1⟩).
Classical vs. Quantum: A Table
| Property | Classical Bit | Qubit | |----------|--------------|-------| | Values | 0 or 1 | α|0⟩ + β|1⟩ | | Before measurement | Fixed | Superposition | | After measurement | Same | Collapses to 0 or 1 | | Geometry | Binary switch | Point on a sphere | | Copies | Unlimited | No-Cloning Theorem |
Why Does Superposition Matter?
Superposition allows a quantum computer to explore many possible solutions simultaneously. With n qubits in superposition, the computer holds information about 2ⁿ states at once — a classical computer would need to check them one by one.
Intuition pump: Imagine a maze. A classical computer tries every path one at a time. A quantum computer, in a sense, tries all paths simultaneously — then quantum interference amplifies the correct path and cancels out the wrong ones.
Test Your Understanding
A qubit in state (1/√2)|0⟩ + (1/√2)|1⟩ is measured. What is the probability of getting |1⟩?
Next Steps
Now that you understand what a qubit is, explore how gates manipulate them:
Open the Bloch Sphere Simulator →
In the simulator, press H to apply the Hadamard gate and see |0⟩ jump to the |+⟩ state in real time.
Ready to go further? Learn how classical data is loaded into qubits → Quantum Data Encoding Tutorial