Key Takeaways: Chapter 23 — Classical Error Correction Review: Repetition Codes, Hamming Codes, and Why Quantum Is Harder (No-Cloning Theorem)

• Classical repetition codes use redundancy and majority voting to suppress errors from $p$ to $O(p^2)$, but at the cost of low rate.
• Linear codes are defined by generator matrix $G$ and parity-check matrix $H$; the syndrome $s = H r^T$ depends only on the error pattern, not the message.
• Hamming codes are perfect single-error-correcting codes with elegant syndrome decoding: the syndrome directly encodes the error position.
• The no-cloning theorem prohibits copying unknown quantum states, forcing QEC to use entanglement rather than redundancy.
• Measurement destroys superposition, so QEC must extract error information via syndrome measurements that commute with logical operators.
• Continuous errors are digitized by the syndrome measurement, collapsing them onto a discrete set of Pauli errors—this is the "miracle" of QEC.
• The quantum repetition code for bit flips encodes $|\psi\rangle$ as $\alpha|000\rangle + \beta|111\rangle$ and uses $Z_i Z_j$ stabilizer measurements to detect $X$ errors—but it is blind to $Z$ errors.
• The classical-to-quantum bridge maps parity checks to stabilizers, binary syndromes to eigenvalue measurements, and bit flips to Pauli errors—preserving the linear-algebraic structure while adapting it to the quantum setting.