![]() |
|||||
MIT EECS Subject
|
|||||
|
6.896 Quantum Complexity Theory . . . Description Graduate-H Prereq: 6.840, 6.089, or equivalent OR 2.111, 18.435, or equivalent OR permission of instructor Units: 3-0-9 Schedule: L TR2:30-4, Room 26-314 Staff: Professor Scott Aaronson, aaronson@csail.mit.edu |
This subject qualifies as Theoretical Computer Science Engineering Concentration subject.
This course is an introduction to quantum computational complexity theory, the study of the fundamental capabilities and limitations of quantum computers. Topics include quantum complexity classes, quantum query complexity lower bounds, quantum communication complexity, quantum proofs and advice, quantum interactive proof systems, postselected quantum computing, classical simulations of quantum circuits, space-bounded quantum computing, and more depending on student interest. The goal is to bring students to the research frontier.