Scott Aaronson, University of Texas invité par la FRAMA
La Fédération de Physique André Marie Ampère de l’Université de Lyon et la Société Française de Physique invitent Scott Aaronson, University of Texas, Austin, USA.
Quantum Computing and the Limits of the Efficiently Computable.
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.
Blog de Scott Aaronson
En savoir plus
Amphithéâtre Jourdan (Bâtiment Braconnier) / Campus de la Doua - Villeurbanne