Advanced graduate course on quantum computation and quantum information. Prior knowledge of quantum mechanics is required. The first semester of this twocourse sequence (2.111/18.435J) was taught by Seth Lloyd in the Fall of 2005. This semester, we will cover models of quantum computation, advanced quantum error correction codes, fault tolerance, quantum algorithms beyond factoring, properties of quantum entanglement, and quantum protocols and communication complexity.

Course Textbook Errata 
[T 05Feb]  C  Lecture 1: General introduction; Quantum operations  
[R 07Feb]  C  Lecture 2: Quantum error correction  criteria and examples  [PS#1 out] 
[T 12Feb]  C  Lecture 3: Calderbank Shor Steane codes  
[R 14Feb]  C  Lecture 4: Stabilizers ; stabilizer quantum codes  
[T 19Feb]  No class (Monday schedule)  [PS#2 out, PS#1 due]  
[R 21Feb]  C  Lecture 5: Stabilizers II ; computing on quantum codes  
[T 26Feb]  C  Lecture 6: Concatenated codes ; the threshold theorem  
[R 28Feb]  C  Lecture 7: CWS codes and nonabelian codes  
[T 04Mar]  S  Lecture 8: Cluster state and measurement based quantum computation  [PS#3 out, PS#2 due] 
[R 06Mar]  S  Lecture 9: Measurement based QC, Abelian Topological QC  
[T 11Mar]  S  Lecture 10: Nonabelian topological QC part I  
[R 13Mar]  S  Lecture 11: Nonabelian topological QC part II  [PS#4 out, PS#3 due] 
[T 18Mar]  S  Lecture 12: Quantum algorithms: the abelian hidden subgroup problem ; Quantum Fourier Transform  
[R 20Mar]  S  Lecture 13: The nonabelian HSP ; hidden shift problem  
[T 25Mar]  Spring Break  
[R 27Mar]  Spring Break  
[T 01Apr]  S  Lecture 14: Quantum algorithm for the hidden dihedral subgroup problem  
[R 03Apr]  S  Lecture 15: Entanglement as a physical resource  
[T 08Apr]  S  Lecture 16: Channels I: Quantum data compression; entanglement concentration; typical subspaces  [Project forms out] 
[R 10Apr]  S  Lecture 17: Channels II: Holevo's theorem ; HSW theorem ; entanglement assisted channel capacity  [ PS#4 due ] 
[T 15Apr]  C  Lecture 18: Quantum protocols  quantum communication complexity ; distributed algorithms  [Project forms due] 
[R 17Apr]  C  Lecture 19: Quantum games  
[T 22Apr]  MIT Holiday: Patriot's day  
[R 24Apr]  C  Lecture 20: Quantum cryptography  
[T 29Apr]  Lecture 21: Quantum Advice (guest lecturer: Scott Aaronson)  
[R 01May]  Project meetings  
[T 06May]  Project presentations  
[R 08May]  Project presentations  
[T 13May]  Project presentations  
[R 15May]  All final project papers due 
Syllabus (pdf)  
Problem sets: 
 
Scribe notes: 

[ home ]