Course description: This course covers quantum information theory, quantum algorithms, quantum error correction, topological quantum computing, quantum Shannon theory, and some special topics.
Class meetings: Monday and Wednesday 2:30-3:55 in 103 Downs.
Lectures and references:
The primary reference for most of the lectures will be these lecture notes (JP). Other useful books are Quantum Computation and Quantum Information by Nielsen and Chuang (NC), Classical and Quantum Computation by Kitaev, Shen, and Vyalyi (KSV), Quantum Computing Since Democritus by Aaronson, and Quantum Information Theory by Wilde.
The fall term focused on quantum algorithms, and was taught by Professor Kitaev.
Course outline for winter term:
The main topics will be quantum error correction (JP Chapter 7), fault-tolerant quantum computing, and topological quantum computing (JP Chapter 9).
Other good references on quantum error correction are this review by Gottesman, and this review by Terhal.
See also these Handwritten
lecture notes on toric code recovery,
fault-tolerant recovery, and fault-tolerant gates
Lecture 1 (Jan 4): The Knill-Laflamme quantum error correction conditions
Course outline for spring term:
Professor Kitaev will teach the first half of this term. The main topic will be connections between quantum information and black holes.
For the second half of the term, the main topic will be quantum Shannon theory (JP Chapter 10). If time allows, we’ll cover an additional topic at the end of term --- perhaps quantum simulation of physical systems.
All students taking the course for credit are required to do the homework. Unless otherwise announced, homework will be due on Thursday at 5pm.
Problem Set 1. CSS quantum codes. Due Thursday 25 January 2018