The Quantum Investor's Notebook logo The Quantum Investor's Notebook
← Back

Wednesday, June 17, 2026

Quantum Gates: A Solved Idea, an Unsolved Machine

A qubitThe basic unit of a quantum computer. Like a 'bit' in a normal computer, but instead of being only 0 or 1 it can be 0, 1, or a blend of both at once. on its own does nothing. The quantum gateA single operation that changes the state of one or more qubits. Strung together, gates make up a quantum calculation, like the logic steps inside a normal chip. is the operation that turns it into a computation.

What a quantum gate actually is

A normal computer runs on logic gates, the little operations that take bits in and push bits out: an AND here, a NOT there. A quantum gate is that same idea moved up to the quantum level. It is a single operation that takes one or more qubits and changes their state in a controlled way. String enough of them together in the right order and you have a quantum computation.1

Because a gate acts on the whole quantum state, it can build entanglement between qubits. That is where the power lives.

Here is the fact that sets a quantum gate apart from its classical cousin. It has to be reversible. Every quantum gate is a unitary operationA quantum operation that rotates a system's state without losing any information, so it can always be undone exactly. Every quantum gate is one., which is a precise way of saying it rotates the state without ever throwing information away, so each gate has an exact inverse that undoes it.1 That is not a design preference. It is forced on us by the way quantum systems evolve. And because a gate acts on the whole quantum stateThe full description of a quantum system's condition at a moment in time, such as whether a qubit is 0, 1, or a mix., it can operate on a superpositionThe quantum ability of a qubit to be in a combination of 0 and 1 simultaneously, which gives quantum computers their power. of 0 and 1 at once, and it can build entanglementA quantum link where two qubits' states become tied together, so acting on or measuring one affects the other. It is a key resource for quantum computing. between qubits.2 That last part is where the power lives.

A two-qubit quantum circuit. Both qubits start in state 0. On the top qubit an X gate flips it and a Hadamard gate puts it into a 50/50 mix, then a CNOT links the two qubits. Measuring gives 00 or 11 with equal probability and never a mismatch, because the qubits are entangled.
Figure 1: The whole toolkit in one picture, read left to right. A couple of single-qubit gates (X and Hadamard) and one two-qubit gate (the CNOT) are enough to build any quantum computation. Here they leave the two qubits entangled, so a measurement gives 00 or 11 with equal odds and never a mismatch.

A small toolkit, and why it is enough

You do not need a different gate for every problem. Quantum computing leans on a short, standard list of moves. There are single-qubit gatesAn operation that acts on just one qubit. Generally easier to perform accurately than a two-qubit gate., which act on one qubitThe basic unit of a quantum computer. Like a 'bit' in a normal computer, but instead of being only 0 or 1 it can be 0, 1, or a blend of both at once. at a time: the X gateA single-qubit gate that flips 0 to 1 and 1 to 0, the quantum version of a classical NOT. is a quantum NOT that flips a qubit, and the Hadamard gateA single-qubit gate that puts a qubit into an even mix of 0 and 1. The standard way to create a superposition. puts a qubit into an even mix of 0 and 1. And there are two-qubit gatesA gate that acts on two qubits at once, such as the CNOT. Much harder to perform accurately than a single-qubit gate, and the real test of a machine., the workhorse being the CNOT gateA two-qubit gate that flips a target qubit only when a control qubit is 1. The standard two-qubit building block., which flips a target qubit only when a control qubit is set to 1.

Notice the payoff. Any quantum computation, however large, can be built from single-qubit gates plus the CNOT. That is what a universal gate setA small collection of gates that can be combined to build any quantum computation. Single-qubit gates plus the CNOT are enough. means, and it was nailed down mathematically back in the 1990s.1, 3 The theory has been settled for thirty years. The hard part was never the math.

The hard part is precision

The hard part is making gates that are accurate. We measure that with gate fidelityA score (for example 99.9%) for how accurately a quantum gate does what it is supposed to do. Higher means fewer errors., the gap between what a gate is supposed to do and what the hardware actually does. Single-qubit gates are relatively easy. Two-qubit gates are much harder, because getting two qubits to interact cleanly, without letting noise leak in from outside, is a genuine physical fight.2

The theory has been settled for thirty years. The hard part was never the math.

The numbers tell the story. The best trapped ionA qubit made from a single electrically charged atom held in place by electromagnetic fields and controlled with lasers. two-qubit gates now clear 99.9 percent fidelity.4 Some early superconducting qubitA qubit made from tiny electrical circuits chilled to near absolute zero, where they lose all electrical resistance. designs sat far worse, with two-qubit error rates in the tens of percent.2

I will be honest about why this number matters more than almost any other. Error correctionTechniques that combine many shaky physical qubits into fewer reliable ones, so a long calculation stays correct. only begins to help once gates fall below a certain accuracy, the fault toleranceThe milestone where a quantum computer can run long calculations correctly despite ongoing errors. It is the field's holy grail. threshold. Above it, piling on more hardware makes things worse, not better. So the whole promise of a useful quantum computer rests on something most people never look at: how well one gate does its single small job. It is the least glamorous number in the field, and quietly the most important.

Sources

  1. Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. & Weinfurter, H. “Elementary Gates for Quantum Computation.” Physical Review A 52, 3457–3467 (1995). DOI: 10.1103/PhysRevA.52.3457. Preprint: arXiv:quant-ph/9503016.
  2. Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C. & O’Brien, J. L. “Quantum Computers.” Nature 464, 45–53 (2010). DOI: 10.1038/nature08812. Preprint: arXiv:1009.2267.
  3. DiVincenzo, D. P. “Two-Bit Gates Are Universal for Quantum Computation.” Physical Review A 51, 1015–1022 (1995). DOI: 10.1103/PhysRevA.51.1015. Preprint: arXiv:cond-mat/9407022.
  4. Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A. & Lucas, D. M. “High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits.” Physical Review Letters 117, 060504 (2016). DOI: 10.1103/PhysRevLett.117.060504. Preprint: arXiv:1512.04600.