Slide 1Has There Been Progress on the P vs. NP Question? Scott Aaronson Slide 2 P vs. NP: I Assume Youve Heard of It Class of decision problems solvable in polynomial time…

Slide 1Scott Aaronson BQP und 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 only…

Slide 1A MAX Feature Presentation P BQP PSPACE = Slide 2 Scott Aaronson (IAS) Scotts Grab Bag o Cheap Yuks Slide 3 Scott Aaronson (IAS) Dr. Scotts Grab Bag o Cheap Yuks Slide…

Slide 1BQP PSPACE NP P PostBQP Computational Intractability As A Law of Physics Scott Aaronson University of Waterloo Slide 2 Things we never see… Warp drive Perpetuum…

Slide 1The Limits of Quantum Computers (or: What We Cant Do With Computers We Dont Have) Scott Aaronson University of Waterloo BQP NP- complete SZK Slide 2 So then why cant…

Slide 1Quantum Information and the Brain Scott Aaronson (MIT) NIPS 2012, Lake Tahoe | ? Slide 2 My challenge: To speak, for 45 minutes, about an intersection of two fields…

Slide 1The Limits of Quantum Computers (or: What We Cant Do With Computers We Dont Have) Scott Aaronson (MIT) BQP NP- complete SZK Slide 2 So then why cant we just ignore…

Slide 1Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT Slide 2 Things we never see… Warp drive Perpetuum mobile GOLDBACH CONJECTURE: TRUE…

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