6.845 | Fall 2010 | Graduate

Quantum Complexity Theory



The course has no official textbook. However, students may find the following books helpful:

Nielsen, Michael, and Issac Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2011. ISBN: 9781107002173.

Mermin, David. Quantum Computer Science: An Introduction. Cambridge University Press, 2007. ISBN: 9780521876582.

Arora, Sanjeev, and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009. ISBN: 9780521424264.

Sipser, Michael. Introduction to the Theory of Computation. 2nd ed. Course Technology, 2005. ISBN: 9780534950972.


These papers were not assigned, but may be of interest:

Watrous, John. “Quantum Computational Complexity.”

Bernstein, Ethan, and Umesh Vazirani. “Quantum Complexity Theory.” SIAM Journal on Computing 26 (1997): 1411-1473.

Bennett, Charles, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani. “Strengths and Weaknesses of Quantum Computing.” SIAM Journal on Computing 26 (1997): 1510-1523.

Beals, Robert, et al. “Quantum Lower Bounds by Polynomials.”

Ambainis, Andris. “Quantum Lower Bounds by Quantum Arguments.”

Watrous, John. “Succinct Quantum Proofs for Properties of Finite Groups.”

Kitaev, Alexei, and John Watrous. “Parallelization, Amplification, and Exponential Time Simulation of Quantum Interactive Proof Systems.” Proceedings of the 32nd ACM Symposium on Theory of Computing (2000): 608-617.

Course Info

As Taught In
Fall 2010