The Future (and Past) of Quantum Lower Bounds by Polynomials Scott Aaronson UC Berkeley.
SPEED LIMIT n Quantum Lower Bounds Scott Aaronson (UC Berkeley) August 29, 2002.
Scott 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.
)New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers( סקוט אהרונסון )Scott Aaronson( MIT עדויות חדשות שקשה לדמות את מכניקת
An 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.
Scott 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.
Limits on Efficient Computation in the Physical World Dissertation Talk Scott Aaronson.
Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) aaronson August 14, 2003.
On the randomized simplex algorithm in abstract cubes Jiři Matoušek Charles University Prague Tibor Szabó ETH Zürich.
Quantum Computing - Razborov
New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers