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 The Computational Complexity of Linear Optics

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

Documents The Computational Complexity of Linear Optics

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…

Documents The Computational Complexity of Linear Optics

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…