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

Quantum Information Processing

Geometric pictures for quantum search algorithms

Lian-Jie Zhao, Yansong Li, Liang Hao, Tao Zhou, Gui Lu Long

Published May 20, 2011• 5 citations
Publisher
DOI
10.1007/s11128-011-0249-7

Related papers

Geometrical Picture for Quantum Searching

Gui‐Lu Long

•Jan 1, 2001•0 citations

Implement quantum search and quantum counting algorithms by geometric quantum computation

Qinghua Zhang, Gui‐Lu Long, Zidan Wang

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Geometric Analysis of Grover's Search Algorithm in the Presence of Perturbation

Wenliang Jin

"For an initial uniform superposition over all pos- sible computational basis states, we explore the perfor- mance of Grover’s search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard trans- formation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover’s search algorithm can work well with an appropriately chosen per- turbation. Thereby we corroborate Grover’s conclusion that if the perturbation is small, then it will have little impact on the implementation of this algorithm. We also prove that Grover’s path cannot achieve a geodesic under a perturba- tion of the Fubini-Study metric."

•Jul 1, 2013•0 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•21 citations

Quantum Search Algorithms

Uwe Schöning, Randall J. Pruim

Springer eBooks•Jan 1, 1998•0 citations

Quantum search algorithms

Christoph Dürr, xb b b

•Jan 1, 2005•16 citations
"For an initial uniform superposition over all pos- sible computational basis states, we explore the perfor- mance of Grover’s search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard trans- formation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover’s search algorithm can work well with an appropriately chosen per- turbation. Thereby we corroborate Grover’s conclusion that if the perturbation is small, then it will have little impact on the implementation of this algorithm. We also prove that Grover’s path cannot achieve a geodesic under a perturba- tion of the Fubini-Study metric."
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.