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

arXiv:quant-ph/0107010 · Theoretical and Mathematical Physics

Phase Condition for the Grover Algorithm

D.-F. Li, Xiumei Li, Hongtao Huang

Published Sep 1, 2005• 9 citations
arXivHTMLPDF
DOI
10.1007/s11232-005-0159-x

Related papers

Phase matching in Grover's algorithm

Panchi Li, Shiyong Li

Physics Letters A•Feb 14, 2007•31 citations

Comparison of efficiency of Grover algorithm and AS algorithm when phase-error is cosidered

Hiroshi Nishikawa, Satoshi Iriyama, Masanori Ohya

IEICE Technical Report; IEICE Tech. Rep.•Jul 14, 2005•0 citations

Phase diagram for the Grover algorithm with static imperfections

A. A. Pomeransky, O. V. Zhirov, Dima L. Shepelyansky

arXiv:quant-ph/0403138•The European Physical Journal D•Aug 30, 2004•8 citations

Phase Matching in Quantum Searching and the Improved Grover Algorithm

Yang Sun

We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero-failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.

Yuanzihe wuli pinglun•Jan 1, 2004•7 citations

A Four-Phase Improvement of Grover’s Algorithm

Bo-wen Ma, Wan‐Su Bao, Tan Li +3 more

When applying Grover’s algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. A four-phase improvement of Grover’s algorithm is proposed to fix the deficiency, and the unitary and the phase-matching condition are also proposed. With this improved scheme, when the proportion of target is over 1/3, the probability of obtaining correct results is greater than 97.82% with only one iteration using two phases. When the computational complexity is , the algorithm can succeed with a probability no less than 99.63%.

Chinese Physics Letters•Jul 1, 2017•3 citations

Introduction to Grover Algorithm

茂 山下

•Jun 1, 2011•0 citations
We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero-failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.
When applying Grover’s algorithm to an unordered database, the probability of obtaining correct results usually decreases as the quantity of target increases. A four-phase improvement of Grover’s algorithm is proposed to fix the deficiency, and the unitary and the phase-matching condition are also proposed. With this improved scheme, when the proportion of target is over 1/3, the probability of obtaining correct results is greater than 97.82% with only one iteration using two phases. When the computational complexity is , the algorithm can succeed with a probability no less than 99.63%.