Slide 1Efficient Simulation of Quantum Mechanics Collapses the Polynomial Hierarchy Scott Aaronson Alex Arkhipov MIT (yes, really) Slide 2 In 1994, something big happened…

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 1Computational Complexity and Physics Scott Aaronson (MIT) New Insights Into Computational Intractability Oxford University, October 3, 2013 Slide 2 Title is too broad!…

Slide 1 Exploring the Limits of the Efficiently Computable Research Directions I Like In Complexity and Physics Scott Aaronson (MIT) Papers and slides at www.scottaaronson.com…

Verification of BosonSampling Devices Scott Aaronson (MIT) Talk at Simons Institute, February 28, 2014 Shor’s Theorem: QUANTUM SIMULATION has no efficient classical algorithm,…

BosonSampling Scott Aaronson (MIT) Talk at BBN, October 30, 2013 Shor’s Theorem: QUANTUM SIMULATION has no efficient classical algorithm, unless FACTORING does also The…

Exploring the Limits of the Efficiently Computable Research Directions in Computational Complexity and Physics That I Find Exciting Scott Aaronson (MIT) Papers & slides…