  The damped quantum search proposed in [A. Mizel, Phys. Rev. Lett., 102 150501
(2009)] was analyzed by calculating the highest possible probability of finding
the target state in each iteration. A new damping parameter that depends on the
number of iterations was obtained, this was compared to the critical damping
parameter for different values of target to database size ratio. The result
shows that the range of the new damping parameter as a function of the target
to database size ratio increases as the number of iterations is increased.
Furthermore, application of the new damping parameter per iteration on the
damped quantum search scheme shows a significant improvement on some target to
database size ratio (i.e. greater than or equal to 50% maximum percentage
difference) over the critically damped quantum search.
