Noise effects in the quantum search algorithm from the computational complexity point of view
Quantum Physics
2018-11-19 v1 Computational Complexity
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 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.
Cite
@article{arxiv.1108.1915,
title = {Noise effects in the quantum search algorithm from the computational complexity point of view},
author = {Piotr Gawron and Jerzy Klamka and Ryszard Winiarczyk},
journal= {arXiv preprint arXiv:1108.1915},
year = {2018}
}
Comments
7 pages, 2 figures