Strength and Weakness in Grover's Quantum Search Algorithm

Details Strength and Weakness in Grover's Quantum Search Algorithm Strength and Weakness in Grover's Quantum Search Algorithm

2008-11-27

arxiv.org/abs/0811.4481v1

Physics

Quantum Physics

Review paper, 15 pages

Scientific paper

Grover's quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with $N$ records in $O(\sqrt{N})$ assuming that the item must exist in the database with quadratic speedup over the best known classical algorithm. This review paper discusses the performance of Grover's algorithm in case of multiple matches where the problem is expected to be easier. Unfortunately, we will find that the algorithm will fail for $M>3N/4$, where $M$ is the number of matches in the list.

Affiliated with

Also associated with

No associations

Rating

Strength and Weakness in Grover's Quantum Search Algorithm 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 Strength and Weakness in Grover's Quantum Search Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strength and Weakness in Grover's Quantum Search Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232425