Scott Aaronson

Scott Aaronson is a Professor of Computer Science at the University of Texas at Austin, holding the David Bruton, Jr. Centennial Professorship. Prior to joining UT, he was a faculty member in Electrical Engineering and Computer Science at MIT for nine years. His research focuses on theoretical computer science, particularly the capabilities and limits of quantum computers and computational complexity theory.

Professor Aaronson's research spans a wide range of topics in quantum computing, computational complexity theory, and quantum information. His work explores fundamental questions about what problems quantum computers can solve efficiently, how they compare to classical computers, and the theoretical limits of quantum computation. He has made significant contributions to areas such as quantum algorithms, quantum complexity classes, quantum cryptography, and the theoretical foundations of quantum mechanics.

Analysis of Aaronson's recent publications reveals a strong focus on establishing quantum advantage and understanding the separation between quantum and classical computation. His work spans theoretical foundations (such as complexity class relationships and query complexity) to more applied aspects (like quantum randomness generation and quantum cryptography). A recurring theme is using computational complexity theory to address fundamental questions in quantum mechanics and quantum gravity, particularly through connections to the AdS/CFT correspondence.

• 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

Aaronson has supervised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by major grants from the National Science Foundation, Department of Defense, and private foundations. His work on quantum supremacy experiments, particularly related to random circuit sampling and certified randomness, has had significant impact in both theoretical and experimental quantum computing communities.

Professor Aaronson maintains an active research group at UT Austin focused on quantum computing and theoretical computer science. His group collaborates with both theoretical physicists working on quantum gravity and experimental quantum computing groups. He is also known for his influential blog "Shtetl-Optimized," where he discusses technical topics in quantum computing as well as broader issues in science and academia.