DOMINANT GATE IMPERFECTION IN GROVER'S QUANTUM SEARCH ALGORITHM
Gui‐Lu Long, Yansong Li, WEI-LIN ZHANG, Chang-Cun Tu
Abstract
It is found that systematic errors in phase inversions and random errors in Hadmard–Walsh 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 degrees of inaccuracies, we find that to guarantee half rate of success, the size of the database should be in the order of O(1/δ 2 ), where δ is the uncertainty.