Quantum Search Algorithm CAN be Improved

Quantum search is a quantum mechanical technique for searching N possibilities in only ãN steps. This has been proved to be the best possible algorithm for the exhaustive search problem in the sense the number of queries it requires cannot be reduced. However, as this paper shows, the number of non-query operations, and thus the total number of operations, can be reduced. The number of non-query unitary operations can be reduced by a factor of log N / ƒ¿ log (log N) while increasing the number of queries by a factor of only (1 + (log N)-ƒ¿). Various choices of a ƒ¿ yield different variants of the algorithm. For example, by choosing ƒ¿ to be O(log N / log(log N)), the number of non- query unitary operations can be reduced by a third without a single increase in the number of queries.