Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Trimming Grover's Quantum Search Algorithm

Grant Eberle, Gonzalo E. Ordonez

Published Mar 2, 2020• 0 citations
OpenAlex

Related papers

Grover's Algorithm and Quantum Search

Kolla Bhanu Prakash

Wiley eBooks•Aug 17, 2026•0 citations

Quantum Approximate String Matching for Large Alphabets

Jeffrey A. Aborot

In this article we present a quantum algorithm for finding approximate copies of a pattern within a much longer text. The algorithm is based mainly on amplitude amplification technique used in Grover’s quantum search algorithm and is more suited for instances in which the size of the alphabet is at least twice as the number of distinct symbols of the pattern. The algorithm is composed of a filtering phase for trimming the search space and a verification phase for determining solution indices in the text. We present details of each subroutine used in the algorithm. The algorithm returns all solution indices within the text with number of iterations proportional to the ratio of the size of the text and the number of distinct symbols in the pattern with high probability. Overall, the time complexity of the algorithm is mainly influenced by the size of the text.

WORLD SCIENTIFIC eBooks•Feb 28, 2017•9 citations

Grover’s quantum search algorithm

Samuel J. Lomonaco

Proceedings of symposia in applied mathematics•Jan 1, 2002•6 citations

Family of Grover’s quantum-searching algorithms

Alberto Galindo, Miguel Angel Martin-Delgado

We introduce the concepts of Grover operators and Grover kernels to systematically analyze Grover's searching algorithms. Then we investigate a one-parameter family of quantum searching algorithms of Grover type and we show that the standard Grover algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficiency of order $O(\sqrt{N}),$ with a coefficient which is class-dependent. The analysis of this dependence is a test of the stability and robustness of the algorithms. We show the stability of this constructions under perturbations of the initial conditions and extend them to a very general class of Grover operators.

arXiv:quant-ph/0009086•Physical Review A•Nov 8, 2000•51 citations

Deterministic application of Grover's quantum search algorithm

治 渡辺, OSAMU WATANABE

•Jan 1, 2000•0 citations

The Proof of Quantum Search Algorithm Optimization and the Simulation of the Algorithm Implementation

Hongtao Zhang, Yong-Tao Dai, Ling-Ying Tu +3 more

This paper illustrated the optimality of Grover quantum search algorithm, and simulated the number of iterations and the specific implementation steps of quantum search algorithm with QCL in Linux operating systems, then validated the time complexity of Grover's quantum searching algorithm is O(√(N)) while the algorithm's time complexity on classical computers is O(N). The Grover quantum search algorithm were shown to improve the performance significantly in the random database search problem. This conclusion was drawn from the simulation in the Linux operating systems adopted to quantum computation language. The present study highlighted the importance of high efficiency of the Grover quantum search algorithm to achieve the best possible performance in such cases. The existence of such efficiency is an outstanding advantage of quantum search algorithm over the conventional approach.

Communications•Jul 28, 2015•3 citations
In this article we present a quantum algorithm for finding approximate copies of a pattern within a much longer text. The algorithm is based mainly on amplitude amplification technique used in Grover’s quantum search algorithm and is more suited for instances in which the size of the alphabet is at least twice as the number of distinct symbols of the pattern. The algorithm is composed of a filtering phase for trimming the search space and a verification phase for determining solution indices in the text. We present details of each subroutine used in the algorithm. The algorithm returns all solution indices within the text with number of iterations proportional to the ratio of the size of the text and the number of distinct symbols in the pattern with high probability. Overall, the time complexity of the algorithm is mainly influenced by the size of the text.
We introduce the concepts of Grover operators and Grover kernels to systematically analyze Grover's searching algorithms. Then we investigate a one-parameter family of quantum searching algorithms of Grover type and we show that the standard Grover algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficiency of order O(N),O(\sqrt{N}),O(N​), with a coefficient which is class-dependent. The analysis of this dependence is a test of the stability and robustness of the algorithms. We show the stability of this constructions under perturbations of the initial conditions and extend them to a very general class of Grover operators.
This paper illustrated the optimality of Grover quantum search algorithm, and simulated the number of iterations and the specific implementation steps of quantum search algorithm with QCL in Linux operating systems, then validated the time complexity of Grover's quantum searching algorithm is O(√(N)) while the algorithm's time complexity on classical computers is O(N). The Grover quantum search algorithm were shown to improve the performance significantly in the random database search problem. This conclusion was drawn from the simulation in the Linux operating systems adopted to quantum computation language. The present study highlighted the importance of high efficiency of the Grover quantum search algorithm to achieve the best possible performance in such cases. The existence of such efficiency is an outstanding advantage of quantum search algorithm over the conventional approach.