Incremental information extraction from Grover's algorithm
B. C. Jacobs, T. B. Pittman, J. D. Franson · 2004
The iterative nature of Grover's quantum search algorithm may limit the feasibility of its implementation on quantum computers having relatively short coherence times. It may be possible to make a parallel version of the algorithm by extracting partial information about the solution after a limited number of iterations. Here we investigate the use of positive operator value measurements to reduce the coherence time requirements of Grover's algorithm. The utilization of single qubit measurements on multiple copies of the output after a single iteration is analyzed.