Dominant gate imperfection in Grover's quantum search algorithm - art. no.042305

Citation
Gl. Long et al., Dominant gate imperfection in Grover's quantum search algorithm - art. no.042305, PHYS REV A, 6104(4), 2000, pp. 2305
Citations number
24
Categorie Soggetti
Physics
Journal title
PHYSICAL REVIEW A
ISSN journal
10502947 → ACNP
Volume
6104
Issue
4
Year of publication
2000
Database
ISI
SICI code
1050-2947(200004)6104:4<2305:DGIIGQ>2.0.ZU;2-3
Abstract
It is found Chat 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 probabi lity of the marked state and affect the efficiency of the algorithm. Given the degree of inaccuracy, we find that to guarantee a half-rate of success, the size of the database should be on the order of O(1/delta(2)), where de lta is the uncertainty.