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

Computer Engineering and Applications Journal

Calculating Optimal Searching Times of Grover Algorithm

Atr Key

Published Jan 1, 2004• 0 citations
OpenAlex

Abstract

To obtain the target with the probability of more than0.5,Grover quantum search algorithm need access the unsorted database o(N√)times,and this search algorithm tells people nothing about the optimal searching times.To solve these two problems ,this paper presents an algorithm calculating the optimal searching times.With this searching times Grover Algorithm will obtain the target with almost full probability.Simulation result shows that this calculating method is effective.

Related papers

An Improved Quantum Grover Algorithm

Baoyu Zheng

The algorithm proposed by Grover solves the unsorted database search problem with computation complexity of O(2~(1/2)n/m),where the size of database is N=2n and there is m target solutions.However,the successful probability of searching decreases rapidly,when the target solutions m is greater than N/4,And the algorithm is disabled when m is equal to N/2.This paper presents an improved Grover's algorithm,which can find the object with the successful probability at least 98.01% with one step when m is greater than N/4.

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2011•0 citations

Grover quantum searching algorithm based on weighted targets

Panchi Li, Shiyong Li

The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.

Journal of Systems Engineering and Electronics•Apr 1, 2008•11 citations

Progress of Grover Quantum Search Algorithm

Linlin Luan, Zhijie Wang, Sanming Liu

Grover quantum search algorithm access the unsorted database O(N) times, however, the probability of acquiring solutions usually falls with the increase of the number of solutions, the reason of which is analyzed. To improve the performance of converging and optimizing for the intelligent optimization, some quantum evolutionary algorithms are proposed by domestic and foreign scholars. In this paper, a lot of improved Grover quantum search algorithms are introduced in detail.

Energy Procedia•Jan 1, 2012•11 citations

An Improved Quantum Search Algorithm

Amrita Mitra

If we have to search an unsorted database or solve an unstructured search problem, we can use a quantum search algorithm [1]. As of now, a quantum search algorithm like Grover’s algorithm [2] takes Ω( N ) time, where N is the size of the search space. This paper proposes an improved quantum search algorithm that yields the correct result in constant time with a high probability.

Journal of Quantum Information Science•Jan 1, 2025•0 citations

An Improved Grover Quantum Searching Algorithm

Lenan Wu

Grover quantum search algorithm access the unsorted database O (N~(1/2)) times,however,the probability of acquiring so- lutions usually falls with the increase of the number of solutions,the reason of which is analyzed and an improved algorithm based on en- larging searching space is proposed with a new parameter i to make the algorithm controllable in order to trade off between success proba- bility and iterative steps.Simulated experiments of the reciprocal problem showcase that this proposed algorithm can find solutions with higher probability than traditional Grover algorithm at the condition of equivalent iterative steps,and the success probability can even be increased if the iterative steps is unlimited.Thus,it can conclude that our proposed algorithm is more efficient and effective.The validity of the improved algorithm is manifested by experiment.

Signal Processing•Jan 1, 2009•2 citations

Quantum Search Algorithm

The quantum search algorithm was discovered by L. K. Grover in 1997, and is called Grover’s algorithm after his name. Let us consider how to find elements marked by a certain symbol out of a database consisting of N elements (say, multi-million elements). This problem is similar to how to find the name of the person from a telephone book knowing only his/her telephone number. This search takes by far more time than finding the phone number from the name of the person. The difference comes from the structure of the telephone book. In the telephone book, the names are arranged in the alphabetical order and constitute the structured database, while phone numbers do not form any structure in the telephone book. In classical computers, when we search one target element from the database with N elements, we need N/ 2 trials on average. Grover showed using the quantum search algorithm that N trials will be enough on average to find the target element from the database with N elements. Shor’s quantum computation algorithm was an epoch-making algorithm which made possible to solve the factorization problem in polynomial time, while the classical computers need exponentially increasing time to solve it. In comparison, Grover’s algorithm makes the data search possible by O ( N ) computation time, while it takes O ( N ) computation time by the classical computers. Concerning the reduction of computing time, Grover’s algorithm may look less powerful than Shor’s algorithm. However, it has good potentiality of application in the wide area such as NP-complete problems and structured databases.

WORLD SCIENTIFIC eBooks•Sep 24, 2020•0 citations
To obtain the target with the probability of more than0.5,Grover quantum search algorithm need access the unsorted database o(N√)times,and this search algorithm tells people nothing about the optimal searching times.To solve these two problems ,this paper presents an algorithm calculating the optimal searching times.With this searching times Grover Algorithm will obtain the target with almost full probability.Simulation result shows that this calculating method is effective.
The algorithm proposed by Grover solves the unsorted database search problem with computation complexity of O(2~(1/2)n/m),where the size of database is N=2n and there is m target solutions.However,the successful probability of searching decreases rapidly,when the target solutions m is greater than N/4,And the algorithm is disabled when m is equal to N/2.This paper presents an improved Grover's algorithm,which can find the object with the successful probability at least 98.01% with one step when m is greater than N/4.
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.
Grover quantum search algorithm access the unsorted database O (N~(1/2)) times,however,the probability of acquiring so- lutions usually falls with the increase of the number of solutions,the reason of which is analyzed and an improved algorithm based on en- larging searching space is proposed with a new parameter i to make the algorithm controllable in order to trade off between success proba- bility and iterative steps.Simulated experiments of the reciprocal problem showcase that this proposed algorithm can find solutions with higher probability than traditional Grover algorithm at the condition of equivalent iterative steps,and the success probability can even be increased if the iterative steps is unlimited.Thus,it can conclude that our proposed algorithm is more efficient and effective.The validity of the improved algorithm is manifested by experiment.
The quantum search algorithm was discovered by L. K. Grover in 1997, and is called Grover’s algorithm after his name. Let us consider how to find elements marked by a certain symbol out of a database consisting of N elements (say, multi-million elements). This problem is similar to how to find the name of the person from a telephone book knowing only his/her telephone number. This search takes by far more time than finding the phone number from the name of the person. The difference comes from the structure of the telephone book. In the telephone book, the names are arranged in the alphabetical order and constitute the structured database, while phone numbers do not form any structure in the telephone book. In classical computers, when we search one target element from the database with N elements, we need N/ 2 trials on average. Grover showed using the quantum search algorithm that N trials will be enough on average to find the target element from the database with N elements. Shor’s quantum computation algorithm was an epoch-making algorithm which made possible to solve the factorization problem in polynomial time, while the classical computers need exponentially increasing time to solve it. In comparison, Grover’s algorithm makes the data search possible by O ( N ) computation time, while it takes O ( N ) computation time by the classical computers. Concerning the reduction of computing time, Grover’s algorithm may look less powerful than Shor’s algorithm. However, it has good potentiality of application in the wide area such as NP-complete problems and structured databases.