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

Journal of Computational and Theoretical Nanoscience

Dynamics and Properties of Fixed Point for Quantum Search Algorithm Based on Phase Shift

Abdalla J. Asad, A Youssef, S. Abdel‐Khalek

Published Nov 1, 2015• 0 citations
Publisher
DOI
10.1166/jctn.2015.4415

Related papers

Quantum fixed-point search algorithm with general phase shifts

Dafa Li

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

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

An N/4 fixed-point duality quantum search algorithm

Liang Hao, Dan Liu, GuiLu Long

Science China Physics Mechanics and Astronomy•Jul 26, 2010•23 citations

Fixed-point quantum continuous search algorithm with optimal query complexity

Shan Jin, Yuhan Huang, Shaojun Wu +4 more

arXiv:2502.15556•Science China Physics Mechanics and Astronomy•Apr 22, 2025•4 citations

Convergence properties of fixed-point search with general but equal phase shifts for any iterations

Dan Li, X. Li, Hai Huang +1 more

Grover presented the fixed-point search by replacing the selective inversions by selective phase shifts of $π/3$. In this paper, we investigate the convergence behavior of the fixed-point search algorithm with general but equal phase shifts for any iterations.

arXiv:0803.2566•Mar 18, 2008•0 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
Grover presented the fixed-point search by replacing the selective inversions by selective phase shifts of π/3π/3π/3. In this paper, we investigate the convergence behavior of the fixed-point search algorithm with general but equal phase shifts for any iterations.
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.