Extension To Space With Multiple Targets
If, instead of 1 matching entry, there are k matching entries, the same algorithm works but the number of iterations must be π(N/k)1/2/4 instead of πN1/2/4. There are several ways to handle the case if k is unknown. For example, one could run Grover's algorithm several times, with
iterations. For any k, one of iterations will find a matching entry with a sufficiently high probability. The total number of iterations is at most
which is still O(N1/2). It can be shown that this could be improved. If the number of marked items is k, where k is unknown, there is an algorithm that finds the solution in queries. This fact is used in order to solve the collision problem.
Read more about this topic: Grover's Algorithm
Famous quotes containing the words extension, space and/or multiple:
“Slavery is founded on the selfishness of man’s nature—opposition to it on his love of justice. These principles are in eternal antagonism; and when brought into collision so fiercely as slavery extension brings them, shocks and throes and convulsions must ceaselessly follow.”
—Abraham Lincoln (1809–1865)
“The within, all that inner space one never sees, the brain and the heart and other caverns where thought and feeling dance their sabbath.”
—Samuel Beckett (1906–1989)
“Creativity seems to emerge from multiple experiences, coupled with a well-supported development of personal resources, including a sense of freedom to venture beyond the known.”
—Loris Malaguzzi (20th century)