Lectures on Fast Quantum Algorithms

December 7-10 2009,
De Brún Centre for Computational Algebra, Galway

Gábor Ivanyos



We provide an overview of the most important computational problems in which quantum computers appear to have exponential advantage over classical randomized algorithms. These include the most striking results in the field such as factoring integers, calculating discrete logarithms (Shor's polynomial time methods), computing unit groups and class groups of number fields (Hallgren and independently Schmidt and Vollmer). We will also discuss some of the most significant open problems in this area, especially the noncommutative case of the Hidden Subgroup Problem (as a possible approach to the Graph Isomorphism problem). We shall also outline the basic tools used in the existing fast quantum algorithms as well as some promising results including the sources of motivation for the computational algebra problems discussed in the conference talk given by the lecturer (see slides).



Further reading:

Page created by Gábor Ivanyos.