6.845 | Fall 2010 | Graduate

Quantum Complexity Theory

6-845f10-th.jpg

Description:

New image Upload

Alt text:
Diagram showing how the BQP class of problems relates to P, NP, and PSPACE.
Caption:
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.)
Diagram showing how the BQP class of problems relates to P, NP, and PSPACE.

Course Info

As Taught In
Fall 2010
Level