Resultado da Busca
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.
Scott Aaronson is a professor of computer science at UT Austin and a researcher in quantum computing theory. His blog posts cover topics such as Jim Simons' legacy, Umesh Vazirani's birthday, and the story of BQP.
Scott Aaronson. 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. For the 2022-2023 and 2023-2024 academic years, I'm ...
Articles 1–20. David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin - Cited by 16,533 - Quantum computing - computational complexity.
Talks. Important Note: Use these slides at your own risk! They reflect what I thought at the time I gave the talks -- so sometimes what they say is outdated or inaccurate. When in doubt, refer to my papers or send me an email.
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.
26 de ago. de 2018 · Excellent Scott! Based on these lecture notes, I realized I was missing some important concepts in the field of computational complexity; I’m trying to learn and I’ve added them to my wiki-books. Just wanted to mention that I’ve had another surge of big ideas Scott! 😉
