Dominant gate imperfection in Grover's quantum search algorithm
Abstract
It is found that systematic errors in phase inversions and random errors in HadmardWalsh transformations are the dominant gate imperfection in Grover's quantum search algorithm. They lead to reductions in the maximum probability of the marked state and affect the efficiency of the algorithm. Given the degree of inaccuracy, we find that to guarantee a halfrate of success, the size of the database should be on the order of O(1/δ^{2}), where δ is the uncertainty.
 Publication:

Physical Review A
 Pub Date:
 April 2000
 DOI:
 10.1103/PhysRevA.61.042305
 Bibcode:
 2000PhRvA..61d2305L
 Keywords:

 03.67.Lx;
 89.70.+c;
 Quantum computation;
 Information theory and communication theory