Abstract
The dynamical behavior and the success probability of Grover's quantum search algorithm for arbitrary pure quantum states were studied. The probability of success of the algorithm, Ps, was expressed in terms of the amplitudes of a given initial state. It was found that the success probability did not depend on the number of marked states used in the algorithm.
| Original language | English |
|---|---|
| Article number | 022326 |
| Pages (from-to) | 223261-223268 |
| Number of pages | 8 |
| Journal | Physical Review A - Atomic, Molecular, and Optical Physics |
| Volume | 68 |
| Issue number | 2 |
| State | Published - Aug 2003 |