Part of the Graduate Texts in Physics book series (GTP)
- 2.7k Downloads
In this chapter we shall look at a number of quantum algorithms. We are going to compare their performance, in terms of number of steps, to classical algorithms that accomplish the same task.
KeywordsQuantum Walk Quantum Fourier Transform Bernstein-Vazirani Algorithm Hadamard Gate Extra Edges
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 4.D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani, Quantum walks on graphs. In Proceedings of the 33rd Symposium on the Theory of Computing (STOC01) (ACM Press, New York, 2001), pp. 50–59 and quant-ph/0012090Google Scholar
© Springer Science+Business Media New York 2013