|
Friday, May 9, 2008 |
|
|
|
|
A survey of quantum computer algorithms |
|
|
In the past decade there has been a wide range of progress in quantum algorithms, such as algorithms for some generalizations of the hidden subgroup problem (which includes the factoring and discrete logarithm problems as special cases), the development and application of the quantum walk paradigm, and ``topological'' algorithms for approximating the Tutte polynomial. In this talk I will attempt to survey the state of the art in quantum algorithms. |