Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution.pdfVIP

Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution David Biron,1 Ofer Biham,1 Eli Biham,2 Markus Grassl,3 Daniel A. Lidar4 1Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel 8 2Computer Science Department, Technion, Haifa 32000, Israel 9 3Institut f¨ur Algorithmen und Kognitive Systeme, Universit¨at Karlsruhe, 9 Am Fasanengarten 5, D–76128 Karlsruhe, Germany 1 4Department of Chemistry, University of California, Berkeley, CA 94720, USA y a M Abstract. Grover’s algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First 1 order linear difference equations are found for the time evolution of the 1 amplitudes of the r marked and N − r unmarked states. These equa- tions are solved exactly. An expression for the optimal measurement time 2 T ∼ O(N/r) is derived which is shown to depend only on the initial v average amplitudes of the marked and unmarked states. A bound on the 6 probability of measuring a marked state is derived, which depends only 6 on the standard deviation of the initial amplitude distributions of the 0 1 marked or unmarked states. 0 Keywords: Quantum searching, Grover’s algorithm, exact solution. 8 9 / 1 Introduction h p - The power of Quantum Computation (QC)