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
Surveys and Book Reviews. (Mostly-)Quantum Papers. S....
- 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
CS378/M375T/PHY341 Introduction to Quantum Information...
- Phys771 Lecture 9
A Less Than 0% Chance. Alright, so what would it mean to...
- 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
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.
Surveys and Book Reviews. (Mostly-)Quantum Papers. S. Aaronson and Y. Zhang. On Verifiable Quantum Advantage with Peaked Circuit Sampling, arXiv:2404.14493, 2024. Over a decade after its proposal, the idea of using quantum computers to sample hard distributions has remained a key path to demonstrating quantum advantage.
Nov 29, 2022 · My AI Safety Lecture for UT Effective Altruism. Two weeks ago, I gave a lecture setting out my current thoughts on AI safety, halfway through my year at OpenAI. I was asked to speak by UT Austin’s Effective Altruist club. You can watch the lecture on YouTube here (I recommend 2x speed).
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).
Dec 11, 2018 · His primary area of research is theoretical computer science, and his research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.
