Slide 1Quantum Computing: Whats It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10, 2002 www.cs.berkeley.edu/~aaronson Slide 2 Slide 3 Overview…

Slide 1The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs Slide 2 Shors Theorem: Q UANTUM S IMULATION has no efficient classical algorithm,…

Slide 1New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov Slide 2 The Extended Church- Turing Thesis (ECT) Everything feasibly…

C∗-algebras Hilbert C∗-modules References STINESPRING’S THEOREM FOR MAPS ON HILBERT C∗- MODULES G. Ramesh ISI Bangalore ICM Satellite Conference on Quantum Probablity…

New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov The Extended Church-Turing Thesis (ECT) Everything feasibly computable…

Superpolynomial speedups from the quantum Fourier transform on the symmetric group Sean Hallgren, NEC Aram Harrow, Bristol QIP 2007 (b): almost any quantum circuit Guiding…

PowerPoint Presentation Quantum Data Hiding Challenges and Opportunities Fernando G.S.L. Brandão Universidade Federal de Minas Gerais, Brazil Based on joint work with M.…