1. Extrobritannia 2009 feedback survey Interim results (as of 17 Dec 2009) 2. Stated purpose of survey • The goal of this survey is to obtain feedback about how to evolve…
Slide 1Scott Aaronson MIT BQP PSPACE Closed Timelike Curves Make Quantum and Classical Computing Equivalent John Watrous U. Waterloo Slide 2 Uh-oh … here goes Scott with…
Slide 1BosonSampling Scott Aaronson (MIT) Talk at BBN, October 30, 2013 Slide 2 Shors Theorem: Q UANTUM S IMULATION has no efficient classical algorithm, unless F ACTORING…
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 1How Much Information Is In Entangled Quantum States? Scott Aaronson MIT | Slide 2 The Problem In quantum mechanics, a state of n entangled particles requires at least…
Slide 1How Much Information Is In A Quantum State? Scott Aaronson MIT Slide 2 Computer Scientist / Physicist Nonaggression Pact You accept that, for this talk: Polynomial…
Slide 1SPEED LIMIT n Quantum Lower Bounds Scott Aaronson (UC Berkeley) August 29, 2002 Slide 2 Andris Ambainis I Cant Believe Its Not Andris TM Slide 3 Many of the deepest…
Slide 1NP-complete Problems and Physical Reality Scott Aaronson Institute for Advanced Study Slide 2 What could we do if we could solve NP-complete problems? Proof of Riemann…