Tap Next (or use your arrow keys) to move one idea at a time. A fixed three-question check waits at the end: the course's own checkpoint, same questions every attempt. The ← up top exits whenever you like; progress keeps.
Stabilizer formalism
Stabilizer codes define a protected codespace as the simultaneous +1 eigenspace of commuting Pauli operators. Measuring stabilizers reveals syndromes without directly learning the logical state.
Syndromes identify error classes while preserving encoded information.
Surface codes and thresholds
Surface codes use local checks on a two-dimensional lattice and have relatively high thresholds. Code distance controls the number of correctable errors and physical-qubit overhead. Logical failure depends on physical error rates, decoder quality, and circuit details.
Below threshold, increasing code distance can exponentially suppress logical errors.
Fault-tolerant gates and magic states
Clifford gates are comparatively accessible in stabilizer codes, but universal computation requires a non-Clifford resource such as T gates. Magic-state distillation can dominate qubit and time overhead.
T-count and magic-state production are central resource metrics for fault-tolerant algorithms.
Applied activity
Advanced exercise: derive or simulate one representative result from this module, document assumptions, and produce a one-page technical interpretation for a non-specialist decision maker.
Read the full lesson text
1. Stabilizer formalism
Stabilizer codes define a protected codespace as the simultaneous +1 eigenspace of commuting Pauli operators. Measuring stabilizers reveals syndromes without directly learning the logical state.
Syndromes identify error classes while preserving encoded information.
2. Surface codes and thresholds
Surface codes use local checks on a two-dimensional lattice and have relatively high thresholds. Code distance controls the number of correctable errors and physical-qubit overhead. Logical failure depends on physical error rates, decoder quality, and circuit details.
Below threshold, increasing code distance can exponentially suppress logical errors.
3. Fault-tolerant gates and magic states
Clifford gates are comparatively accessible in stabilizer codes, but universal computation requires a non-Clifford resource such as T gates. Magic-state distillation can dominate qubit and time overhead.
T-count and magic-state production are central resource metrics for fault-tolerant algorithms.
4. Applied activity
Advanced exercise: derive or simulate one representative result from this module, document assumptions, and produce a one-page technical interpretation for a non-specialist decision maker.
Audio playback uses your device's built-in voice: no downloads, works offline.
