Abstract
This article introduces an enhancement to the Grover search algorithm to speed up computing the probability of finding good states. It suggests incorporating a rotation phase angle determined mathematically from the derivative of the model during the initial iteration. At each iteration, a new phase angle is computed and used in a rotation gate around \(y+z\) axis in the diffusion operator. The computed phase angles are optimized through an adaptive adjustment based on the estimated increasing ratio of the consecutive amplitudes. The findings indicate an average decrease of 28% in the required number of iterations resulting in a faster overall process and fewer number of quantum gates. For large search space, this improvement rises to 29.58%. Given the computational capabilities of the computer utilized for the simulation, the approach is applied to instances with up to 12 qubits or 4096 possible combination of search entries.
Similar content being viewed by others
Data availability
The author would like to share the MATLAB program developed exclusively for this paper with the readers for public access. No specific data is used for this research. https://www.mathworks.com/matlabcentral/fileexchange/158896-grover-search-algorithm-standard-and-enhanced-versions
References
Nielsen, Michael A., and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2010.
Sutor, Robert S. Dancing with Qubits. Packt Publishing, 2019.
Thomas G. Wong. "Introduction to Classical Quantum Computing." Rooted Grove, 2022.
Park, Gilchan, et al. "Quantum Multi-Programming for Grover’s Search." Computational Science Initiative, Brookhaven National Laboratory, Upton, New York, 11973, USA, 2022.
Scott Aaronson. "Introduction to Quantum Information Science." Lecture Notes, 2018.
Los Alamos National Laboratory. "Quantum Algorithm Implementations for Beginners," 2022.
Microsoft Azure Quantum. "Grover's Algorithm - Concepts." [Online]. Available: https://learn.microsoft.com/en-us/azure/quantum/concepts-grovers
Qiskit Textbook GitHub. "Grover's Algorithm - Notebooks." [Online]. Available: https://github.com/Qiskit/textbook/blob/main/notebooks/ch-algorithms/grover.ipynb
Quantum Untangled on Medium. "Grover's Algorithm: Mathematics, Circuits, and Code." [Online]. Available: https://medium.com/quantum-untangled/grovers-algorithm-mathematics-circuits-and-code-quantum-algorithms-untangled-c4aa47d506e5
Szabłowski PJ (2021) Understanding mathematics of Grover’s algorithm. Quantum Inf Process 20(4):191. https://doi.org/10.1007/s11128-021-03125-w
Ulyanov, Sergey, et al. "Modeling of Grover’s Quantum Search Algorithms: Implementations of Simple Quantum Simulators on Classical Computers." 2020.
Gilliam, Austin, et al. "Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm." ArXiv, abs/2005.06468, 2020.
Gilliam, Austin, et al. "Optimizing Quantum Search with a Binomial Version of Grover's Algorithm." ArXiv, abs/2007.10894, 2020.
Chappell, James M., et al. "An Improved Formalism for the Grover Search Algorithm." CoRR, abs/1201.1707, 2012.
Çelik, Necati, and Özkan Bingöl. "Analysis of Grover’s Quantum Search Algorithm on a Classical Computer." Sigma Journal of Engineering and Natural Sciences, vol. 42, no. 6, 2024.
Ashraf I, Mahmood T, Lakshminarayanan V (2012) A modification of Grover’s quantum search algorithm. Photon Optoelectron 1(1):20–24
Liu, J. "An Optimum Algorithm for Quantum Search." ArXiv, abs/2010.03949, 2020.
Kumar T, Kumar D, Singh G (2023) Novel optimization of quantum search algorithm to minimize complexity. Chin J Phys 83:277–286. https://doi.org/10.1016/j.cjph.2023.03.008
Morales, M. E., Tlyachev, T., & Biamonte, J. "Variationally Learning Grover's Quantum Search Algorithm." ArXiv. https://doi.org/10.1103/PhysRevA.98.062333, 2018.
Grover LK (1997) Quantum Mechanics helps in searching for a needle in a haystack. Bell Labs, New Jersey
Funding
No financial support is provided for this work.
Author information
Authors and Affiliations
Contributions
I, Ismael Abdulrahman, am the sole author of this manuscript and have undertaken all aspects of the research study, from conceptualization, writing, figure preparation, and programming in MATLAB, to finalization, review, and revision.
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interest associated with this work.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Abdulrahman, I. Enhancing Grover’s search algorithm: a modified approach to increase the probability of good states. J Supercomput (2024). https://doi.org/10.1007/s11227-024-06142-5
Accepted:
Published:
DOI: https://doi.org/10.1007/s11227-024-06142-5