Performance of Grover's search algorithm with diagonalizable collective noises
arXiv:2111.12219
Abstract
Grover's search algorithm (GSA) is known to experience a loss of its quadratic speedup when exposed to quantum noise. In this study, we partially agree with this result and present our findings. First, we examine different typical diagonalizable noises acting on the oracles in GSA and find that the success probability decreases and oscillates around as the number of iterations increases. Secondly, our results show that the performance of GSA can be improved by certain types of noise, such as bit flip and bit-phase flip noise. Finally, we determine the noise threshold for bit-phase flip noise to achieve a desired success probability and demonstrate that GSA with bit-phase flip noise still outperforms its classical counterpart. These results suggest new avenues for research in noisy intermediate-scale quantum (NISQ) computing, such as evaluating the feasibility of quantum algorithms with noise and exploring their applications in machine learning.
References in corpus (22)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Supervised learning with quantum enhanced feature spaces
- Quantum computational chemistry
- Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm
- Fixed-point quantum search with an optimal number of queries
- Coherence depletion in the Grover quantum search algorithm
- Quantum generative adversarial network for generating discrete distribution
- On Arbitrary Phases in Quantum Amplitude Amplification
- Effects of Noisy Oracle on Search Algorithm Complexity
- Depth optimization of quantum search algorithms beyond Grover's algorithm
- The effect of unitary noise on Grover's quantum search algorithm
- A Family of Grover's Quantum Searching Algorithms
- Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
- Noise in Grover's Quantum Search Algorithm
- Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era
- Noise effects in the quantum search algorithm from the computational complexity point of view
- Dynamic Grover Search: Applications in Recommendation systems and Optimization problems
- Grover search under localized dephasing
- Dissipative decoherence in the Grover algorithm
- Faster quantum searching with almost arbitrary operators
- Higher order perturbation theory for decoherence in Grover's algorithm