Slide 1Has There Been Progress on the P vs. NP Question? Scott Aaronson (MIT) Slide 2 P vs. NP: I Assume Youve Heard of It Frank Wilczek (Physics Nobel 2004) was recently…

Slide 1BQP PSPACE NP P PostBQP Quantum Complexity and Fundamental Physics Scott Aaronson MIT Slide 2 RESOLVED: That the results of quantum computing research can deepen our…

Slide 1 BQP PSPACE NP P PostBQP Quantum Complexity and Fundamental Physics Scott Aaronson MIT Slide 2 RESOLVED: That the results of quantum complexity research over the last…

Slide 1BQP PSPACE NP P PostBQP Limits on Efficient Computation in the Physical World Scott Aaronson MIT Slide 2 Things we never see… Warp drive Perpetuum mobile GOLDBACH…

Scott Aaronson (MIT) The Limits of Computation: Quantum Computers and Beyond Things we never see… Warp drive Perpetuum mobile Übercomputer The (seeming) impossibility…

Scott Aaronson (MIT) Forrelation A problem admitting enormous quantum speedup, which I and others have studied under various names over the years, which is interesting complexity-theoretically…

Slide 1BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo Slide 2 Things we never see… Warp drive Perpetuum…

Slide 1AM With Multiple Merlins Scott Aaronson MIT Scott Aaronson (MIT) Dana Moshkovitz (MIT) Russell Impagliazzo (UCSD) Slide 2 Two-Prover Games (the first slide of, like,…

1. ADVERTISEMENT For those who enjoyed the “Memory” session on Monday Multiplying 10-Digit Numbers Using Flickr: The Power of Recognition Memory by Andrew Drucker (my…

Slide 1Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson, UC Berkeley http://www.cs.berkeley.edu/~aaronson Slide 2 Outline (1)Four objections to quantum…