kevinferron.comKevin Ferron

Interactive tutorials · Simulated in your browser

Quantum computing, by hand

Quantum computing from the amplitudes up: short tutorials, each with something to drag, run and break. Vectors and matrices are enough; the rest is introduced as a length and an angle. Everything is simulated live in your browser, so you can watch the numbers a quantum computer is built to steer.

The idea the series argues: a quantum computer is not a machine that tries every answer at once. It is a machine that steers amplitudes so the wrong answers cancel. The tutorial on interference is where that is shown on screen, and every algorithm after it leans on it.

100%70.4%|0⟩29.6%|1⟩

Drag the arrow. Height is chance; colour is phase.

The learning map

Arrows mean “builds on”. Interference is the hinge: it is the one idea every algorithm after it uses, so it is the page to read if you read only one.

  1. Foundations

  2. Two qubits and up

  3. Algorithms

  4. Reality

    • 11 · Noise and correctioncoming · needs 5, 8, 9, 10
    • 12 · Real versus hypecoming · needs 11
  • Centres on the bloch sphere
  • Centres on the amplitude bars
  • Centres on the circuit
  • Centres on the shots
  • Dashed: coming

The tutorials

What this is not

  • It is not a quantum computer. Every number on these pages comes from a simulator running on your own processor, in ordinary double-precision arithmetic.
  • It does not reach past ten qubits, which is 1,024 amplitudes. That is enough to see every idea, and it is also why a simulator stops being a good way to learn what large machines do.
  • It makes no claim about what any real machine can or cannot do today. A later tutorial will read hardware headlines against dated, primary sources; this release has none.
  • It is a first pass for developers, not a course. The books and courses below are the real thing.

Prior art and further reading

None of this is copied from them; they are where to go next.

  • Quirk — A drag-and-drop circuit simulator with live displays. The best place to build a circuit of your own once you know what the pieces do.
  • Quantum Country — An essay with built-in spaced-repetition review. The search essay in the same series gives a clear rotation picture of Grover’s algorithm.
  • IBM, Basics of Quantum Information — A free course on quantum information, with a companion on algorithms.
  • Preskill, Ph219 — Lecture notes from a Caltech course, from states and measurement through algorithms and error correction.
  • Nielsen and Chuang — The standard textbook.
  • Aaronson, lecture notes — Lecture notes that go from the Bloch sphere to Shor, with a sceptic’s eye on what is claimed.

The phase colours here are the ones on the hydrogen orbitals page: green for phase 0, magenta for half a turn.

Sources

  1. Shtetl-Optimized Shtetl-Optimized (the blog’s banner line). Scott Aaronson. Live page.

    • The point that a quantum computer does not try every answer at once
  2. Quirk Quirk, a drag-and-drop quantum circuit simulator. Craig Gidney, v2.3, 2016. Apache-2.0. Prior art; nothing is copied from it.

    • Further reading
  3. Quantum Country Quantum computing for the very curious. Andy Matuschak and Michael Nielsen. Live essay; no date shown on the page.

    • Further reading
  4. IBM, Basics of Quantum Information Basics of Quantum Information (IBM Quantum Learning). IBM. Live course: single systems, multiple systems, circuits, entanglement in action.

    • Further reading
  5. Preskill, Ph219 Ph219/CS219 Quantum Computation (course page and lecture notes). John Preskill, Caltech. Live page.

    • Further reading
  6. Nielsen and Chuang Quantum Computation and Quantum Information (10th anniversary edition). Michael A. Nielsen and Isaac L. Chuang, Cambridge University Press, 2010. Paywalled.

    • Further reading
  7. Aaronson, lecture notes Introduction to Quantum Information Science, lecture notes. Scott Aaronson. PDF; the outline lists the Bloch sphere, Grover and Shor lectures.

    • Further reading

Paraphrased, not quoted. The further-reading entries are listed so you can find them; this page makes no claim about their content beyond the one-line notes above.