Algorithms for quantum computers
Abstract
Quantum computers can solve certain problems much faster than classical computers. In this talk, I will give a brief introduction to quantum computing. I will present some examples of quantum algorithms that dramatically outperform classical computation, including Shor's celebrated factoring algorithm. I will also briefly describe some recent work on algorithms for simulating quantum systems. No prior knowledge of quantum mechanics or quantum computation will be assumed.
This talk is organized by Jeff Foster