Quantum Computing and the Limits of the Efficiently Computable

Date and time: 
Thursday, November 17, 2016 - 18:15
115 Lawrence
Scott Aaronson
University of Texas at Austin
  • Computer and Information Science Department
  • Oregon Center for Optical Molecular & Quantum Science
  • Center for Applied Quantum Science

Note: This is a public talk open to the general audience. Refreshments will be served prior to the event starting at 17:45


I'll discuss how computational complexity — the study of what can and can't be feasibly computed — has been interacting with physics in interesting and unexpected ways. This will include a crash course about quantum mechanics and the capabilities and limits of quantum computers. I'll also touch on speculative models of computation that would go even beyond quantum computers.


Scott Aaronson is the David J. Bruton Centennial Professor of Computer Science at the University of Texas at Austin, having recently moved from MIT. He received his PhD from UC Berkeley, and did postdoctoral fellowships at the Institute for Advanced Study as well as the University of Waterloo. His first book, Quantum Computing Since Democritus, was published in 2013 by Cambridge University Press. He's received the National Science Foundation's Alan T. Waterman Award, the United States PECASE Award, the Vannevar Bush Fellowship, and MIT's Junior Bose Award for Excellence in Teaching.

For more details, please visit: https://ix.cs.uoregon.edu/~xiaodiwu/poster_aaronson.html