A SURVEY OF GROVER’S ALGORITHM AND ITS MODIFICATIONS FOR EFFICIENT UNSTRUCTURED SEARCH

Iram Fatima; Syed Khaldoon Khurshid; Fareed Ud Din Mehmood Jafri; Sanam Shoukat; Haroon Bashir

Authors

Iram Fatima
Syed Khaldoon Khurshid
Fareed Ud Din Mehmood Jafri
Sanam Shoukat
Haroon Bashir

Keywords:

Quantum Computing, Grover’s Algorithm, Quantum Search Algorithm, Unstructured Search, Adaptive Quantum Algorithms, Quantum Optimization, Artificial Intelligence, Quantum Algorithm Variants, Quantum Search Efficiency

Abstract

One of the fundamental algorithms of quantum computing is known as Grover’s quantum search algorithm, which gives a quadratic speedup over classical search methods in unstructured databases. The authors present a survey of the research on Grover algorithm since 2003 and describe some important modifications and improvement over the years. Adaptive variants, hardware-specific implementations and usage in optimization, artificial intelligence etc. are discussed. In this paper, we review the different variants of Grover’s algorithm, discuss their working principles and implementation strategies. These are compared so as to discover possible modifications that increase the efficiency and performance of unstructured search. Also, current issues such as error mitigation in quantum devices and adaptation of algorithms to variable database size are discussed. This survey will be a useful overview of the state of the art in quantum search algorithms, and suggest lines for future research. The development of Grover’s algorithm is an important step in the field of quantum computing, and as research in the field continues to progress, the algorithm will be further refined and improved to enable more practical applications in the future.