-
-
Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
The BQP (bounded-error, quantum, polynomial time) class of problems. Adapted from this Scientific American image. (Image by MIT OpenCourseWare.)
Prof. Scott Aaronson
6.845
Fall 2010
Graduate
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.
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2012
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
