Quantum search on noisy intermediate-scale quantum devices
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.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 2423065
- Journal Information:
- Europhysics Letters, Journal Name: Europhysics Letters Journal Issue: 1 Vol. 140; ISSN 0295-5075
- Publisher:
- IOP Publishing
- Country of Publication:
- United States
- Language:
- English
Similar Records
Classical Optimizers for Noisy Intermediate-Scale Quantum Devices