Search results
I'm Schlumberger Centennial Chair of Computer Science at The University of Texas at Austin, and director of its Quantum Information Center. My research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.
- Talks
Talks - Scott Aaronson
- Papers
S. Aaronson and S. Hung. Certified Randomness from Quantum...
- FAQ
Q: Dr. Aaronson, while your writings are of some interest,...
- PhD Thesis
PhD thesis of Scott Aaronson Filed in Fall 2004. 258 pages,...
- Cs378 Introduction to Quantum Information Science
Scott Aaronson. TAs: Patrick Rall and Corey Ostrove UT...
- Phys771 Lecture 9
Scott Aaronson. There are two ways to teach quantum...
- Who Can Name The Bigger Number
by Scott Aaronson [Author's blog] [This essay in Spanish]...
- Cs395t Quantum and Classical Complexity Theory
Scott Aaronson UT Austin, Fall 2016 Mondays, 2-5PM, Gates...
- Talks
Scott Aaronson is a mathematician and blogger who writes about his research, opinions, and experiences. In this post, he rants about the London Science Museum, where he and his son faced rude staff, long lines, and boring exhibits.
Scott Joel Aaronson (born May 21, 1981) is an American theoretical computer scientist and Schlumberger Centennial Chair of Computer Science at the University of Texas at Austin. His primary areas of research are computational complexity theory and quantum computing.
6 days ago · The new bbchallenge achievement is to prove that all 5-state Turing machines that run for more steps than 47,176,870, actually run forever—or in other words, that 47,176,870 is the maximum finite number of steps for which any 5-state Turing machine can run. That’s what it means for BB (5) to equal 47,176,870.
Scott Aaronson. Schlumberger Chair of Computer Science Director, Quantum Information Center Department of Computer Science The University of Texas at Austin Austin, TX USA aaronson@utexas.edu www.scottaaronson.com. July 21, 2023. Education. Cornell University (Ithaca, NY), 1997-2000. B.Sc. in Computer Science with Honors (Minor in Mathematics).
- 56KB
- 9
S. Aaronson and S. Hung. Certified Randomness from Quantum Supremacy, in Proceedings of ACM STOC'2023, arXiv:2303.01625 . We propose an application for near-term quantum devices: namely, generating cryptographically certified random bits, to use (for example) in proof-of-stake cryptocurrencies.
Apr 7, 2014 · Scott Aaronson is an associate professor of electrical engineering and computer science at MIT, who studies the relationship between complexity and quantum physics. He is known for his work on quantum complexity theory, the P = NP problem, and the collision problem.
