Effects of Noisy Oracle on Search Algorithm Complexity

Details Effects of Noisy Oracle on Search Algorithm Complexity Effects of Noisy Oracle on Search Algorithm Complexity

2003-04-21

arxiv.org/abs/quant-ph/0304138v2

Physics

Quantum Physics

16 pages, 4 figures, submitted to Phys. Rev. A

Scientific paper

10.1103/PhysRevA.68.052313

Grover's algorithm provides a quadratic speed-up over classical algorithms for unstructured database or library searches. This paper examines the robustness of Grover's search algorithm to a random phase error in the oracle and analyzes the complexity of the search process as a function of the scaling of the oracle error with database or library size. Both the discrete- and continuous-time implementations of the search algorithm are investigated. It is shown that unless the oracle phase error scales as O(N^(-1/4)), neither the discrete- nor the continuous-time implementation of Grover's algorithm is scalably robust to this error in the absence of error correction.

Affiliated with

Also associated with

No associations

Rating

Effects of Noisy Oracle on Search Algorithm Complexity 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 Effects of Noisy Oracle on Search Algorithm Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effects of Noisy Oracle on Search Algorithm Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551243