Physical Review A · 1999 · 118 citations · 8 references
Natural SciencesComputer SciencePhysicsAlgorithmsQuantum ComputingQuantum MechanicsComputational Quantum MechanicsQuantum AlgorithmsQuantum ComputationQuantum DynamicsQuantum MeasurementQuantum StatesGrover's AlgorithmGrover's SearchHigher-order MomentsInitializationLinear Difference EquationsMomentsQuantum Search AlgorithmsTime Evolution Of States
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First-order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover's algorithm is robust against modest noise in the amplitude initialization procedure.
8
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Lov K. Grover · Physical Review Letters · 1997 · 4.4K citations · Full text
Computing, Computer Science, Physics +11
Strengths and Weaknesses of Quantum Computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard et al. · SIAM Journal on Computing · 1997 · 1.5K citations · Full text
Cryptography: Theory and practice
Computers & Mathematics with Applications · 1995 · 1.4K citations