Quantum Computing: Whats It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10, 2002 aaronson.
The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.
New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov.
Stinespring’s theorem for maps on hilbert c star modules
New Computational Insights from Quantum Optics
Superpolynomial speedups from the quantum Fourier transform on the symmetric group
Quantum Data Hiding Challenges and Opportunities
