Quantum Complexity Theory

Diagram showing how the BQP class of problems relates to P, NP, and PSPACE.

The BQP (bounded-error, quantum, polynomial time) class of problems. Adapted from this Scientific American image. (Image by MIT OpenCourseWare.)

Instructor(s)

MIT Course Number

6.845

As Taught In

Fall 2010

Level

Graduate

Cite This Course

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.

Aaronson, Scott. 6.845 Quantum Complexity Theory, Fall 2010. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-845-quantum-complexity-theory-fall-2010 (Accessed). License: Creative Commons BY-NC-SA


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close