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/9906020 · Physics Letters A

Phase matching in quantum searching

Gui Lu Long, Yan Song Li, Wei Lin Zhang, Li Niu

Published Oct 1, 1999• 154 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(99)00631-3

Related papers

Phase matching condition for quantum search with a generalized initial state

Gui‐Lu Long, Xiao Li, Yang Sun

Physics Letters A•Feb 1, 2002•78 citations

Optimal number of queries for phase-matching quantum search

Raj Alexandru Guţoiu, Andrei Tănăsescu, Pantelimon George Popescu

Quantum Information Processing•Nov 19, 2025•0 citations

Research on Quantum Searching Algorithms Based on Phase Shifts

钟普查, 鲍皖苏

Chinese Physics Letters•Jan 1, 2008•0 citations

General phase-matching condition for a quantum searching algorithm

Che‐Ming Li, Chi-Chuan Hwang, Jin-Yuan Hsieh +1 more

A general consideration of the phase rotations in a quantum searching algorithm is undertaken in this work. As four phase rotations on the initial state, the marked state, and the states orthogonal to them are taken into account, we deduce a phase-matching condition for a successful search. The optimal options for these phases are then obtained.

arXiv:quant-ph/0108086•Physical Review A•Feb 20, 2002•14 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

Quantum search with resonances

A. Romanelli, A. Auyuanet, R. Donangelo

arXiv:quant-ph/0502161•Physica A Statistical Mechanics and its Applications•Jul 28, 2005•8 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.