Performance of Grover's search algorithm with diagonalizable collective noises
From MaRDI portal
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.
Recommendations
- Performance analysis of the hardware-efficient quantum search algorithm
- Implementation of efficient quantum search algorithms on NISQ computers
- Optimal fixed-point quantum search in an interacting Ising spin system
- Complexity of Grover's algorithm: an algebraic approach
- Grover's search with local and total depolarizing channel errors: complexity analysis
Cites work
- Complexity measures and decision tree complexity: a survey.
- Computational complexity and applications of quantum algorithm
- Correlations in the Grover search
- Dynamic Grover search: applications in recommendation systems and optimization problems
- Entangling and disentangling in Grover's search algorithm
- Global multipartite entanglement dynamics in Grover's search algorithm
- Grover's search with local and total depolarizing channel errors: complexity analysis
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5320203 (Why is no real title available?)
- Noise effects in the quantum search algorithm from the viewpoint of computational complexity
- Phase matching in quantum searching.
- Quantum generative adversarial network for generating discrete distribution
- Quantum search degeneration under amplitude noise in queries to the oracle
- Rapid solution of problems by quantum computation
- Revisiting Deutsch-Jozsa algorithm
- The quadratic speedup in Grover's search algorithm from the entanglement perspective
Cited in
(4)
This page was built for publication: Performance of Grover's search algorithm with diagonalizable collective noises
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098311)
