Speeding up the Grover algorithm using auxiliary solutions
arXiv:0906.4804
Abstract
It may be possible to extend the Grover search algorithm by taking a divide and conquer approach using auxiliary solutions to achieve an exponential speed-up.
6 pages, one figure; added comments on error correction and optimality proof