This chapter surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform-based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).
CITATION STYLE
Smith, J., & Mosca, M. (2012). Algorithms for quantum computers. In Handbook of Natural Computing (Vol. 3–4, pp. 1452–1492). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_43
Mendeley helps you to discover research relevant for your work.