Query complexity for searching multiple marked states from an unsorted database

Details Query complexity for searching multiple marked states from an unsorted database Query complexity for searching multiple marked states from an unsorted database

2006-04-10

arxiv.org/abs/quant-ph/0604059v1

Physics

Quantum Physics

4 pages,4 figures,twocolumn

Scientific paper

An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.

Affiliated with

Also associated with

No associations

Rating

Query complexity for searching multiple marked states from an unsorted database 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 Query complexity for searching multiple marked states from an unsorted database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query complexity for searching multiple marked states from an unsorted database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702019