L. K. Grover, “A Fast Quantum Mechanical Algorithm for Database Search,” Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, 22-24 May 1996, pp. 212-221.

has been cited by the following article:

• TITLE: A Fixed-Phase Quantum Search Algorithm with More Flexible Behavior

  AUTHORS: Xin Li, Panchi Li

  KEYWORDS: Quantum Computing; Quantum Searching; Grover Algorithm; Fixed Phase Shifting

  JOURNAL NAME: Journal of Quantum Information Science, Vol.2 No.2, June 22, 2012

  ABSTRACT: 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.