2000 character limit reached
Noise effects in the quantum search algorithm from the computational complexity point of view (1108.1915v1)
Published 9 Aug 2011 in quant-ph and cs.CC
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
