CPSC 648: Quantum Codes and Applications to Complexity

Lecturer: Gaurav Mahajan (gaurav.mahajan@yale.edu)
Office Hours: Tuesday 1-2 PM. Kline Tower, KT 1319
Location: Thursday 1:30-3:20PM. Kline Tower, KT 1327
Canvas: https://yale.instructure.com/courses/100565
Scribe List: link to google sheet
Project List: link to google sheet
Lecture Notes: link to overleaf for scribe

Course Description

The course will cover the theory of quantum error correction and its applications to quantum complexity theory. We will start with basic quantum codes and then progress towards more advanced code constructions, particularly focusing on good quantum low-density parity-check codes. In the latter half of the course, we will discuss various applications of quantum codes in quantum complexity.

Deadlines

Sep 21st: Project selection due
Oct 21st: Rough draft due
Nov 21st: Project presentations
Dec 06th: Final report due

Lectures

Chapter 1 (Week 1): Basics of Quantum Computation
Chapter 2 (Week 2): Introduction to Quantum Codes
Chapter 3 (Week 3): Knill-Laflamme Conditions
Chapter 4 (Week 4): Stabilizer Codes
Chapter 5 (Week 5): Calderbank-Shor-Steane Codes
Chapter 6 (Week 6): Toric Code
Chapter 7 (Week 7): Chain Complexes
Chapter 8 (Week 8): Hypergraph Product Codes
Chapter 9 (Week 8): Tanner Codes
Chapter 10 (Week 9): Quantum Tanner Codes
Chapter 11 (Week 10): Distance of Quantum Tanner Code