Part of the Graduate Texts in Physics book series (GTP)
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.
- 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