Noise effects in the quantum search algorithm from the computational complexity point of view
arXiv:1108.1915 · doi:10.2478/v10006-012-0037-2
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.
arXiv comment7 pages, 2 figures
References in corpus (9)
- Quantum Mechanics helps in searching for a needle in a haystack
- Effects of Noisy Oracle on Search Algorithm Complexity
- The effect of unitary noise on Grover's quantum search algorithm
- Noise effect on Grover algorithm
- Decoherence and Programmable Quantum Computation
- Noise in Grover's Quantum Search Algorithm
- Dissipative decoherence in the Grover algorithm
- Higher order perturbation theory for decoherence in Grover's algorithm
- Extending scientific computing system with structural quantum programming capabilities
Cited by in corpus (11)
- Qubit flip game on a Heisenberg spin chain
- A Benchmarking Study of Quantum Algorithms for Combinatorial Optimization
- Complementarity between Success Probability and Coherence in Grover Search Algorithm
- Enhancing pseudo-telepathy in the Magic Square game
- A classical limit of Grover's algorithm induced by dephasing: Coherence vs entanglement
- A model for quantum queue
- Concise Quantum Associative Memories with Nonlinear Search Algorithm
- Invariance of success probability in Grover's quantum search under local noise with memory
- Performance of Grover's search algorithm with diagonalizable collective noises
- A note on the runtime of a faulty Hamiltonian oracle
- Search Via quantum walks with intermediate measurements