A quantum computer stores information in qubits, which can be in superpositions of 0 and 1 and can be entangled with each other. A computation steers the amplitudes of these states so that wrong answers cancel and right ones reinforce. It is not a faster classical machine: it helps only on problems with the right structure.
Key concepts
- Qubit and state vector: a qubit's state is a pair of complex amplitudes; n qubits need 2^n of them.
- Gates and circuits: quantum operations are reversible unitary matrices, drawn as circuits of gates such as Hadamard and CNOT.
- Superposition and interference: amplitudes add like waves, and algorithms arrange for useful paths to interfere constructively.
- Entanglement: joint states that cannot be described qubit by qubit, with correlations no classical model reproduces.
- Measurement: reading a qubit gives a random 0 or 1 with probability set by the amplitudes, and collapses the state.
Vocabulary
- Bloch sphere: a picture of the state of one qubit as a point on a sphere.
- Shot: one run of a circuit followed by a measurement; results are collected over many shots.
- No-cloning theorem: an unknown quantum state cannot be copied.
- Simulator: classical software that computes the amplitudes of small circuits.
What to study, in order
- Complex numbers, vectors and matrices: the linear algebra of unitary maps.
- Simulate one and two qubits by hand and in code: Hadamard, phase and CNOT gates.
- Build a Bell pair and measure it many times; check the correlations.
- Implement a small simulator and run Deutsch-Jozsa and Grover on it.
- Read how the cost of simulation grows with qubits, and why that matters.
Related tags
#quantum-algorithms #quantum-information #linear-algebra #complexity