Scott Aaronson

Prior to coming to UT, Aaronson taught for nine years in Electrical Engineering and Computer Science at MIT. His primary area of research is theoretical computer science, and his research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.


Research Interests: 
  • The capabilities and limits of quantum computers
  • Computational complexity theory

Select Publications

Aaronson, S. 2013. Quantum Computing Since Democritus. Cambridge University Press.
Aaronson, S., Grier, D., Schaeefer, L. December 11, 2018. A Quantum Query Complexity Trichomy for Regular Languages. Cornell University.
Aaronson, S. August 7, 2018. Quantum Lower Bound for Approximate Counting Via Laurent Polynomials. Cornell University.
Aaronson, S., Chen, X., Hazan, E., Nayak, A. February 25, 2018. Online Learning of Quantum States. Proceedings of NIPS'2018. Cornell University.
Rocchetto, A., Aaronson, S., Severini, S. Carvacho, G., Poderini, D. November 30, 2017. Experimental Learning of Quantum States. Cornell University.

Awards & Honors

2018 - Tomassoni-Chisesi Award
2016 - Vannevar Bush Faculty Fellowship
2015 - IT from Qubit: Simons Collaboration on Quantum Fields, Gravity, and Information
2012 - Alan T. Waterman Award of the National Science Foundation
2011 - Best Paper, International Computer Science Symposium in Russia
2010 - US Presidential Early Career Award for Scientists and Engineers
2009 - Junior Bose Teaching Award, MIT
2009 - DARPA Young Faculty Award
2009 - TIBCO Career Development Chair, MIT
2009 - Sloan Research Fellowship