Fundamentals
Qubit
The basic unit of quantum information, capable of existing in a superposition of 0 and 1.
Definition
A qubit (quantum bit) is the fundamental unit of information in a quantum computer. Unlike a classical bit, which must be either 0 or 1, a qubit can exist in a superposition — a combination of both states at once, described by probabilities.
In depth
The word qubit is short for quantum bit, a term Benjamin Schumacher introduced in a 1995 paper and credited to a conversation with William Wootters. A classical bit is either 0 or 1. A qubit has two basis states, written 0 and 1, but its state can be any combination a times 0 plus b times 1, where a and b are complex numbers whose squared sizes add up to 1. That description has three independent real parameters, which is why a single qubit's state can be drawn as a point on the Bloch sphere.
A qubit is an abstraction, and it can be built from many physical systems. Superconducting circuits use the lowest two energy levels of a Josephson junction circuit. Trapped ions use two internal states of an atom, neutral atom machines use two electronic or nuclear spin states of an atom held by a laser, photonic machines use the path or polarization of a single photon, and silicon devices use the spin of an electron. Each choice trades off speed, coherence, connectivity, and ease of manufacture, and no technology has yet won.
The power of qubits comes from combining them. n qubits have 2^n amplitudes, and quantum gates act on all of them at once, but a measurement returns only n bits, a limit made precise by Holevo's theorem. Useful algorithms steer the amplitudes so that the answer is likely when measured. This is also why raw qubit counts mislead: what matters is how many reliable operations the qubits can perform, which depends on error rates, connectivity, and error correction.
Technical Definition
Mathematically, a qubit's state is represented as |ψ⟩ = α|0⟩ + β|1⟩, where α and β are complex numbers called probability amplitudes, and |α|² + |β|² = 1. Measuring the qubit collapses it to |0⟩ with probability |α|² or |1⟩ with probability |β|².
Visual Explanation: An Analogy
Imagine a spinning coin in the air. While it's spinning, it isn't simply 'heads' or 'tails' — it's in a blend of both possibilities. Only when it lands (is measured) does it settle into one definite state. A qubit behaves similarly until it is measured.
Key facts
| Item | Detail |
|---|---|
| State | a times 0 plus b times 1, with the squared sizes of a and b summing to 1 |
| Coined | By Benjamin Schumacher in 1995 |
| Largest counts (2025) | 1,121 superconducting qubits on IBM Condor; over 6,000 atoms in a neutral atom array (Caltech) |
| Information limit | n qubits hold 2^n amplitudes but yield only n classical bits per measurement |
| Physical platforms | Superconducting circuits, trapped ions, neutral atoms, photons, spins in silicon, and NV centers |
Where the idea comes from
Richard Feynman suggested in 1982 that quantum systems might compute in ways classical machines cannot, and David Deutsch formalized the quantum computer in 1985. The first demonstrations of two-qubit logic used nuclear magnetic resonance in 1998, and trapped ion and superconducting qubits followed in the 2000s.
Real-World Use Cases
- Storing and processing information in quantum algorithms like Shor's and Grover's
- Representing molecular states in quantum chemistry simulations
- Acting as the carriers of information in quantum cryptography protocols
How it differs from related ideas
- A classical bit is always 0 or 1, while a qubit can be in a superposition until measured.
- A qubit is not a probabilistic bit. Its amplitudes can be negative or complex, which allows interference.
- A qudit generalizes the qubit to d levels, and some hardware uses qutrits or higher levels internally.
Common Misconceptions
- A qubit is not 'secretly' a 0 or a 1 that we just haven't checked yet — it genuinely exists in a probabilistic combination until measured.
- A single qubit cannot store two classical bits of information simultaneously for retrieval; superposition collapses upon measurement.
Frequently asked questions
What is a qubit in simple terms?
The basic unit of quantum information: a two-level quantum system that can be in a combination of 0 and 1 until it is measured.
How many qubits are needed for a useful quantum computer?
It depends on the task. Estimates for breaking RSA-2048 are under a million noisy physical qubits, and useful chemistry needs thousands of error-corrected logical qubits.
Does more qubits mean a faster computer?
Not by itself. Error rates, connectivity, and coherence matter as much, and many qubits with high errors can be less useful than fewer good ones.
Related Terms
Keep exploring
- Algorithm: Deutsch-Jozsa Algorithm
- Algorithm: Grover's Algorithm
- Hardware: IBM Condor
- Hardware: Google Willow
- Hardware: IonQ Forte (and Forte Enterprise)