Mtech Syllabus
Hawking Quantum Wares at the Classical Complexity Bazaar Scott Aaronson (MIT)
The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.
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) Joint work with Alex Arkhipov.
Solving Hard Problems With Light Scott Aaronson (Assoc. Prof., EECS) Joint work with Alex Arkhipov vs.
The Computational Complexity of Linear Optics Scott Aaronson (MIT) Joint work with Alex Arkhipov vs.
New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov.
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.
Eric Allender Rutgers University 27 and Still Counting: Iterated Product, Inductive Counting, and the Structure of P ImmermanFest, Vienna, July 13, 2014.
Phase Transitions of PP-Complete Satisfiability Problems D. Bailey, V. Dalmau, Ph.G. Kolaitis Computer Science Department UC Santa Cruz.
BPP Contained in PH By Michael Sipser; Clemens Lautemann Clemens Lautemann Presenter: Jie Meng.
