Scott Aaronson

Scott Aaronson
Name	Scott Aaronson
Birth date	1981
Birth place	Philadelphia, Pennsylvania, United States
Fields	Computer science, Quantum computing, Complexity theory
Workplaces	Massachusetts Institute of Technology, University of Texas at Austin
Alma mater	Cornell University, University of California, Berkeley
Doctoral advisor	Umesh Vazirani
Known for	Quantum complexity theory, BosonSampling, Quantum supremacy discussions

Scott Aaronson is an American theoretical computer scientist known for work in quantum computing, computational complexity, and the foundations of physics. He has written influential research on the limits of quantum computation, proposed models and thought experiments that connect Quantum mechanics with Computational complexity theory, and maintained a prominent public presence through blogging and popular writing. Aaronson has held faculty positions at major institutions and has received numerous awards for research and exposition.

Early life and education

Born in Philadelphia, Pennsylvania, Aaronson grew up in the United States and showed early aptitude in mathematics and computer science. He completed undergraduate studies at Cornell University where he was involved with research groups linked to Theory of computation and participated in programs associated with International Mathematical Olympiad-style training. For graduate studies he attended the University of California, Berkeley, completing a Ph.D. under the supervision of Umesh Vazirani with work bridging Quantum computing and Complexity theory. His dissertation and early papers placed him among emerging researchers addressing problems related to BQP, NP, and oracle separations.

Academic career and positions

Aaronson served as a postdoctoral researcher and visiting scholar at institutions including Institute for Advanced Study, Perimeter Institute for Theoretical Physics, and University of Waterloo collaborations, before joining the faculty at the Massachusetts Institute of Technology as a professor in the Computer Science and Artificial Intelligence Laboratory. He later accepted a chair professorship at the University of Texas at Austin in the Department of Computer Science, where he continued supervising graduate students and collaborating with researchers from Google Quantum AI, IBM Research, and national laboratories. Throughout his career he has participated in conferences such as STOC, FOCS, QIP, and Foundations of Quantum Mechanics meetings.

Research contributions and results

Aaronson's research spans quantum algorithms, lower bounds, and complexity-theoretic limits on quantum advantage. He introduced and developed complexity-theoretic frameworks that relate classes like BQP, SZK, PH (the Polynomial Hierarchy), and NP, using oracle constructions and relativization to explore possible separations. Notably, he co-developed the concept of BosonSampling with Alex Arkhipov, proposing an experimentally accessible nonuniversal model of photonic computation intended to demonstrate quantum computational supremacy; this work engaged experimental groups at University of Vienna, University of Bristol, and companies like Google and Xanadu. Aaronson proved results on quantum lower bounds and oracle separations, contributed to the complexity classification of sampling problems, and analyzed implications of hypothetical devices such as closed timelike curves and nonlinear quantum mechanics, drawing connections to work by David Deutsch and thought experiments in Foundations of quantum mechanics.

He has also worked on the limits of quantum advice and quantum copy protection, building on foundational results by Peter Shor, Grover, and Andrew Yao. Collaborations with researchers like Umesh Vazirani, Ambainis, and John Preskill produced results on query complexity, learning theory under quantum models, and the complexity of simulating many-body quantum systems. Aaronson's work often employs diagonalization, interactive proofs (drawing on Babai and Fortnow-era results), and communication complexity methods to derive rigorous constraints on algorithms and physical realizations of computation.

Public engagement and writing

Aaronson maintained a widely read blog that discussed topics spanning Quantum computing, Philosophy of physics, and the social impact of technology, connecting with audiences that include researchers at MIT, readers of Nature, and attendees of public lectures. He has written essays and popular articles for outlets and venues that intersect with Scientific American-style exposition and academic outreach, and he participated in public debates and panels alongside figures from Google Quantum AI, IBM, and universities like Harvard and Princeton. His book aimed at general audiences synthesizes themes from his research and online writing, contributing to public understanding of the promises and limits of quantum computation and complexity. Aaronson has given invited talks at institutions such as Royal Society, National Academy of Sciences symposia, and major conferences like NeurIPS where cross-disciplinary interest in quantum information and computation grows.

Awards and honors

Aaronson's contributions have been recognized with awards including the A. Richard Newton Prize, fellowships from organizations like the Simons Foundation and the National Science Foundation, and invitations to prestigious workshops at the Institute for Advanced Study and Perimeter Institute. He has held named chairs and been listed among influential young scientists by forums associated with SIGACT and national research councils. His BosonSampling proposal and related experimental collaborations have been cited in announcements of quantum advantage by groups at Google and in responses from teams at University of Science and Technology of China.

Personal life and views

Aaronson has discussed intersections between scientific topics and public policy, engaging with scholars from Philosophy, Foundations of quantum mechanics, and Ethics of artificial intelligence communities. He has been open about personal health challenges and how they affected his career trajectory, and he often emphasizes rigorous skepticism about overhyped technological claims while advocating for investment in fundamental research. He lives in the United States and remains active in mentoring students, collaborating internationally with researchers in Canada, United Kingdom, China, and Europe.

Category:Computer scientists Category:Quantum computing