Quantum Computation, Lecture 24, QEC, Part 5, Linear codes continued, Mar 17, 2022
Channel: Deepak Vaid
Date: 2022-03-18

continued discussion of classical linear codes from the previous lecture.


Parity check matrix; codewords as vectors living in the kernel of the parity check matrix; description of error diagnosis and recovery procedure for single bit flip error in an [n,k] code.


Hamming distance: definition; geometric interpretation in terms of discrete lattices; use as a measure to quantify the distinguishability of codewords and the efficiency of a given code.


Notion of dual and self-dual codes and start of discussion of (quantum) CSS codes.