A fast quantum mechanical algorithm for database search

Details A fast quantum mechanical algorithm for database search A fast quantum mechanical algorithm for database search

1996-05-29

arxiv.org/abs/quant-ph/9605043v3

Physics

Quantum Physics

8 pages, single postscript file. This is an updated version of a paper that was originally presented at STOC 1996. The algorit

Scientific paper

Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a 50% probability, any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of N/2 names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) steps. The algorithm is within a small constant factor of the fastest possible quantum mechanical algorithm.

Affiliated with

Also associated with

No associations

Rating

A fast quantum mechanical algorithm for database search 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 A fast quantum mechanical algorithm for database search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast quantum mechanical algorithm for database search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602734