The BQP (bounded-error, quantum, polynomial time) class of problems. Adapted from Aaronson, Scott. "The limits of quantum computers." Scientific American 298, no. 3 (2008): 50-57. (Image by MIT OpenCourseWare.)
Instructor(s)
Prof. Scott Aaronson
MIT Course Number
6.845
As Taught In
Fall 2010
Level
Graduate
Course Description
Course Features
Course Description
This course is an introduction to quantum computational complexity theory, the study of the fundamental capabilities and limitations of quantum computers. Topics include complexity classes, lower bounds, communication complexity, proofs, advice, and interactive proof systems in the quantum world. The objective is to bring students to the research frontier.