Scott Aaronson
Scott Joel Aaronson (born May 21, 1981 in Philadelphia ) is an American computer scientist .
Aaronson grew up partly in Hong Kong and studied computer science at Cornell University from 1997 with a bachelor's degree in 2000 and received his doctorate in 2004 from the University of California, Berkeley , with Umesh Vazirani ( Limits on Efficient Computation in the Physical World ). As a post-doctoral student he was at the Institute for Advanced Study in 2004/05 and at the Institute of Quantum Computing at the University of Waterloo from 2005 to 2007 . He taught at the Massachusetts Institute of Technology (Assistant Professor from 2007 and Associate Professor with tenure from 2013 ) and has been Professor at the University of Texas at Austin ( David J. Bruton Centennial Professor of Computer Science) since 2016, where he is Director of the Quantum Information Center.
He researches the capabilities and limits of quantum computers and complexity theory . His motivation for studying quantum computers, regardless of the question of their feasibility, is directed towards what insights their studies also provide about the physical structure of the world.
In 2010, together with Alex Arkhipov, he developed a rudimentary model of a quantum computer with linear optical elements and, under some plausible conditions, showed that it can solve problems that a classic computer cannot solve efficiently (in polynomial time).
In 2012 he received the Alan T. Waterman Award . In 2009 he was a Sloan Fellow and received an NSF Career Award. He has been a Fellow of the Association for Computing Machinery since 2019 .
Fonts
- with Daniel Gottesman: Improved Simulation of Stabilizer Circuits , Phys. Rev. A 70, 2004, p. 052328
- Limitations of quantum advice and one-way communication , Theory of Computing, Volume 1, 2005, pp. 1-28
- with A. Ambainis: Quantum search of spatial regions , Theory of Computing, Volume 1, 2005, pp. 47–79,
- NP-complete problems and physical reality , SIGACT News Complexity Theory Column, March 2005, Arxiv
- Lower bounds for local search by quantum arguments , SIAM Journal on Computing, Volume 35, 2006, pp. 804-824
- with G. Kuperberg: Quantum versus classical proofs and advice , Theory of Computing, Volume 3, 2007, pp. 129–157
- Quantum certificate complexity , Journal of Computer and System Sciences, Volume 74, 2008, pp. 313-322
- with S. Beigi, A. Drucker, B. Fefferman, P. Shor: The power of unentanglement , Theory of Computing, Volume 5, 2009, pp. 1-42
- with J. Watrous: Closed timelike curves make classical and quantum computing equivalent , Proceedings of the Royal Society A, Volume 465, 2009, pp. 631-647
- with A. Wigderson: Algebrization: A new barrier in complexity theory , ACM Transactions on Computing Theory, Volume 1, 2009, p. 2
- The limits of quantum computers , Scientific American, March 2008, draft, pdf
- Why Philosophers Should Care About Computational Complexity , in: Computability, Gödel, Turing, Church and beyond , MIT Press 2012, Arxiv
- The ghost in the quantum Turing machine , Arxiv 2013
- Quantum computing since Democritos , Cambridge University Press 2013
- with L. Chen: Complexity-Theoretic Foundations of Quantum Supremacy Experiments , Arxiv 2016
- P =? NP , in: John Forbes Nash, Michael Rassias (Eds.), Open problems mathematics, Springer 2016, pp. 1–122
Web links
- Homepage at at the University of Texas
- His blog Shtetl optimized
- His Complexity Zoo Wiki
- Aaronson, Physics in the 21st century , TEDx Talk (Caltech)
Individual evidence
- ^ Scott Aaronson in the Mathematics Genealogy Project (English) , published in Arxiv
- ^ Scott Aaronson, Alex Arkhipov, The Computational Complexity of Linear Optics , Arxiv 2010
- ↑ His blog on this with the article in a revised version.
| personal data | |
|---|---|
| SURNAME | Aaronson, Scott |
| ALTERNATIVE NAMES | Aaronson, Scott Joel (full name) |
| BRIEF DESCRIPTION | American computer scientist |
| DATE OF BIRTH | May 21, 1981 |
| PLACE OF BIRTH | Philadelphia |