Slide 1How Much Information Is In A Quantum State? Scott Aaronson Andrew Drucker Slide 2 Computer Scientist / Physicist Nonaggression Pact You tolerate these complexity classes:…

Slide 11 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 23 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Lower Bounds for Local Search by Quantum Arguments Scott Aaronson UC Berkeley…

Slide 1How Much Information Is In A Quantum State? Scott Aaronson MIT | Slide 2 The Problem In quantum mechanics, a state of n entangled particles requires at least 2 n complex…

Slide 1An Invitation to Quantum Complexity Theory The Study of What We Cant Do With Computers We Dont Have Scott Aaronson (MIT) QIP08, New Delhi BQP NP- complete SZK Slide…

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 1BQP PSPACE NP P PostBQP Limits on Efficient Computation in the Physical World Scott Aaronson MIT Slide 2 Things we never see… Warp drive Perpetuum mobile GOLDBACH…

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 Equivalence of Sampling and Searching Scott Aaronson MIT Slide 2 In complexity theory, we love at least four types of problems Languages / Decision Problems. Decide…

Slide 1Quantum Computing and Hollywood San Jose State University April 15, 2004 Scott Aaronson UC Berkeley www.cs.berkeley.edu/~aaronson Slide 2 Computers are useless. They…