An Adaptive, Fixed-Point Version of Grover's Algorithm

2010/01/28 by Robert R. Tucci, Tucci, Robert R. · 2 citations
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.1001.5200

20 pages (17 files: 1 .tex, 1.sty, 11 .eps, 3 .m, 1 .xxx);V2-minor corrections

openalex publication_date 2010/01/28 · arxiv created 2010/09/12 · arxiv updated 2010/09/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give an adaptive, fixed-point version of Grover's algorithm. By this we mean that our algorithm performs an infinite sequence of gradually diminishing steps (so we say it's adaptive) that drives the starting state to the target state with absolute certainty (so we say it's a fixed-point algorithm). Our algorithm is motivated by Bloch sphere geometry. We include with the ArXiv distribution of this paper some simple software (Octave/Matlab m-files) that implements, tests and illustrates some of the results of this paper.

Cited by

• Quibbs, a Code Generator for Quantum Gibbs Sampling
• Quantum Circuit for Calculating Mobius-like Transforms Via Grover-like Algorithm

Related

• Grover's Algorithm with Diffusion and Amplitude Steering
• Speeding up the Grover algorithm using auxiliary solutions
• Optimal phase change for a generalized Grover's algorithm
• Grover's algorithm is an approximation of imaginary-time evolution
• Research on phases of Grover-type algorithms