Quantum Computing and the Limits of the Efficiently Computable
Free
Conference given by Scott Aaronson, University of Texas, invited by the FRAMA
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".<br>
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.<br>
<div class="encadre">
<h2>Useful links</h2><br>
<a href="http://frama.universite-lyon.fr/welcome-to-the-research-federation-andr…;
<a href="http://www.utexas.edu/">University of Texas</a><br>
<a href="http://www.scottaaronson.com/blog/?p=2620">Scott Aaronson's blog</a><br>
<br>
</div>