More than a century after the development of quantum mechanics we have reached an exciting time where non-trivial devices that make use of quantum effects can be built: quantum random number generators to produce true random numbers, optical lattice emulators to mimic models of condensed matter physics and quantum annealers to solve classical optimization problems. As the roadmap to building universal quantum computers becomes more concrete an important emerging question is the identification of important real-world applications of quantum computers. In order for a quantum computer to be competitive, it needs to not only be asymptotically superior but be able to solve problems within a limited time that no classical supercomputer can solve. I will review how substantial algorithmic improvements of quantum algorithms have brought problem in quantum chemistry from the realm of science fiction to being realistic applications. Similar algorithmic improvements will be needed in other areas in order to identify more "killer apps" for quantum computing.
Montag, 15. Dezember 2014, 17:30 Uhr
(ab 17:00 Uhr Kaffee)
Technische Universität Wien
Freihaus
1040 Wien, Wiedner Hauptstr. 8-10
Hörsaal 5
Turm A (grüner Bereich), 2. Stock