Quantum Partial Search
A modification of Grover's algorithm called quantum partial search was described by Grover and Radhakrishnan in 2004. In partial search, one is not interested in finding the exact address of the target item, only the first few digits of the address. Equivalently, we can think of "chunking" the search space into blocks, and then asking "in which block is the target item?". In many applications, such a search yields enough information if the target address contains the information wanted. For instance, to use the example given by L.K. Grover, if one has a list of students organized by class rank, we may only be interested in whether a student is in the lower 25%, 25-50%, 50-70% or 75-100% percentile.
To describe partial search, we consider a database separated into blocks, each of size . Obviously, the partial search problem is easier. Consider the approach we would take classically - we pick one block at random, and then perform a normal search through the rest of the blocks (in set theory language, the compliment). If we don't find the target, then we know it's in the block we didn't search. The average number of iterations drops from to .
Grover's algorithm requires iterations. Partial search will be faster by a numerical factor which depends the number of blocks . Partial search uses global iterations and local iterations. The global Grover operator is designated and the local Grover operator is designated .
The global Grover operator acts acts on the blocks. Essentially, it is given as follows:
- Perform standard Grover iterations on the entire database.
- Perform local Grover iterations. A local Grover iteration is a direct sum of Grover iterations over each block.
- Perform one standard Grover iteration
The optimal values of and are discussed in the paper by Grover and Radhakrishnan. One might also wonder what happens if one applies successive partial searches at different levels of "resolution". This idea was studied in detail by Korepin and Xu, who called it binary quantum search. They proved that it is not in fact any faster than performing a single partial search.
Read more about this topic: Grover's Algorithm
Famous quotes containing the words quantum, partial and/or search:
“A personality is an indefinite quantum of traits which is subject to constant flux, change, and growth from the birth of the individual in the world to his death. A character, on the other hand, is a fixed and definite quantum of traits which, though it may be interpreted with slight differences from age to age and actor to actor, is nevertheless in its essentials forever fixed.”
—Hubert C. Heffner (19011985)
“There is no luck in literary reputation. They who make up the final verdict upon every book are not the partial and noisy readers of the hour when it appears; but a court as of angels, a public not to be bribed, not to be entreated, and not to be overawed, decides upon every mans title to fame. Only those books come down which deserve to last.”
—Ralph Waldo Emerson (18031882)
“The search for happiness is one of the chief sources of unhappiness.”
—Eric Hoffer (19021983)