Quantum Computing and the Limits of the Efficiently Computable
© (c) ENS de Lyon
The André Marie Ampère Research Federation (FRAMA) invites Scott Aaronson, University of Texas (Austin, USA), for a conference on: "Quantum Computing and the Limits of the Efficiently Computable".
Conference given by Scott Aaronson, University of Texas, invited by the FRAMA
Computational complexity – the study of what can and can't be feasibly computed – has been interacting with physics in interesting and unexpected ways. This talk will include a crash course about quantum mechanics and the capabilities and limits of quantum computers. A touch on speculative models of computation that would go even beyond quantum computers will also be discussed.