QUANTUM 01
Classical bits, quantum bits, ket notation, and why qubits scale so fast
Sinclair College - Dr. Mike Libassi
TODAY
01 · CLASSICAL BITS
Every classical computer stores information as bits: a voltage that is either low (0) or high (1), never in between.
Can represent 2ⁿ different values. Four bits give 16 possibilities.
Those bits hold only one of the 2ⁿ values at any moment.
Describing the state of n bits takes just n numbers, each 0 or 1.
02 · THE QUBIT
Amplitudes α and β are the numbers in front of each ket. Square them to get probabilities. Both nonzero means the qubit is in superposition.
03 · MEASUREMENT
Outcome 0 with probability |α|², outcome 1 with probability |β|².
Afterward the qubit is in the state you saw. Measure again and you get the same answer.
The amplitudes only show up as percentages across many freshly prepared qubits.
04 · SCALING
| Qubits (n) | Amplitudes (2ⁿ) | Memory to simulate | Fits on |
|---|---|---|---|
| 1 | 2 | 32 bytes | anything |
| 10 | 1,024 | 16 KB | anything |
| 30 | ≈ 1.07 billion | 16 GB | a laptop |
| 37 | ≈ 137 billion | 2 TB | a large server |
| 50 | ≈ 1.1 quadrillion | 16 PB | nothing practical |
At roughly 16 bytes per amplitude, classical simulation hits a wall around 45–50 qubits.
04 · SCALING
Measuring n qubits returns only n bits. Algorithms must make the right answer likely.
Noise turns superposition into ordinary 0s and 1s within microseconds to seconds.
Reliable logical qubits are built from many noisy physical qubits.
WRAP-UP
A classical bit is always 0 or 1; n bits need n numbers to describe
A qubit is written α|0⟩ + β|1⟩, a two-row column vector of amplitudes
Measuring gives one bit, chosen randomly with probability |amplitude|²
n qubits need 2ⁿ amplitudes, which overwhelms classical simulation past ~50 qubits
DISCUSSION
If 50 qubits can't be simulated, why don't today's quantum computers already beat classical ones at everything?
Think about readout limits, noise, and which problems have structure a quantum algorithm can exploit.