Search results
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 ...
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.
ACM Prize in Computing, 2020. ACM STOC Test of Time Award for \The Computational Complexity of Linear Optics" (with Alex Arkhipov), 2021. Best Paper Award of Computational Complexity Conference (CCC) for \The Acrobatics of BQP" (with DeVon Ingram and William Kretschmer), 2022.
PDF-1.5 %ÐÔÅØ 1 0 obj /S /GoTo /D (chapter.1) >> endobj 4 0 obj (Course Introduction and The Extended Church-Turing Thesis) endobj 5 0 obj /S /GoTo /D (chapter.2) >> endobj 8 0 obj (Probability Theory and Quantum Mechanics) endobj 9 0 obj /S /GoTo /D (section.2.1) >> endobj 12 0 obj (Linear Algebra Approach to Probability Theory) endobj 13 0 ...
We'll start out with various scientific, mathematical, or philosophical problems that predate quantum computing: for example, the measurement problem, P versus NP, the existence of secure cryptography, the Humean problem of induction, or the possibility of closed timelike curves.
What I'd Like Government Officials to Know About Near-Term Applications of Quantum Computing, Bureau of Intelligence and Research, US State Department (online), September 7, 2023. Neurocryptography, Invited Plenary Talk at Crypto'2023, UCSB, Santa Barbara, CA, August 23, 2023.
Scott Aaronson Quantum Computing Alright, so now we've got this beautiful theory of quantum mechanics, and the possibly-even-more-beautiful theory of computational complexity.
Scott Aaronson∗ Abstract In 1955, John Nash sent a remarkable letter to the National Security Agency, in which— seeking to build theoretical foundations for cryptography—he all but formulated what today we call the P =? NP problem, considered one of the great open problems of science. Here I
Lecture 18: Free Will. Scribe: Chris Granade. So today we're going to ask---and hopefully answer---this question of whether there's free will or not. If you want to know where I stand, I'll tell you: I believe in free will.
PhD thesis of Scott Aaronson Filed in Fall 2004. 258 pages, single spaced. [PS] (2.5MB), [PDF] (1.7MB). quant-ph/0412143. More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave.
