Quantum Algorithms

  • János A. Bergou
  • Mark Hillery
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.


Quantum 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.


  1. 1.
    R. Cleve, A. Ekert, C. Macchiavello, M. Mosca, Quantum algorithms revisited. Proc. R. Soc. Lond. A 454, 339 (1998)MathSciNetADSzbMATHCrossRefGoogle Scholar
  2. 2.
    E. Bernstein, U. Vazirani, Quantum complexity theory. SIAM J. Comput. 26, 1411 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    L.K. Grover, Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997)ADSCrossRefGoogle Scholar
  4. 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
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    A.M. Childs, W. van Dam, Quantum algorithms for algebraic problems. Rev. Mod. Phys. 82, 1 (2010)ADSzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • János A. Bergou
    • 1
  • Mark Hillery
    • 1
  1. 1.Department of Physics and AstronomyHunter College City University of New YorkNew YorkUSA

Personalised recommendations