TY - JOUR
AU - Piotr Gawron
AU - Jerzy Klamka
AU - Ryszard Winiarczyk
AB - 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 computational complexity of the quantum search algorithm. We show that only for small amounts of noise the quantum search algorithm is still more efficient than any classical algorithm.
BT - International Journal of Applied Mathematics and Computer Science
LA - eng
M1 - 2
N1 - arXiv:1108.1915
N2 - 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 computational complexity of the quantum search algorithm. We show that only for small amounts of noise the quantum search algorithm is still more efficient than any classical algorithm.
PY - 2012
EP - 493–499
T2 - International Journal of Applied Mathematics and Computer Science
TI - Noise effects in the quantum search algorithm from the viewpoint of computational complexity
VL - 22
ER -