Slide 1Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002 Slide 2 Talk Outline 1.Sermon 2.Quantum Computing Overview 3.Collision…
Slide 1The Collision Lower Bound After 12 Years Scott Aaronson (MIT) Lower bound for a collision problem Slide 2 January 2002: As a grad student, I visit Israel for the first…
Slide 1From EPR to BQP Quantum Computing as 21 st -Century Bell Inequality Violation Scott Aaronson (MIT) Slide 2 Why Quantum Computing Is Like Bell Inequality Violation…
Slide 1Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) http://www.cs.berkeley.edu/~aaronson August 14, 2003 Slide 2 Quantum Background Needed…
Quantum Computing and Dynamical Quantum Models (quant-ph/0205059) Scott Aaronson, UC Berkeley QC Seminar May 14, 2002 Talk Outline Why you should worry about quantum mechanics…
Quantum Complexity and Fundamental Physics Scott Aaronson MIT RESOLVED: That the results of quantum complexity research can deepen our understanding of physics. That this…