<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Noise effects in the quantum search algorithm from the viewpoint of computational complexity

Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, ul. Bałtycka 5, 44-100 Gliwice, Poland

International Journal of Applied Mathematics and Computer Science

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...

Noise effects in the quantum search algorithm from the viewpoint of computational complexity

Online veröffentlicht: 28. Juni 2012

Seitenbereich: 493 - 499

DOI: https://doi.org/10.2478/v10006-012-0037-2

Schlüsselwörter
quantum algorithms, quantum noise, algorithm complexity

This content is open access.

Noise effects in the quantum search algorithm from the viewpoint of computational complexity

Online veröffentlicht: 28. Juni 2012

Seitenbereich: 493 - 499

DOI: https://doi.org/10.2478/v10006-012-0037-2

Schlüsselwörterquantum algorithms, quantum noise, algorithm complexity

This content is open access.

Schlüsselwörter
quantum algorithms, quantum noise, algorithm complexity