The first course asked what is quantum information? This one asks how do I design and run the machine? Sixteen chapters across five parts — from wiring single gates into circuits, through the great algorithms, NISQ and variational methods, error correction, and finally writing code that runs on real hardware. Same hands-on labs, same full mathematics, no new prerequisites beyond the QI course.
Universal gate sets — how a handful of gates can build any operation at all.
CNOT, CZ, Toffoli, controlled-U — the gates that let qubits act on each other.
The one trick behind every algorithm: a target’s phase kicks back onto the control.
Ancillas, uncomputation, and how a yes/no question becomes a quantum gate.
Grover as a rotation — boost any recognizable answer in √N steps.
Turn a number into a winding rate, from H and controlled phase turns.
The workhorse: read a gate’s hidden phase out in binary.
Period-finding to factoring, end to end — only one step is quantum.
Trotterization — simulate nature by slicing time, the application Feynman dreamed of.
The language of codes — ask parity questions that catch errors without reading the data.
Spread a qubit over a 2-D tile; errors become chains you cure by connecting endpoints.
The line that makes error correction work — and the magic states needed for the last gate.
Sixteen chapters, gate to fault-tolerant machine. Start at Part A, or revisit the Quantum Information course it’s built on.