How Does Quantum Computing Work?
The prepare–evolve–measure cycle, and why interference is the whole trick.
By QuantumO Editorial · Scientific reviewer: not yet assigned · Published · Updated
In short
A quantum gate is a reversible operation that transforms qubit states; a quantum circuit is a time-ordered sequence of such gates ending in measurement. A small universal set — for example Hadamard, phase, and CNOT gates — is enough to approximate any quantum computation.
Video coming soon
This entry is a CMS placeholder. Add the YouTube video ID, thumbnail, duration and publication date to activate the player.
Visit the channelA Hadamard gate turns a definite 0 into an even combination of 0 and 1. Phase gates adjust the relative sign or phase between amplitudes — the ingredient interference needs.
Two-qubit gates such as CNOT make one qubit's behaviour depend on another, which is how entanglement is created inside a circuit.
Apart from measurement, quantum gates are reversible: no information is discarded. A universal gate set can approximate any operation to any desired accuracy, much as NAND alone suffices classically.
Real hardware supports only a few native gates; compilers rewrite circuits into those, which is why the same algorithm can be much deeper on one machine than another.
Analogy: rotations of a globe
Single-qubit gates act like rotations of a globe, moving a point on the Bloch sphere. The analogy is precise for one qubit and fails entirely for two, where entanglement has no such picture.
Transcript not available yet. Transcripts are stored as an editable CMS field on each video record.
The prepare–evolve–measure cycle, and why interference is the whole trick.
Noise, decoherence, and the overhead of protecting fragile quantum information.
How a qubit differs from a bit, and what physical systems can act as one.