Quantum Physics

    

Geometric Analysis of Grover's Search Algorithm in the Presence of Perturbation

Authors: Wenliang Jin

For an initial uniform superposition over all possible computational basis states, we explore the performance of Grover's search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard transformation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover's search algorithm can work well with an appropriately chosen perturbation. Thereby we corroborate Grover's conclusion that if such perturbation is small, then this will not create much of an impact on the implementation of this algorithm. We also prove that Grover's path cannot achieve a geodesic in the presence of a perturbation of the Fubini-Study metric.

Comments: 13 Pages.

Download: PDF

Submission history

[v1] 2013-07-26 10:00:45

Unique-IP document downloads: 930 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus