Hamid Mcheick

Computer Science Department

University of Quebec at Chicoutimi

Chicoutimi, Quebec

Canada

**Author(s):**
Sebastian Dorn

**Affiliation: **Institut fur Theoretische Informatik, Universituat Ulm, 89069 Ulm, Germany.

Quantum algorithms have the potential to demonstrate that for some problems quantum computation is more efficient than classical computation. A goal of quantum computing is to determine for which problems quantum computers are faster than classical computers. In our survey we present recent quantum algorithms for basic problems from graph and algebra theory. The quantum algorithms for these problems use a combination of Grovers search algorithms, quantum amplitude amplification and quantum random walks. These quantum algorithms are faster than the best known classical algorithms for the corresponding problems.

**Keywords: **Quantum computing, quantum algorithms, graph theory, algebra, quantum query complexity

Order Reprints Order Eprints Rights & PermissionsPrintExport

**Article Details**

VOLUME: 2

ISSUE: 2

Page: [124 - 130]

Pages: 7

DOI: 10.2174/2213275910902020124