Generalized grover search algorithm for arbitrary initial amplitude distribution

41Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Grover’s algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N − r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O(√N/r) is derived which is shown to depend only on the initial average amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial amplitude distributions of the marked or unmarked states.

Cite

CITATION STYLE

APA

Biron, D., Biham, O., Biham, E., Grassl, M., & Lidar, D. A. (1999). Generalized grover search algorithm for arbitrary initial amplitude distribution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1509, pp. 140–147). Springer Verlag. https://doi.org/10.1007/3-540-49208-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free