Syllabus & Reading

Syllabus

The most recent version of the syllabus can be found here (updated 06.06.2019).

Reading

• April 12: Classical complexity theory review.
• April 19: No lecture, Easter holiday.
• April 26: Quantum computation review.
• May 3: Bounded error quantum polynomial time (BQP).
• May 10: Linear systems of equations and a BQP-complete problem.
• May 17: Quantum Merlin Arthur (QMA) and strong error reduction.
• May 31: The Quantum Cook-Levin Theorem.
• June 13: Quantum-Classical Merlin Arthur (QCMA) and Ground State Connectivity.
• June 20: Quantum Interactive Proofs (QIP), semidefinite programs, and multiplicative weights.
• July 5: Boson Sampling.
• July 12: BQP versus the Polynomial Hierarchy.