How fast can a quantum computer search?

Details How fast can a quantum computer search? How fast can a quantum computer search?

1998-09-10

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

Physics

Quantum Physics

Postscript, 7 pages. This proof tries to give a simple argument why the search algorithm is optimal (This paper was originally

Scientific paper

This paper gives a simple proof of why a quantum computer, despite being in
all possible states simultaneously, needs at least 0.707 sqrt(N) queries to
retrieve a desired item from an unsorted list of items. The proof is refined to
show that a quantum computer would need at least 0.785 sqrt(N) queries. The
quantum search algorithm needs precisely this many queries.

Affiliated with

Also associated with

No associations

Rating

How fast can a quantum computer 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 How fast can a quantum computer search?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How fast can a quantum computer search? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-230497