Grover Algorithm with zero theoretical failure rate

Details Grover Algorithm with zero theoretical failure rate Grover Algorithm with zero theoretical failure rate

2001-06-13

arxiv.org/abs/quant-ph/0106071v1

Phys. Rev. A64 (2001) 022307

Physics

Quantum Physics

5 pages. Accepted for publication in Physical Review A

Scientific paper

10.1103/PhysRevA.64.022307

In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate. The modification is done by replacing the phase inversion by two phase rotation through angle $\phi$. The rotation angle is given analytically to be $\phi=2 \arcsin(\sin{\pi\over (4J+6)}\over \sin\beta)$, where $\sin\beta={1\over \sqrt{N}}$, $N$ the number of items in the database, and $J$ an integer equal to or greater than the integer part of $({\pi\over 2}-\beta)/(2\beta)$. Upon measurement at $(J+1)$-th iteration, the marked state is obtained with certainty.

Affiliated with

Also associated with

No associations

Rating

Grover Algorithm with zero theoretical failure rate does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Grover Algorithm with zero theoretical failure rate, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grover Algorithm with zero theoretical failure rate will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507543