Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Cleve, A. Ekert, C. Macchiavello, M. Mosca, Quantum algorithms revisited. Proc. R. Soc. Lond. A 454, 339 (1998)
E. Bernstein, U. Vazirani, Quantum complexity theory. SIAM J. Comput. 26, 1411 (1997)
L.K. Grover, Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997)
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/0012090
E. Feldman, M. Hillery, H.-W. Lee, D. Reitzner, H. Zheng, V. Bužek, Finding structural anomalies in graphs by means of quantum walks. Phys. Rev. A 82, 040302R (2010)
A.M. Childs, W. van Dam, Quantum algorithms for algebraic problems. Rev. Mod. Phys. 82, 1 (2010)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bergou, J.A., Hillery, M. (2013). Quantum Algorithms. In: Introduction to the Theory of Quantum Information Processing. Graduate Texts in Physics. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7092-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7092-2_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7091-5
Online ISBN: 978-1-4614-7092-2
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)