Advertisement

An Introduction to Quantum Search Algorithm and Its Implementation

  • Jose P. Dumas
  • Kapil Soni
  • Akhtar Rasool
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 808)

Abstract

Quantum computing is new era of computing, used in modern world to solve complex problems which can be solved using a supercomputer and those problems can be solved in an efficient manner using quantum computer. Quantum computing uses properties of superposition and entanglement to solve complex problems like NP Hard, and by using them the quantum computer may find the solutions in faster manner compared to classical computers. Grover’s search is introduced for searching in an unstructured database that is used to locate a particular item in the database. It provide a speedup of \(\sqrt N\) over classical. This article describes Grover’s search with an example, applications and limitations. Also explores the functionality of quantum circuit, oracle circuit that is particular to Grover’s. This article concludes with the Grover’s search advantage over classical search.

Keywords

Diffusion operator Oracle Quantum grover’s search Qubits 

References

  1. 1.
    Zalka, C. (1999). Grovers quantum searching algorithm is optimal. Physical Review A, 60, 2746–2751.CrossRefGoogle Scholar
  2. 2.
    Nielsen, M. A., & Chuang, I. L. (2011). Quantum computation and quantum information. Cambridge: Cambridge University Press.Google Scholar
  3. 3.
    Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 78, 325–328.CrossRefGoogle Scholar
  4. 4.
    Farhi, E., & Gutmann, S. (1998). Analog analogue of a digital quantum computation. Physical Review A, 57, 2403–2405.CrossRefGoogle Scholar
  5. 5.
    Lloyd, S. (2000). Quantum search without entanglement. Physical Review A, 61, 010301(R).MathSciNetCrossRefGoogle Scholar
  6. 6.
    Glassner, A. (2001). Quantum computing. IEEE Computing Graphics Applications, 21(5), 86–95.CrossRefGoogle Scholar
  7. 7.
    Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484.MathSciNetCrossRefGoogle Scholar
  8. 8.
    Viamontes, G. F., Markov, I. L., & Hayes, J. P. (2003). Gate-level simulation of quantum circuits. In IEEE Asia South Pacific Design Automation Conference.Google Scholar
  9. 9.
    Saha, A., Chongder, A., Mandal, S.B., & Chakrabarti, A. (2015). Synthesis of vertex coloring problem using grover’s algorithm. In IEEE International Symposium on Nanoelectronic and Information Systems.Google Scholar
  10. 10.
    Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. In Proceedings, 28th Annual ACM Symposium on the Theory of Computing (STOC), pp. 212–219.Google Scholar
  11. 11.
    Kai, K. (2015). Two improvements in Grover’s algorithm. In IEEE Control and Decision Conference (CCDC).Google Scholar
  12. 12.
    ElGamal, T. (1985). A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4), 469–472.MathSciNetCrossRefGoogle Scholar
  13. 13.
    Karafyllidis, G. (2005). Quantum computer simulator based on the circuit model of quantum computation. IEEE Transactions on Circuits and Systems I, 52, 1590–1596.MathSciNetCrossRefGoogle Scholar
  14. 14.
    Li, X., Song, K., Sun, N., & Zhao, C. (2013). Phase matching in grover’s algorithm. In IEEE Control Conference (CCC), 2013 32nd Chinese.Google Scholar
  15. 15.
    Tang, Y., & Shenghui, S. (2014). Application of grover’s quantum search algorithm to solve the transcendental logarithm problem. In IEEE International Conference on Computational Intelligence and Security.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Maulana Azad National Institute of TechnologyBhopalIndia

Personalised recommendations