  This paper analyzes the relationship between initialization error and recall
of a specific memory in the Grover algorithm for quantum database search. It is
shown that the correct memory is obtained with high probability even when the
initial state is far removed from the correct one. The analysis is done by
relating the variance of error in the initial state to the recovery of the
correct memory and the surprising result is obtained that the relationship
between the two is essentially linear.
