Incremental information extraction from Grover's algorithm

Authors:
Bryan C. Jacobs;Todd B. Pittman;James D. Franson
Affiliations:
Johns Hopkins University, Laurel, Maryland;Johns Hopkins University, Laurel, Maryland;Johns Hopkins University, Laurel, Maryland
Venue:
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Year:
2004

Citing 1
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.