Documents BosonSampling Scott Aaronson (MIT) Talk at BBN, October 30, 2013.

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…

Documents The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.

Slide 1The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs Slide 2 Shors Theorem: Q UANTUM S IMULATION has no efficient classical algorithm,…

Documents Scott Aaronson (MIT) BQP and PH A tale of two strong-willed complexity classes… A 16-year-old...

Slide 1Scott Aaronson (MIT) BQP and PH A tale of two strong-willed complexity classes… A 16-year-old quest to find an oracle that separates them… A solution at lastbut…