Scott Aaronson is the David J. Bruton Centennial Professor of Computer Science at The University of Texas at Austin, USA, and director of its Quantum Information Center.
Scott’s research focuses on the capabilities and limits of quantum computers, which are believed to solve some important algorithms much faster than any classical computer. He is an expert in the field of “computational complexity theory.” For example, Scott is well-known for his “complexity zoo,” which helps to classify problems that can be solved by computers, both quantum and classical, according to how hard it is to solve them.
Scott is an accomplished academic researcher who published dozens of influential papers and won various notable awards, like the Alan T. Waterman Award in 2012. Before his current position at UT Austin, he taught at the prestigious Massachusetts Institute of Technology for nine years. In 2004, he received his Ph.D. from the University of California at Berkeley and held positions at the University of Waterloo and the Institute for Advanced Study in Princeton.
Furthermore, Scott is well-known for his ability to explain complex topics in quantum computing to a general audience. He writes a popular blog, “Shtetl-Optimized,” has composed several famous essays, co-authored webcomics, and published a book “Quantum Computing since Democritus.”