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: Yes, it is. My contention in this lecture is the...
- Time Travel
Scott: Yeah, but let's assume we're talking about an...
- Who Can Name The Bigger Number
by Scott Aaronson [Author's blog] [This essay in Spanish]...
- Talks
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 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.
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.
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
Feb 12, 2024 · The Problem of Human Specialness in the Age of AI. Update (Feb. 29): A YouTube video of this talk is now available, plus a comment section filled (as usual) with complaints about everything from my speech and mannerisms to my failure to address the commenter’s pet topic.
In his fascinating and entertaining talk, Scott Aaronson elucidates the potential and the limits of quantum computing. In a sober fashion, he gives an overview of the state of research, telling us not only what we could expect from quantum computers in the future, but also what we probably shouldn't.
