Improved 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.
Computational Complexity and Physics Scott Aaronson (MIT) New Insights Into Computational Intractability Oxford University, October 3, 2013.
The Computational Complexity of Linear Optics Scott Aaronson and Alex Arkhipov MIT vs.
From EPR to BQP Quantum Computing as 21 st -Century Bell Inequality Violation Scott Aaronson (MIT)
ADVERTISEMENT For those who enjoyed the Memory session on Monday Multiplying 10-Digit Numbers Using Flickr: The Power of Recognition Memory by Andrew Drucker.
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.
1 Scaling to the End of Silicon: Performance Projections and Promising Paths Frontiers of Extreme Computing October 24, 2005 Doug Burger The University.
Introduction to Quantum Computers Goren Gordon The Gordon Residence July 2006.
Quantum computing … Applications in informatics and physics P. Shor, 1994: factorization of large numbers is polynomial on a quantum computer, exponential.
Michael A. Nielsen University of Queensland Quantum Computation Goals: 1.To explain the quantum circuit model of computation. 2.To explain Deutschs algorithm.
Do we need a logic of quantum computation?