Scott Aaronson

Scott Joel Aaronson, born on 21 May 1981, is an American theoretical computer scientist best known for his work on quantum computing and computational complexity theory. He is the David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin and serves as the director of the Quantum Information Center. He previously held a faculty position at the Massachusetts Institute of Technology and continues to play a central role in shaping the theory behind quantum computation and its limits.

Aaronson showed strong ability in mathematics from an early age and taught himself calculus at the age of 11. He also learned computer programming at a young age, which led him towards theoretical computer science rather than applied software development. He completed his undergraduate degree in computer science at Cornell University in 2000 and later earned a PhD in computer science from the University of California, Berkeley, in 2004, under the supervision of Umesh Vazirani. His doctoral work focused on computational complexity and quantum computation.

After postdoctoral research at the Institute for Advanced Study and the University of Waterloo, Aaronson joined MIT as a faculty member in 2007. In 2016, he moved to the University of Texas at Austin, where he became the founding director of the Quantum Information Center. In 2022, he also spent two years working at OpenAI on the theoretical foundations of AI safety, contributing to long-term research on the limits and risks of advanced artificial intelligence.

Aaronson’s research focuses on the power and limitations of quantum computers, complexity classes, quantum algorithms, learning theory, and the relationship between physics and computation. He is the author of the book Quantum Computing Since Democritus, which is based on his graduate-level course and connects quantum mechanics, complexity theory, and broader scientific questions. He is also the founder of the Complexity Zoo, a widely used online reference for computational complexity classes, and writes the long-running blog Shtetl-Optimized.

His work has been widely recognised. He has received the Alan T. Waterman Award, the US Presidential Early Career Award for Scientists and Engineers, a Sloan Research Fellowship, the Vannevar Bush Faculty Fellowship, and the ACM Prize in Computing. He is an ACM Fellow and a Simons Investigator. Aaronson is frequently cited in academic literature and mainstream media for his clear explanations of quantum computing and its real-world limits.

Scott Joel Aaronson was born on 21 May 1981 in the United States. From an early age, he showed a strong interest in mathematics and abstract thinking. By the age of 11, he had taught himself calculus after seeing mathematical symbols in a textbook, and around the same time he began learning computer programming. Although he felt behind some of his peers in programming, his early exposure to advanced mathematics led him to develop a deep interest in theoretical computer science, especially questions about what computers can and cannot do.

During his childhood, Aaronson spent a year in Hong Kong when his father, a former science writer who later worked in public relations, was posted there. While studying in Hong Kong, he attended a school that allowed him to move ahead quickly in mathematics. After returning to the United States, he found the traditional school system restrictive and struggled with grades and discipline. He later enrolled in The Clarkson School, a gifted education programme run by Clarkson University, which allowed him to apply to university while still in his first year of high school.

Aaronson was accepted to Cornell University, where he completed a Bachelor of Science degree in computer science in 2000. While at Cornell, he lived at the Telluride House and became increasingly interested in computational complexity theory and quantum computing. He went on to pursue doctoral studies at the University of California, Berkeley, where he earned a PhD in computer science in 2004 under the supervision of Umesh Vazirani. His doctoral research focused on computational complexity and the theoretical foundations of quantum computing.

After completing his PhD, Aaronson undertook postdoctoral research at the Institute for Advanced Study and later at the University of Waterloo. In 2007, he joined the Massachusetts Institute of Technology as a faculty member, where he carried out research and teaching in quantum computing and computational complexity theory. His work during this period addressed fundamental questions about the capabilities and limits of quantum computers, quantum algorithms, quantum lower bounds, and the relationship between computation and physical laws.

In 2016, Aaronson moved from MIT to the University of Texas at Austin, where he became the David J. Bruton Jr. Centennial Professor of Computer Science and the founding director of the Quantum Information Center. In this role, he has led research efforts in quantum information science and supervised students working on theoretical aspects of quantum computing, learning theory, and complexity theory. In 2022, he announced that he would spend a year working at OpenAI on research related to the theoretical foundations of artificial intelligence safety. He ultimately worked at OpenAI for two years, contributing to discussions on long-term risks and limits of advanced AI systems.

Aaronson’s research covers theoretical computer science, with a particular focus on computational complexity theory and quantum computing. He has made important contributions to understanding the power and limitations of quantum computers, quantum query complexity, approximate counting, and the learning of quantum states. His work often explores how physical principles shape what can be computed and how efficiently it can be done. He has published widely in leading academic journals and conference proceedings, including work on quantum lower bounds, online learning of quantum states, and experimental and theoretical approaches to quantum learning.

In addition to his academic research, Aaronson is known for his efforts to communicate complex ideas clearly. He is the founder of the Complexity Zoo, an online resource that catalogues classes in computational complexity theory and is widely used by researchers and students. He also writes a long-running blog titled Shtetl-Optimized, where he discusses topics related to quantum computing, complexity theory, physics, artificial intelligence, and academic life. His writing often combines technical discussion with broader reflections on science and society.

Aaronson has also played a significant role in education. He has taught graduate-level courses, including a course titled “Quantum Computing Since Democritus.” The lecture notes from this course were later developed into a book of the same name, published by Cambridge University Press in 2013. The book connects quantum computing with topics such as quantum mechanics, complexity theory, information theory, and philosophical questions about computation and knowledge. He has also written essays and articles aimed at both academic and general audiences, including work on the limits of quantum computers and the role of computational complexity in philosophy.

His contributions have been recognised through numerous awards and honours. These include the Alan T. Waterman Award from the National Science Foundation, the US Presidential Early Career Award for Scientists and Engineers, the Sloan Research Fellowship, the DARPA Young Faculty Award, the Vannevar Bush Faculty Fellowship, and the Tomassoni-Chisesi Award. He has also received teaching and research awards during his time at MIT. In later years, he was named a Simons Investigator, elected an ACM Fellow, and awarded the ACM Prize in Computing for his contributions to quantum computing and computational complexity theory.

Scott Aaronson’s vision is centred on understanding what computers can and cannot do, especially when the laws of quantum physics are taken into account. He aims to clearly define the real capabilities and limits of quantum computers, separating what is theoretically possible from what is often assumed or overstated. An important part of his vision is to build strong theoretical foundations so that future technologies are developed on sound scientific understanding. He also believes in explaining complex ideas in a clear and honest way, helping students, researchers, and the wider public make informed decisions about quantum computing and advanced artificial intelligence.

Scott Aaronson has received several major awards for his contributions to quantum computing and computational complexity theory. He was one of the two winners of the 2012 Alan T. Waterman Award, recognising outstanding early-career scientists. He received Best Student Paper Awards at the Computational Complexity Conference for his work on quantum advice and quantum certificate complexity, and the Danny Lewin Best Student Paper Award at the Symposium on Theory of Computing in 2004. He was awarded the US Presidential Early Career Award for Scientists and Engineers and a Sloan Research Fellowship in 2009. In 2017, he was named a Simons Investigator. He was elected an ACM Fellow in 2019 and received the ACM Prize in Computing in 2020.