Skip to main content
SpringerLink
Log in

Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

In the original Grover algorithm, an exact or almost exact search such that the success probability is unity or infinitesimally close to unity is possible only for certain values of the fraction λ =  M/N where M is the number of marked items that are stored in an unsorted database of N items. There are various modified algorithms with an adjustable phase or phases such that an exact search can be done for any value of λ by means of a finite number of Grover-type operations. Among them, the algorithm proposed by Long is the simplest in the sense that it has only one adjustable phase and that the phase can be obtained in a closed form. We show that other more general algorithms with additional phases are not more efficient than Long’s version with a single phase.

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. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC ’96: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM, New York, NY, USA (1996)

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

    Article  ADS  Google Scholar 

  3. Grover L.K.: Quantum computers can search arbitrarily large databases by a single query. Phys. Rev. Lett. 79, 4709 (1997)

    Article  ADS  Google Scholar 

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

    Article  ADS  Google Scholar 

  5. Grover L.K.: From Schrödinger’s equation to the quantum search algorithm. Am. J. Phys. 69, 769 (2001)

    Article  ADS  Google Scholar 

  6. Diao Z.: Exactness of the original Grover search algorithm. Phys. Rev. A 82, 044301 (2010)

    Article  ADS  Google Scholar 

  7. Chi, D.P., Kim, J.: Quantum database searching by a single query. arXiv:quantum-ph/9708005v1 (1997)

  8. Chi D.P., Kim J.: Quantum database search with certainty by a single query. Chaos Solitons Fractals 10, 1689 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Long G.L., Li Y.S., Zhang W.L., Niu L.: Phase matching in quantum searching. Phys. Lett. A 262, 27 (1999)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  10. Høyer P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62, 052304 (2000)

    Article  ADS  Google Scholar 

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

    Article  ADS  Google Scholar 

  12. Long G.L., Yan H., Li Y.S., Tu C.C., Tao J.X., Chen H.M., Liu M.L., Zhang X., Luo J., Xiao L., Zeng X.Z.: Experimental NMR realization of a generalized quantum search algorithm. Phys. Lett. A 286, 121 (2001)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  13. Long G.L., Tu C.C., Li Y.S., Zhang W.L., Yan H.Y.: An SO(3) picture for quantum searching. J. Phys. A Math. Gen. 34, 861 (2001)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  14. Hsieh J.Y., Li C.M.: General SU(2) formulation for quantum searching with certainty. Phys. Rev. A 65, 052322 (2002)

    Article  ADS  Google Scholar 

  15. Hsieh J.Y., Li C.M., Chuu D.S.: An improved phase error tolerance in a quantum search algorithm. Chin. J. Phys. 42, 585 (2004)

    Google Scholar 

  16. Braunstein S.I., Choi B.S., Ghosh S., Maitra S.: Exact quantum algorithm to distinguish Boolen functions of different weights. J. Phys. A Math. Gen. 40, 8441 (2007)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  17. Li P., Li S.: Phase matching in Grover’s algorithm. Phys. Lett. A 366, 42 (2007)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  18. Toyama F.M., van Dijk W., Nogami Y., Tabuchi M., Kimura Y.: Multiphase matching in the Grover algorithm. Phys. Rev. A 77, 042324 (2008)

    Article  ADS  Google Scholar 

  19. Toyama F.M., Kasai S., van Dijk W., Nogami Y.: Matched-multiphase Grover algorithm for a small number of marked states. Phys. Rev. A 79, 014301 (2009)

    Article  ADS  Google Scholar 

  20. Hu C.R.: A family of sure-success quantum algorithms for solving a generalized Grover search problem. Phys. Rev. A 66, 042301 (2002)

    Article  ADS  Google Scholar 

  21. Imre S., Balázs F.: Quantum Computing and Communications: An Engineering Approach. Wiley , Chichester (2005)

    Google Scholar 

  22. Biham E., Biham O., Biron D., Grassi M., Lidar D.A.: Grover’s quantum search algorithm for an arbitrary initial amplitude distribution. Phys. Rev. A 60, 2742 (1999)

    Article  ADS  Google Scholar 

  23. Biham O., Nielsen M.A., Osborne T.J.: Entanglement monotone derived from Grover’s algorithm. Phys. Rev. A 65, 062312 (2002)

    Article  ADS  Google Scholar 

  24. Long G.L., Li X., Sun Y.: Phase matching condition for quantum search with a generalized initial state. Phys. Lett. A 294, 143 (2002)

    Article  ADS  MATH  MathSciNet  Google Scholar 

  25. Biham E., Kenigsberg D.: Grover’s quantum search algorithm for an arbitrary initial mixed state. Phys. Rev. A 66, 062301 (2002)

    Article  ADS  Google Scholar 

  26. Li P., Song K.: Adaptive phase matching in Grovers algorithm. J. Quantum Inf. Sci. 1, 3 (2011)

    Google Scholar 

  27. Zhao L.J., Li Y.S., Hao L., Zhou T., Long G.L.: Geometric pictures for quantum search algorithms. Quantum Inf. Process. 11, 325 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kyoto Sangyo University, Kyoto, 603-8055, Japan

    F. M. Toyama

  2. Department of Physics, Redeemer University College, Ancaster, ON, L9K 1J4, Canada

    W. van Dijk

  3. Department of Physics and Astronomy, McMaster University, Hamilton, ON, L8S 4M1, Canada

    W. van Dijk & Y. Nogami

Authors
  1. F. M. Toyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. van Dijk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y. Nogami
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to W. van Dijk.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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). https://doi.org/10.1007/s11128-012-0498-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-012-0498-0

Keywords

Search

Navigation