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

$\pi/3$ Phase-Shift Quantum Searching

Lov K. Grover

Published Mar 16, 2006• 0 citations
OpenAlex

Related papers

Fixed-point quantum search for different phase shifts

Dafa Li, Xiangrong Li, Hongtao Huang +1 more

arXiv:quant-ph/0604062•Physics Letters A•Oct 19, 2006•16 citations

Quantum fixed-point search algorithm with general phase shifts

Dafa Li

Frontiers of Computer Science in China•Jun 1, 2008•1 citation

Research on Quantum Searching Algorithms Based on Phase Shifts

Zhong Pu-Cha, Wan‐Su Bao

One iterative in Grover's original quantum search algorithm consists of two Hadamard–Walsh transformations, a selective amplitude inversion and a diffusion amplitude inversion. We concentrate on the relation among the probability of success of the algorithm, the phase shifts, the number of target items and the number of iterations via replacing the two amplitude inversions by phase shifts of an arbitrary ϕ = ϕ(0 ⩽ ϕ, ϕ ⩽ 2π). Then, according to the relation we find out the optimal phase shifts when the number of iterations is given. We present a new quantum search algorithm based on the optimal phase shifts of 1.018 after 0.5π/ iterations. The new algorithm can obtain either a single target item or multiple target items in the search space with the probability of success at least 93.43%.

Chinese Physics Letters•Jul 29, 2008•7 citations

A Fixed-Phase Quantum Search Algorithm with More Flexible Behavior

Xin Li, Panchi Li

When the Grover’s algorithm is applied to search an unordered database, the probability of success usually decreases with the increase of marked items. To address this phenomenon, a fixed-phase quantum search algorithm with more flexible behavior is proposed. In proposed algorithm, the phase shifts can be fixed at the different values to meet the needs of different practical problems. If research requires a relatively rapid speed, the value of the phase shifts should be appropriately increased, if search requires a higher success probability, the value of the phase shifts should be appropriately decreased. When the phase shifts are fixed at , the success probability of at least 99.38% can be obtained in iterations.

Journal of Quantum Information Science•Jan 1, 2012•9 citations

Phase matching in quantum searching

Gui Lu Long, Yan Song Li, Wei Lin Zhang +1 more

arXiv:quant-ph/9906020•Physics Letters A•Oct 1, 1999•162 citations

Different Fixed-Phases for Quantum Search Operators

Sahar Q. Saleh, Ahmed Younes

Amplitude amplification techniques are the basic building blocks in many quantum algorithms. Amplifying the probability of success to the highest possible probability to find solutions in the search space is an essential aim. To simplify the construction of the hardware, the search operators with fixed phases must be used to handle the whole search space. This paper presents more reliable fixed-phase quantum search algorithm, where the phase shifts that used in the oracle and the diffusion operator are not matched, in contrary to the wide belief in literature that the matching condition between the phase shifts is the best choice. This paper shows that there are many phase shifts which can be used for the search operators to give better results when the number of solutions is known in advance. The minimum probability of success of the proposed algorithm is 99.61% in quadratic speed-up which is better than any other known fixed operator quantum search algorithms.

Journal of the Physical Society of Japan•Nov 12, 2019•2 citations
π/3\pi/3π/3 Phase-Shift Quantum Searching
One iterative in Grover's original quantum search algorithm consists of two Hadamard–Walsh transformations, a selective amplitude inversion and a diffusion amplitude inversion. We concentrate on the relation among the probability of success of the algorithm, the phase shifts, the number of target items and the number of iterations via replacing the two amplitude inversions by phase shifts of an arbitrary ϕ = ϕ(0 ⩽ ϕ, ϕ ⩽ 2π). Then, according to the relation we find out the optimal phase shifts when the number of iterations is given. We present a new quantum search algorithm based on the optimal phase shifts of 1.018 after 0.5π/ iterations. The new algorithm can obtain either a single target item or multiple target items in the search space with the probability of success at least 93.43%.
When the Grover’s algorithm is applied to search an unordered database, the probability of success usually decreases with the increase of marked items. To address this phenomenon, a fixed-phase quantum search algorithm with more flexible behavior is proposed. In proposed algorithm, the phase shifts can be fixed at the different values to meet the needs of different practical problems. If research requires a relatively rapid speed, the value of the phase shifts should be appropriately increased, if search requires a higher success probability, the value of the phase shifts should be appropriately decreased. When the phase shifts are fixed at , the success probability of at least 99.38% can be obtained in iterations.
Amplitude amplification techniques are the basic building blocks in many quantum algorithms. Amplifying the probability of success to the highest possible probability to find solutions in the search space is an essential aim. To simplify the construction of the hardware, the search operators with fixed phases must be used to handle the whole search space. This paper presents more reliable fixed-phase quantum search algorithm, where the phase shifts that used in the oracle and the diffusion operator are not matched, in contrary to the wide belief in literature that the matching condition between the phase shifts is the best choice. This paper shows that there are many phase shifts which can be used for the search operators to give better results when the number of solutions is known in advance. The minimum probability of success of the proposed algorithm is 99.61% in quadratic speed-up which is better than any other known fixed operator quantum search algorithms.