AbstractsComputer Science
Quantum complexity of graph and algebraic problems
| Institution: | Universität Ulm |
|---|---|
| Department: | Ingenieurwissenschaften und Informatik |
| Degree: | PhD |
| Year: | 2008 |
| Record ID: | 1112251 |
| Full text PDF: | http://vts.uni-ulm.de/docs/2008/6303/vts_6303_8453.pdf |
Abstract
In this thesis we present new quantum algorithms for graph and algebra problems. Our quantum algorithms for these problems use a combination of Grover search, amplitude amplification and quantum walk search. The quantum algorithms are faster than the best known classical algorithms for the corresponding problems.
