Robert R. Tucci
Published 2010-01-28, updated 2010-09-12Version 2
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.
Comments: 20 pages (17 files: 1 .tex, 1.sty, 11 .eps, 3 .m, 1 .xxx);V2-minor corrections
A Classical $π$ Machine and Grover's Algorithm
Quantum teleportation and Grover's algorithm without the wavefunction
Experimental requirements for Grover's algorithm in optical quantum computation
![QR code for arXiv:1001.5200 [quant-ph]](http://oss.arxitics.com/images/favicon.svg)