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/0108086 · Physical Review A

General phase-matching condition for a quantum searching algorithm

Che‐Ming Li, Chi-Chuan Hwang, Jin-Yuan Hsieh, Kuo-Shong Wang

Published Feb 20, 2002• 16 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.65.034305

Related papers

Phase matching in quantum searching

Gui‐Lu Long, Yan Li, Wei Lin Zhang +2 more

Each iteration in Grover’s original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θ and the inversion for the prepared state |γ 〉 is replaced by rotation through φ, we found that these phase rotations must satisfy a matching condition θ = φ. Approximate formula for the amplitude of the marked state after an arbitrary number of iterations are also derived. When phase matching is obtained, we found that the generalized quantum search is still a rotation in 2-dimensional space, but with a small angle β ′ ≈ (2sin θ 2)β, where θ is the angle of phase rotation of the marked state and 2β is the angle of U(2) rotation when the phase rotations are the inversions in the original version. We give also a simple explanation of the phase matching requirement.

•Jan 1, 1999•113 citations

General SU(2) formulation for quantum searching with certainty

Jin-Yuan Hsieh, Che‐Ming Li

A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To search a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching condition relating the phase rotations in the algorithm, (2) a concise formula for evaluating the required number of iterations for the search, and (3) the final state after the search, with a complex phase in its amplitude. Moreover, the optimal choices and modifications of the phase angles in the Grover kernel are also studied.

arXiv:quant-ph/0112035•Physical Review A•May 7, 2002•18 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

Phase matching in quantum search algorithm

Saptarshi Roy Chowdhury, Sudarshan Baruah, Biswaranjan Dikshit

Abstract We systematically generalize the Grover algorithm in a density matrix formalism by exploiting the underlying two-dimensional subspace of the problem. Using this, we derive analytic expressions for the success probability after arbitrary iterations of the generalized Grover operator with two generic phase angles . We show for the phase matching condition with three iterations, success probability can be achieved only with knowledge about the lower bound , where λ is the ratio of marked to total number of states in the database. This result will improve the quantum search algorithm when applied to databases with unknown number of marked states in the specified regime of λ , at the cost of decreased efficiency in the smaller λ region.

Europhysics Letters (EPL)•Feb 8, 2023•2 citations

PHASE MATCHING IN FIXED-POINT QUANTUM SEARCH ALGORITHM

Hong‐Fu Wang, Shou Zhang, Yongfang Zhao

We investigate the phase matching problem in the fixed-point quantum search algorithm proposed by Grover [Phys. Rev. Lett.95 (2005) 150501]. We show that the optimal phase shift is π/3.61, which replaces the π/3 phase shift in fixed-point quantum search algorithm. The π/3.61-phase algorithm can be achieved in [Formula: see text] with the success probability of at least 94.11%, which offsets disadvantage that the success probability of getting correct results usually decreases with the increase of marked items when original Grover quantum search algorithm is applied to search an unordered database. In the meantime, this work also indicates that Grover quantum search algorithm is considerably robust to certain kinds of perturbations and is robust against modest noise in the initialization procedure.

International Journal of Quantum Information•Sep 1, 2009•2 citations

AnSO(3) picture for quantum searching

Gui Lu Long, Chang Cun Tu, Yan Li +2 more

An SO (3) picture of the generalized Grover quantum searching algorithm is constructed. In this picture, various aspects of quantum searching, the phase matching requirement in particular, are easily understood. It also offers a simple quantitative description of quantum searching. Exact formulae for the rotation angle and rotational axis are given. The probability of finding the marked state is just the projection of the state vector onto the z -axis in this picture. Applications of the picture to the standard Grover algorithm and to a generalized quantum search algorithm with arbitrary phase rotations are given.

Journal of Physics A Mathematical and General•Jan 18, 2001•20 citations
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.
Each iteration in Grover’s original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θ and the inversion for the prepared state |γ 〉 is replaced by rotation through φ, we found that these phase rotations must satisfy a matching condition θ = φ. Approximate formula for the amplitude of the marked state after an arbitrary number of iterations are also derived. When phase matching is obtained, we found that the generalized quantum search is still a rotation in 2-dimensional space, but with a small angle β ′ ≈ (2sin θ 2)β, where θ is the angle of phase rotation of the marked state and 2β is the angle of U(2) rotation when the phase rotations are the inversions in the original version. We give also a simple explanation of the phase matching requirement.
A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To search a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching condition relating the phase rotations in the algorithm, (2) a concise formula for evaluating the required number of iterations for the search, and (3) the final state after the search, with a complex phase in its amplitude. Moreover, the optimal choices and modifications of the phase angles in the Grover kernel are also studied.
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.
Abstract We systematically generalize the Grover algorithm in a density matrix formalism by exploiting the underlying two-dimensional subspace of the problem. Using this, we derive analytic expressions for the success probability after arbitrary iterations of the generalized Grover operator with two generic phase angles . We show for the phase matching condition with three iterations, success probability can be achieved only with knowledge about the lower bound , where λ is the ratio of marked to total number of states in the database. This result will improve the quantum search algorithm when applied to databases with unknown number of marked states in the specified regime of λ , at the cost of decreased efficiency in the smaller λ region.
We investigate the phase matching problem in the fixed-point quantum search algorithm proposed by Grover [Phys. Rev. Lett.95 (2005) 150501]. We show that the optimal phase shift is π/3.61, which replaces the π/3 phase shift in fixed-point quantum search algorithm. The π/3.61-phase algorithm can be achieved in [Formula: see text] with the success probability of at least 94.11%, which offsets disadvantage that the success probability of getting correct results usually decreases with the increase of marked items when original Grover quantum search algorithm is applied to search an unordered database. In the meantime, this work also indicates that Grover quantum search algorithm is considerably robust to certain kinds of perturbations and is robust against modest noise in the initialization procedure.
An SO (3) picture of the generalized Grover quantum searching algorithm is constructed. In this picture, various aspects of quantum searching, the phase matching requirement in particular, are easily understood. It also offers a simple quantitative description of quantum searching. Exact formulae for the rotation angle and rotational axis are given. The probability of finding the marked state is just the projection of the state vector onto the z -axis in this picture. Applications of the picture to the standard Grover algorithm and to a generalized quantum search algorithm with arbitrary phase rotations are given.