Noise effects in the quantum search algorithm from the viewpoint of computational complexity
, et | 28 juin 2012
International Journal of Applied Mathematics and Computer Science
Analysis and Control of Spatiotemporal Dynamic Systems (special section, pp. 245 - 326), Dariusz Uciński and Józef Korbicz (Eds.)
À propos de cet article
Publié en ligne: 28 juin 2012
Pages: 493 - 499
DOI: https://doi.org/10.2478/v10006-012-0037-2
Mots clés
This content is open access.
We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.