Skip to main content
SpringerLink
Log in

A review on quantum search algorithms

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch’s algorithm, Deutsch–Jozsa algorithm and its variation as Bernstein–Vazirani algorithm, Simon algorithm, Shor’s algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover’s quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  2. Korepin, V.E., Xu, Y.: Quantum search algorithms. Int. J. Mod. Phys. B 31, 5727–5758 (2009)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  3. Pathak, A.: Elements of Quantum Computation and Quantum Communication. CRC Press, Taylor and Francis Group, New York (2013)

    MATH  Google Scholar 

  4. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum Amplitude Amplification and Estimation. Quantum Comput. Quantum Inf. 305, 53–74 (2000)

    MathSciNet  MATH  Google Scholar 

  5. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov 20–22 (1994)

  6. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Stat. Comput. 26, 1484 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium Theory of Computing (STOC), vol. 212 (1996)

  8. Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997)

    Article  ADS  Google Scholar 

  9. Cleve, R., Ekert, A., Henderson, L., Macchiavello, C., Mosca, M.: On quantum algorithms. Complexity 4, 33 (1998)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  10. Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Frotsch. Phys. 46, 493 (1998)

  12. Zalka, C.: Grover’s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746 (1999)

    Article  ADS  Google Scholar 

  13. Grover, L.K., Radhakrishnan, J.: ACM Symposium on Parallel Algorithms and Architectures, vol. 186, Las Vegas, Nevada, USA (2005)

  14. Choi, B.S., Korepin, V.E.: Quantum partial search of a database with several target items. Quantum Inf. Process. 6, 37 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Korepin, V.E.: Optimization of partial search. J. Phys. A 38, L731 (2005)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  16. Korepin, V.E., Liao, J.: Quest for fast partial search algorithm. Quantum Inf. Process. 5, 1573 (2006)

    MathSciNet  MATH  Google Scholar 

  17. Korepin, V.E., Vallilo, B.C.: Group theoretical formulation of a quantum partial search algorithm. Prog. Theor. Phys. 116, 783 (2006)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  18. Korepin, V.E., Xu, Y.: Proceedings of the SPIE (Quantum Information and Computation V), vol. 6573, p. 65730C (2007)

  19. Korepin, V.E., Xu, Y.: Hierarchical quantum search. Int. J. Mod. Phys. B 21, 5187 (2007)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  20. Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80, 4329–4332 (1998)

  21. Farhi, E., Gutmann, S.: Quantum Mechanical Square Root Speedup in a Structured Search Problem. arXiv: quant-ph/9711035

  22. Grover, L.K.: Quantum search on structured problems. Chaos Solitons Fractals 10, 16951705 (1999)

    Article  MathSciNet  Google Scholar 

  23. Preskill, J.: Lecture Notes on Quantum Information and Computation. http://www.theory.caltech.edu/people/preskill/ph229/index.html

  24. Long, G.L.: Grover algorithm with zero theoretical failure rate. Phys. Rev. A 64, 022307 (2001)

    Article  ADS  Google Scholar 

  25. Toyama, F.M., van Dijk, W., Nogami, Y.: Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters. Quantum Inf. Process. 12, 1897–1914 (2013)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  26. Farhi, E., Gutmann, S.: arXiv: quant-ph/9612026

  27. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum Computation by Adiabatic Evolution. arXiv: quant-ph/0001106

  28. Roland, J., Cerf, N.J.: Quantum search by local adiabatic evolution. Phys. Rev. A 65, 042308 (2002)

    Article  ADS  Google Scholar 

  29. Choi, B.-S., Walker, T.A., Braunstein, S.L.: Sure success partial search. Quantum Inf. Process. 6, 1–8 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

P. R. Giri is supported by International Institute of Physics, UFRN, Natal, Brazil.

Author information

Authors and Affiliations

  1. International Institute of Physics, Federal University of Rio Grande do Norte, Campus Universitáriorio - Lagoa Nova, CP. 1613, Natal, Rio Grande do Norte, 59078 - 970, Brazil

    Pulak Ranjan Giri

  2. C. N. Yang Institute for Theoretical Physics, State University of New York at Stony Brook, Stony Brook, NY, 11794-3840, USA

    Vladimir E. Korepin

Authors
  1. Pulak Ranjan Giri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir E. Korepin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pulak Ranjan Giri.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Giri, P.R., Korepin, V.E. A review on quantum search algorithms. Quantum Inf Process 16, 315 (2017). https://doi.org/10.1007/s11128-017-1768-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-017-1768-7

Keywords

Search

Navigation