629 research outputs found
Query complexity for searching multiple marked states from an unsorted database
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.Comment: 4 pages,4 figures,twocolum
- …