Quantum complexity of graph and algebraic problems
Sebastian Dörn · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · 2007
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.