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,…

Slide 1Scott Aaronson Associate Professor, EECS Quantum Computers and Beyond Slide 2 Moores Law Slide 3 Extrapolating: Robot uprising? Slide 4 But even a killer robot would…

Slide 1New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov Slide 2 The Extended Church- Turing Thesis (ECT) Everything feasibly…

Slide 1Scott Aaronson (MIT) The Limits of Computation: Quantum Computers and Beyond Slide 2 Things we never see… Warp drive Perpetuum mobile GOLDBACH CONJECTURE: TRUE NEXT…

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

New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov The Extended Church-Turing Thesis (ECT) Everything feasibly computable…

Barriers in Quantum Computing (And How to Smash Them Through Closer Interactions Between Classical and Quantum CS) Day Classical complexity theorists, remain in your seats.…

The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs Shor’s Theorem: QUANTUM SIMULATION has no efficient classical algorithm, unless FACTORING…

The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs Shor’s Theorem: QUANTUM SIMULATION has no efficient classical algorithm, unless FACTORING…