Ph.D. 2004, University of California, Berkeley

Quantum Computing
Computational Complexity

Scott Aaronson's research focuses on the capabilities and limits of quantum computers, and more generally on computational complexity and its relation to physics. His recent interests include how to demonstrate a quantum computing speedup with the technologies of the near future (via proposals such as BosonSampling, which Aaronson introduced in 2011 with Alex Arkhipov); the largest possible quantum speedups over classical computing; the computational power of closed timelike curves; and the role of computational complexity in the black hole information paradox and the AdS/CFT correspondence. In addition to research, he writes a widely-read blog, and has written about quantum computing for Scientific American, the New York Times, and other popular venues. His first book, Quantum Computing Since Democritus, was published in 2013 by Cambridge University Press.

Aaronson received his bachelor's from Cornell University, and his Ph.D. from UC Berkeley under Umesh Vazirani. He also did postdoctoral fellowships at the Institute for Advanced Study in Princeton as well as at the University of Waterloo. Before coming to UT, he spent nine years as a professor in Electrical Engineering and Computer Science at MIT. He’s received the National Science Foundation’s Alan T. Waterman Award, the United States PECASE Award, the Department of Defense Vannevar Bush Faculty Fellowship, and MIT's Junior Bose Award for Excellence in Teaching.