Scott Aaronson

Scott Aaronson
Born Scott Joel Aaronson
(1981-05-21) May 21, 1981
Philadelphia, Pennsylvania, United States
Nationality American
Fields Computational complexity theory, Quantum Computing
Institutions University of Texas at Austin
Massachusetts Institute of Technology
Institute for Advanced Study
University of Waterloo
Alma mater Cornell University
University of California, Berkeley
Doctoral advisor Umesh Vazirani
Known for Quantum Turing with postselection
Algebrization
Notable awards Alan T. Waterman Award
PECASE
Website
http://www.scottaaronson.com/blog/

Scott Joel Aaronson (born May 21, 1981)[1] is a theoretical computer scientist. His primary area of research is quantum computing and computational complexity theory more generally.

Early life and education

Aaronson grew up in the United States, though he spent a year in Asia when his father—a science writer turned public-relations executive—was posted to Hong Kong.[2] He enrolled in a school there that permitted him to skip ahead several years in math, but upon returning to the US, he found his education restrictive, getting bad grades and having run-ins with teachers. He enrolled in a program for gifted youngsters run by Clarkson University, which enabled Aaronson to apply for colleges while only in his freshman year of high school.[2] He was accepted into Cornell University, where he obtained his BSc in computer science in 2000,[3] then attended the University of California, Berkeley, for his PhD, which he got in 2004 under the supervision of Umesh Vazirani.[4] He is an atheist.[5]

Aaronson had shown ability in mathematics from an early age, teaching himself calculus at the age of 11, provoked by symbols in a babysitter's textbook. He discovered computer programming at age 11, and felt he lagged behind peers, who had already been coding for years. Partly for this reason, he felt drawn to theoretical computing, particularly computational complexity. At Cornell, he became interested in quantum computing, and devoted himself to computational complexity and quantum computing.[2]

Career

After postdoctorates at the Institute for Advanced Study and the University of Waterloo, he took a faculty position at MIT in 2007.[3] His primary area of research is quantum computing and computational complexity theory more generally.

In the summer of 2016 he moved from MIT to the University of Texas at Austin as David J. Bruton Jr. Centennial Professor of Computer Science and as the founding director of UT Austin's new quantum computing center.[6]

Awards

He is a founder of the Complexity Zoo wiki, which catalogs all classes of computational complexity.[8][9] He is the author of the much-read blog "Shtetl-Optimized"[10] as well as the essay "Who Can Name The Bigger Number?".[11] The latter work, widely distributed in academic computer science, uses the concept of Busy Beaver Numbers as described by Tibor Radó to illustrate the limits of computability in a pedagogic environment. He has also taught a graduate-level survey course called Quantum Computing Since Democritus,[12] for which the notes are available online and which has been published as a book by Cambridge University Press.[13] It weaves together seemingly disparate topics into a cohesive whole, including quantum mechanics, complexity, free will, time travel, the anthropic principle and many others. Many of these interdisciplinary applications of computational complexity were later fleshed out in his article "Why Philosophers Should Care About Computational Complexity".[14] An article of Aaronson's, "The Limits of Quantum Computers", was published in Scientific American,[15] and he was a guest speaker at the 2007 Foundational Questions in Science Institute conference.[16] Aaronson is frequently cited in non-academic press, such as Science News,[17] The Age,[18] ZDNet,[19] Slashdot,[20] New Scientist,[21] The New York Times,[22] and Forbes magazine.[23]

Controversy

Aaronson was the subject of media attention in October 2007, when he accused Love Communications (an advertising agency) of plagiarizing a lecture[24] he wrote on quantum mechanics in an advertisement of theirs.[25] He alleged that a commercial for Ricoh Australia by Sydney-based agency Love Communications appropriated content almost verbatim from the lecture.[26] Aaronson received an email from the agency claiming to have sought legal advice and saying they did not believe that they were in violation of his copyright. Unsatisfied, Aaronson pursued the matter, and the agency settled the dispute without admitting wrongdoing by making a charitable contribution to two science organizations of his choice. Concerning this matter, Aaronson stated, "Someone suggested [on my blog] a cameo with the models but if it was between that and a free printer, I think I'd take the printer."[27]

