Calendar · Lecture Notes
MIT OpenCourseWare
Quantum Complexity Theory
Art: not stated, Fletcher's Combined Block Telegraph Apparatus and Bell, 1889 · Public domain
- Instructor
- Prof. Scott Aaronson
- Term
- Fall 2010
- Level
- Graduate
- What's inside
- 1 problem set · 1 lecture note · 1 reading · 28 other files · 4 web pages
- Materials open
- MIT OCW
About this course
Source: MIT OpenCourseWare 6.845 Quantum Complexity Theory, Fall 2010, Prof. Scott Aaronson — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.
Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.
Before you start
Prerequisites are not listed here. Check MIT's own syllabus for this course.
How this course was organized
What's here, and what isn't
- MIT's own materials here did not support a verified, course-wide order, so they are grouped by section instead.
Not included here
11 items from the source could not be safely included:
- MIT's page format for this item wasn't recognized clearly enough to place it safely. (10 items)
- Referenced in a table, but without MIT's own verified order, so it isn't used to claim a sequence.
Materials by section
Grouped by section, as MIT organized them. Not sequenced or ordered.
Lecture Notes
25 files
- Lecture 1 · Quantum basics Download
- Lecture 2 · More quantum basics Download
- Lecture 3 · Quantum circuits Download
- Lecture 4 · BQP and classical friends Download
- Lecture 5 · Quantum algorithms: Deutsch-Jozsa Download
- Lecture 6 · Quantum algorithms: Simon’s algorithm Download
- Lecture 7 · Shor’s algorithm and the hidden subgroup problem Download
- Lecture 8 · Hidden subgroup problem and Grover’s algorithm Download
- Lecture 9 · Grover’s algorithm and BBBV Download
- Lecture 10 · Quantum query complexity lower bounds Download
- Lecture 11 · More quantum query complexity Download
- Lecture 12 · Query complexity and the collision problem Download
- Lecture 13 · The collision problem Download
- Lecture 14 · BQP vs. PH and QMA Download
- QMA Download
- Lecture 16 · QMA and variants Download
- Lecture 17 · QIP Download
- Lecture 18 · PostBQP Download
- Lecture 19 · Closed timelike curves · Lecture notes (Courtesy of Joshua Horowitz. Used with permission.) Download
- Lecture 20 · BQP/qpoly Download
- Lecture 21 · Quantum communication complexity · Lecture notes (Courtesy of Colin Jia Zheng. Used with permission.) Download
- Lecture 22 · More quantum communication complexity · Lecture notes (Courtesy of Colin Jia Zheng. Used with permission.) Download
- Lecture 23 · Classical simulation Download
- Lecture 24 · Grab bag Download
- Additional Slides Quantum computing with noninteracting particles (Courtesy of Alex Arkhipov. Used with permission.) Download
Assignments
Course outline
Calendar · Lecture Notes
Lecture 2: More quantum basics
Calendar · Lecture Notes
Lecture 3: Quantum circuits
Calendar · Lecture Notes
Lecture 4: BQP and classical friends
Calendar · Lecture Notes
Lecture 5: Quantum algorithms: Deutsch-Jozsa
Calendar · Lecture Notes
Lecture 6: Quantum algorithms: Simon’s algorithm
Calendar · Lecture Notes
Lecture 7: Shor’s algorithm and the hidden subgroup problem
Calendar · Lecture Notes
Lecture 8: Hidden subgroup problem and Grover’s algorithm
Calendar · Lecture Notes
Lecture 9: Grover’s algorithm and BBBV
Calendar · Lecture Notes
Lecture 10: Quantum query complexity lower bounds
Calendar · Lecture Notes
Lecture 11: More quantum query complexity
Calendar · Lecture Notes
Lecture 12: Query complexity and the collision problem
Calendar · Lecture Notes
Lecture 13: The collision problem
Calendar · Lecture Notes
Lecture 14: BQP vs. PH and QMA
Calendar · Lecture Notes
Lecture 15: QMA
Calendar · Lecture Notes
Lecture 16: QMA and variants
Calendar · Lecture Notes
Lecture 17: QIP
Calendar · Lecture Notes
Lecture 18: PostBQP
Calendar · Lecture Notes
Lecture 19: Closed timelike curves
Calendar · Lecture Notes
Lecture 20: BQP/qpoly
Calendar · Lecture Notes
Lecture 21: Quantum communication complexity
Calendar · Lecture Notes
Lecture 22: More quantum communication complexity
Calendar · Lecture Notes
Lecture 23: Classical simulation
Calendar · Lecture Notes
Lecture 24: Grab bag
Calendar · Lecture Notes
Lecture 25: Student project presentations
Calendar · Lecture Notes
Lecture 26: Student project presentations (cont.)
MIT OpenCourseWare, Prof. Scott Aaronson, 6.845 Quantum Complexity Theory, Fall 2010.
License: CC BY-NC-SA 4.0 · Edition: Fall 2010 · Open the original course on OCW ↗
Organized by RedLectern, independent of MIT and not endorsed by MIT.
Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.
