Abstract

A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation can be used to construct a (less efficient) quantum search algorithm is cleared. The rotation of the phase of the marked state is not only the choice for efficiency, but also vital in Grover's quantum search algorithm. The results also show that Grover's quantum search algorithm is robust.

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