Quantum search on noisy intermediate-scale quantum devices

¹ Department of Chemistry, State University of New York at Stony Brook - Stony Brook, NY 11794, USA
² Computational Science Initiative, Brookhaven National Laboratory - Upton, NY 11973, USA
³ C.N. Yang Institute for Theoretical Physics, Stony Brook University - Stony Brook, NY 11794-3840, USA

^(a) E-mail: kun.zhang.phy@gmail.com (corresponding author)

Received: 12 June 2022
Accepted: 9 September 2022

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.