Noise effects in the quantum search algorithm from the viewpoint of computational complexity
By: Piotr Gawron, Jerzy Klamka and Ryszard Winiarczyk
Open Access
|Jun 2012Abstract
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.
Language: English
Page range: 493 - 499
Published on: Jun 28, 2012
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2012 Piotr Gawron, Jerzy Klamka, Ryszard Winiarczyk, published by University of Zielona Góra
This work is licensed under the Creative Commons License.