Quantum Database Search can do without Sorting

Details Quantum Database Search can do without Sorting Quantum Database Search can do without Sorting

2000-12-29

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

Phys. Rev. A64 (2001) 034303

Physics

Quantum Physics

4 pages, revtex. The analysis presented here led to quant-ph/0002037. (v2) Substantially expanded to clarify various statement

Scientific paper

10.1103/PhysRevA.64.034303

Sorting is a fundamental computational process, which facilitates subsequent searching of a database. It can be thought of as factorisation of the search process. The location of a desired item in a sorted database can be found by classical queries that inspect one letter of the label at a time. For an unsorted database, no such classical quick search algorithm is available. If the database permits quantum queries, however, then mere digitisation is sufficient for efficient search. Sorting becomes redundant with the quantum superposition of states. A quantum algorithm is written down which locates the desired item in an unsorted database a factor of two faster than the best classical algorithm can in a sorted database. This algorithm has close resemblance to the assembly process in DNA replication.

Affiliated with

Also associated with

No associations

Rating

Quantum Database Search can do without Sorting 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 Quantum Database Search can do without Sorting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Database Search can do without Sorting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233707