Abstract

In this paper, we give the geometric pictures for quantum search algorithms in decomposed form, namely in terms of a phase rotation of the marked state and a phase rotation about the average. We apply this formalism to various quantum search algorithms, and give explicit interpretations of the standard Grover algorithm, arbitrary phase rotations, phase matching and fixed-point search algorithm. The pictures straightforwardly show how state vectors evolve during the search process. These results are helpful in understanding how the quantum search algorithms work.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call