What a quantum computer actually is
A classical computer stores everything as bits that are either 0 or 1. A quantum computer stores information in qubits, which can hold a combination of 0 and 1 at the same time — a superposition. That sounds like the machine is trying every answer at once, and almost every popular article says exactly that. It is the wrong picture, and it is the reason so many people come away confused.
The honest version: a quantum computer holds many possibilities at once, but you cannot read them all out. Measuring a qubit collapses it to a single 0 or 1. The skill in quantum computing is arranging interference so the wrong answers cancel each other out and the right answer is what survives to be measured. A quantum algorithm is a recipe for that cancellation. Without it, you have an extremely expensive random number generator.
The four ideas everything else is built on
- Superposition — a qubit's state is a weighted blend of 0 and 1. The weights are amplitudes, and they can be negative, which is what makes cancellation possible.
- Entanglement — two or more qubits can share a state that cannot be described by looking at them separately. Measure one and you instantly know something about the other. This is not a communication channel, and it does not let you send information faster than light.
- Interference — the working part. Amplitudes add and subtract, and a good algorithm steers the subtraction onto the answers you do not want.
- Measurement — the moment the quantum state becomes a classical result, and the moment all the unread possibilities disappear. You get one answer, with a probability set by the amplitudes.
What a quantum computer is not
It is not a faster classical computer. For the overwhelming majority of everyday computing — spreadsheets, video encoding, web servers, most machine learning — a quantum computer offers nothing at all, and will be slower than the machine you are reading this on. The speedups that exist are for specific mathematical structures: factoring, unstructured search, simulating quantum systems, some optimisation and linear-algebra problems. "Quantum computers will make everything faster" is not a simplification of the truth; it is simply false.
It is also not ready. Today's machines are noisy, their qubits lose coherence in microseconds to milliseconds, and the error rates mean most useful algorithms cannot yet run at a scale that beats a classical computer. That is why error correction is the field's central engineering problem rather than a footnote.
Where to start
If you are new, read in this order: what a qubit is, then superposition and entanglement, then what measurement does, then a first look at a real algorithm. Once those land, the rest of this site — algorithms, hardware, cryptography — stops reading like jargon and starts reading like engineering.
