Quantum Computing 201: Algorithms, Noise and Real Hardware

As with 101, a course here means a curated order to read this site’s free tutorials in, not a separate product. Every module is a tutorial you can already read for nothing, and the stated length is the sum of the modules’ own reading times.

Quantum Computing 101 leaves you able to build a circuit and read a Bloch sphere. That is the easy half.

Quantum Computing 201 is about the hard half: where a speedup actually comes from, why almost every circuit you write will fail on real hardware, and what the compiler quietly does to your gates on the way to the machine. It is the course that turns someone who can write a Bell state into someone who can read a paper.

Who this is for

You have finished 101, or you can already build and run a simple circuit and explain what superposition and entanglement are. You are comfortable with Python and with the linear algebra from 101.

What you will be able to do

• Explain precisely where Grover’s and Shor’s speedups come from, and why they are not the same kind of speedup
• Resist the “quantum computers try all answers at once” story with a specific counterargument
• Read a transpiled circuit and know why it looks nothing like what you wrote
• Reason about decoherence, T1 and T2, and why coherence time matters more than qubit count
• Understand what error correction buys you and what it costs

The curriculum

Module 1: Where speedups come from. How quantum algorithms work. Interference, not parallelism. If you take one idea from this course, take this one.

Module 2: The first real algorithm. Deutsch-Jozsa, the cleanest demonstration that a quantum computer can do something a classical one cannot do as fast.

Module 3: Search. Grover’s algorithm, and the crucial fine print: the speedup is quadratic, not exponential, and that is provably the best possible.

Module 4: Factoring. Shor’s algorithm. Why it breaks RSA, and why it works only because factoring has hidden periodic structure.

Module 5: The limits of the picture. Measurement, decoherence and what the Bloch sphere hides, including mixed states and why an entangled qubit has no arrow at all.

Module 6: Proving entanglement is real. Bell inequalities and the CHSH test. Run the experiment that ruled out local realism.

Module 7: What the compiler does. Qiskit transpilation. Your gates are not the machine’s gates, and the gap between them is where your circuit dies.

Module 8: Fighting noise. Quantum error correction. What it takes to get one reliable logical qubit, and why that number is the real state of the industry.

A warning, and the point of the course

Quantum computing has an honesty problem. A great deal of what is written about it is wrong in the same few ways: that quantum computers try every answer simultaneously, that they solve NP-complete problems, that more qubits straightforwardly means more power.

This course spends as much time on what quantum computers cannot do as on what they can. That is not pessimism. It is the only way to end up with an intuition that survives contact with a real machine.