Slide 1Improved Simulation of Stabilizer Circuits Scott Aaronson (UC Berkeley) Joint work with Daniel Gottesman (Perimeter) 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 1 +ZI +IX +XI…

Slide 1Computational Complexity and Physics Scott Aaronson (MIT) New Insights Into Computational Intractability Oxford University, October 3, 2013 Slide 2 Title is too broad!…

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 1From EPR to BQP Quantum Computing as 21 st -Century Bell Inequality Violation Scott Aaronson (MIT) Slide 2 Why Quantum Computing Is Like Bell Inequality Violation…

Slide 1ADVERTISEMENT For those who enjoyed the Memory session on Monday Multiplying 10-Digit Numbers Using Flickr: The Power of Recognition Memory by Andrew Drucker (my PhD…

Slide 1Solving Hard Problems With Light Scott Aaronson (Assoc. Prof., EECS) Joint work with Alex Arkhipov vs Slide 2 In 1994, something big happened in the foundations of…

Slide 1The Computational Complexity of Linear Optics Scott Aaronson (MIT) Joint work with Alex Arkhipov vs Slide 2 In 1994, something big happened in the foundations of computer…

Slide 11 Scaling to the End of Silicon: Performance Projections and Promising Paths Frontiers of Extreme Computing October 24, 2005 Doug Burger The University of Texas at…

Slide 1Michael A. Nielsen University of Queensland Quantum Computation Goals: 1.To explain the quantum circuit model of computation. 2.To explain Deutschs algorithm. 3.To…

Slide 1Introduction to Quantum Computers Goren Gordon The Gordon Residence July 2006 Slide 2 Outline Introduction to quantum physics –Superposition Software –Deutsch-Jozsa…