Quantum search on noisy intermediate-scale quantum devices
arXiv:2202.00122 · doi:10.1209/0295-5075/ac90e6
Abstract
Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's algorithm was designed without considering the physical resources, such as depth, in the real implementations. Therefore, Grover's algorithm can be improved for NISQ devices. In this paper, we demonstrate how to implement quantum search algorithms better on NISQ devices. We present detailed benchmarks of the five-qubit quantum search algorithm on different quantum processors, including IBMQ, IonQ, and Honeywell quantum devices. We report the highest success probability of the five-qubit search algorithm compared to previous works. Our results show that designing the error-aware quantum search algorithms is possible, which can maximally harness the power of NISQ computers.
arXiv commentClose to Published version, 12 pages, 6 figures
References in corpus (27)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Amplitude Amplification and Estimation
- Tight bounds on quantum searching
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
- A Review on Quantum Search Algorithms
- A Family of Grover's Quantum Searching Algorithms
- Tradeoffs in the Quantum Search Algorithm
- Simple Algorithm for Partial Quantum Search
- Implementation of efficient quantum search algorithms on NISQ computers
- Generalized Quantum Search with Parallelism
- Exactness of the Original Grover Search Algorithm
- General framework for quantum search algorithms
- Subdivided Phase Oracle for NISQ Search Algorithms
- Quest for Fast Partial Search Algorithm
- Quantum Amplitude Amplification Operators
- Group Theoretical Formulation of Quantum Partial Search Algorithm
- Introducing Structure to Expedite Quantum Search
- Grover like Operator Using Only Single-Qubit Gates