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 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…
Slide 1Quantum Computing with Noninteracting Bosons Scott Aaronson (MIT) Based on joint work with Alex Arkhipov www.scottaaronson.com/papers/optics.pdf Slide 2 This talk…
Slide 1New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers Scott Aaronson (MIT) Joint work with Alex Arkhipov Slide 2 Computer Scientist / Physicist…
Slide 1Solving Hard Problems With Light Scott Aaronson (Assoc. Prof., EECS) Joint work with Alex Arkhipov vs Slide 2 In 1994, something big happened in the foundations of…
Slide 1The Computational Complexity of Linear Optics Scott Aaronson (MIT) Joint work with Alex Arkhipov vs Slide 2 In 1994, something big happened in the foundations of computer…
Slide 1Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves Slide 2 Motivation Ordinary quantum…
Slide 1Scott Aaronson Associate Professor, EECS And Why Every Other Major Sucks By Comparison Slide 2 Stereotypes of CS Majors Slide 3 Moores Law Slide 4 So whats next? Slide…
Slide 1Copyright Gordon Bell & Jim Gray Computing Laws Beyond Moores Law The best way to predict the future is to invent it. --Alan Kay Gordon Bell Bay Area Research…