Introduction to Quantum Error Correction (QEC) Part III: From parity checks to surface-code decoding

Abstract

Quantum error correction addresses a problem with no classical counterpart: protecting an unknown quantum state from noise, when measuring the state disturbs it and the possible errors form a continuum. The resolution, found in the mid-1990s, is algebraic. Suitably chosen commuting measurements produce a binary syndrome that reveals check violations without revealing the encoded state, and correcting finitely many errors turns out to correct all of their linear combinations. This fourth and final lecture gives a rapid review of the basic formalism, followed by a visual survey of stabilizer codes, surface codes, and decoding through worked examples. Only undergraduate linear algebra and elementary probability are assumed; no background in quantum mechanics is required.

Slides and notes are linked above. An interactive nine-qubit patch lets you toggle errors, inspect their syndromes, and compare successful corrections with logical failures. It runs in a browser without installations.