References

  1. ↑ Aaronson, Scott. "Scott Aaronson". Qwiki.
  2. 1 2 3 Hardesty, Larry (7 April 2014). "The complexonaut". mit.edu. Retrieved 2014-04-12.
  3. 1 2 CV from Aaronson's web site.
  4. ↑ Scott Joel Aaronson at the Mathematics Genealogy Project
  5. ↑ Scott Aaronson (January 16, 2007). "Long-awaited God post". Shtetl-Optimized – The Blog of Scott Aaronson. Retrieved June 15, 2013. If you'd asked, I would've told you that I, like yourself, am what most people would call a disbelieving atheist infidel heretic.
  6. ↑ Shetl-Optimized, "From Boston to Austin", February 28th, 2016.
  7. ↑ NSF to Honor Two Early Career Researchers in Computational Science With Alan T. Waterman Award, National Science Foundation, March 8, 2012, retrieved 2012-03-08.
  8. ↑ Automata, Computability and Complexity by Elaine Rich (2008) ISBN 0-13-228806-0, p. 589, section "The Complexity Zoo"
  9. ↑ The Complexity Zoo page (originally) at Qwiki (a quantum physics wiki, Stanford University)
  10. ↑ "Shtetl-Optimized". scottaaronson.com. Retrieved 2014-01-23.
  11. ↑ Aaronson, Scott. "Who Can Name the Bigger Number?". academic personal website. Electrical Engineering and Computer Science, MIT. Retrieved 2014-01-02.
  12. ↑ "PHYS771 Quantum Computing Since Democritus". scottaaronson.com. Retrieved 2014-01-23.
  13. ↑ "Quantum Computing Democritus :: Quantum physics, quantum information and quantum computation :: Cambridge University Press". cambridge.org. Retrieved 2014-01-23.
  14. ↑ Aaronson, Scott (2011). "Why Philosophers Should Care About Computational Complexity". arXiv:1108.1791v3 Freely accessible [CC cs. CC].
  15. ↑ Aaronson, Scott (February 2008). "The Limits of Quantum Computers". Scientific American. 298 (3): 62. Bibcode:2008SciAm.298c..62A. doi:10.1038/scientificamerican0308-62.
  16. ↑ "Foundational Questions in Science Institute conference". The Science Show. ABC Radio. 18 August 2007. Retrieved 2008-12-01.
  17. ↑ Peterson, Ivars (November 20, 1999). "Quantum Games". Science News. Science Service. 156 (21): 334. doi:10.2307/4012018. Retrieved 2008-12-01.
  18. ↑ Franklin, Roger (November 17, 2002). "Two-digit theory gets two fingers". The Age. Melbourne. Retrieved 2008-12-01.
  19. ↑ Judge, Peter (November 9, 2007). "D-Wave's quantum computer ready for latest demo". ZDNet. CNET. Retrieved 2008-12-01.
  20. ↑ Dawson, Keith (November 29, 2008). "Improving Wikipedia Coverage of Computer Science". Slashdot. Retrieved 2008-12-01.
  21. ↑ Brooks, Michael (March 31, 2007). "Outside of time: The quantum gravity computer". New Scientist (2597).
  22. ↑ Pontin, Jason (April 8, 2007). "A Giant Leap Forward in Computing? Maybe Not". The New York Times. The New York Times Company. Retrieved 2008-12-01.
  23. ↑ Gomes, Lee (December 12, 2008). "Your World View Doesn't Compute". Forbes.
  24. ↑ "PHYS771 Lecture 9: Quantum". scottaaronson.com. Retrieved 2017-01-20.
  25. ↑ Tadros, Edmund (October 3, 2007). "Ad agency cribbed my lecture notes: professor". The Age. Melbourne. Retrieved 2008-12-01.
  26. ↑ Tadros, Edmund (December 20, 2007). "Ad company settles plagiarism complaint". The Age. Melbourne. Retrieved 2008-12-01.
  27. ↑ Tadros, Edmund (October 3, 2007). "Ad agency cribbed my lecture notes: professor". The Age. Retrieved January 1, 2016.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.