Quantum search on noisy intermediate-scale quantum devices

Zhang, K.; Yu, K.; Korepin, V.

doi:10.1209/0295-5075/ac90e6

Quantum search on noisy intermediate-scale quantum devices

Journal Article · 27 September 2022 · Europhysics Letters

DOI:https://doi.org/10.1209/0295-5075/ac90e6· OSTI ID:2423065

; Yu, K.; Korepin, V.

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.

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

References (27)

Tight Bounds on Quantum Searching Boyer, Michel; Brassard, Gilles; Høyer, Peter Fortschritte der Physik, Vol. 46, Issue 4-5 https://doi.org/10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P	journal	June 1998
Simple Algorithm for Partial Quantum Search Korepin, Vladimir E.; Grover, Lov K. Quantum Information Processing, Vol. 5, Issue 1 https://doi.org/10.1007/s11128-005-0004-z	journal	February 2006
Quest for Fast Partial Search Algorithm Korepin, Vladimir E.; Liao, Jinfeng Quantum Information Processing, Vol. 5, Issue 3 https://doi.org/10.1007/s11128-006-0024-3	journal	May 2006
A review on quantum search algorithms Giri, Pulak Ranjan; Korepin, Vladimir E. Quantum Information Processing, Vol. 16, Issue 12 https://doi.org/10.1007/s11128-017-1768-7	journal	November 2017
Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 Kim, Panjin; Han, Daewan; Jeong, Kyung Chul Quantum Information Processing, Vol. 17, Issue 12 https://doi.org/10.1007/s11128-018-2107-3	journal	October 2018
Implementation of efficient quantum search algorithms on NISQ computers Zhang, Kun; Rao, Pooja; Yu, Kwangmin Quantum Information Processing, Vol. 20, Issue 7 https://doi.org/10.1007/s11128-021-03165-2	journal	July 2021
Quantum machine learning Biamonte, Jacob; Wittek, Peter; Pancotti, Nicola Nature, Vol. 549, Issue 7671 https://doi.org/10.1038/nature23474	journal	September 2017
Complete 3-Qubit Grover search on a programmable quantum computer Figgatt, C.; Maslov, D.; Landsman, K. A. Nature Communications, Vol. 8, Issue 1 https://doi.org/10.1038/s41467-017-01904-7	journal	December 2017
Quantum amplitude amplification and estimation Brassard, Gilles; Høyer, Peter; Mosca, Michele Quantum Computation and Information https://doi.org/10.1090/conm/305/05215	book	January 2002
Introducing structure to expedite quantum searching Briański, Marcin; Gwinner, Jan; Hlembotskyi, Vladyslav Physical Review A, Vol. 103, Issue 6 https://doi.org/10.1103/PhysRevA.103.062425	journal	June 2021
Quantum amplitude-amplification operators Kwon, Hyeokjea; Bae, Joonwoo Physical Review A, Vol. 104, Issue 6 https://doi.org/10.1103/PhysRevA.104.062438	journal	December 2021
Elementary gates for quantum computation Barenco, Adriano; Bennett, Charles H.; Cleve, Richard Physical Review A, Vol. 52, Issue 5 https://doi.org/10.1103/PhysRevA.52.3457	journal	November 1995
Grover’s quantum searching algorithm is optimal Zalka, Christof Physical Review A, Vol. 60, Issue 4 https://doi.org/10.1103/PhysRevA.60.2746	journal	October 1999
Generalized quantum search with parallelism Gingrich, Robert M.; Williams, Colin P.; Cerf, Nicolas J. Physical Review A, Vol. 61, Issue 5 https://doi.org/10.1103/PhysRevA.61.052313	journal	April 2000
Family of Grover’s quantum-searching algorithms Galindo, A.; Martín-Delgado, M. A. Physical Review A, Vol. 62, Issue 6 https://doi.org/10.1103/PhysRevA.62.062303	journal	November 2000
Trade-offs in the quantum search algorithm Grover, Lov K. Physical Review A, Vol. 66, Issue 5 https://doi.org/10.1103/PhysRevA.66.052314	journal	November 2002
Grover-algorithm-like operator using only single-qubit gates Kato, G. Physical Review A, Vol. 72, Issue 3 https://doi.org/10.1103/PhysRevA.72.032319	journal	September 2005
Exactness of the original Grover search algorithm Diao, Zijian Physical Review A, Vol. 82, Issue 4 https://doi.org/10.1103/PhysRevA.82.044301	journal	October 2010
General framework for quantum search algorithms Tulsi, Avatar Physical Review A, Vol. 86, Issue 4 https://doi.org/10.1103/PhysRevA.86.042331	journal	October 2012
Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization Maslov, Dmitri Physical Review A, Vol. 93, Issue 2 https://doi.org/10.1103/PhysRevA.93.022311	journal	February 2016
Quantum Mechanics Helps in Searching for a Needle in a Haystack Grover, Lov K. Physical Review Letters, Vol. 79, Issue 2 https://doi.org/10.1103/PhysRevLett.79.325	journal	July 1997
Quantum Computers Can Search Rapidly by Using Almost Any Transformation Grover, Lov K. Physical Review Letters, Vol. 80, Issue 19 https://doi.org/10.1103/PhysRevLett.80.4329	journal	May 1998
Noisy intermediate-scale quantum algorithms Bharti, Kishor; Cervera-Lierta, Alba; Kyaw, Thi Ha Reviews of Modern Physics, Vol. 94, Issue 1 https://doi.org/10.1103/RevModPhys.94.015004	journal	February 2022
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits Amy, M.; Maslov, D.; Mosca, M. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 32, Issue 6 https://doi.org/10.1109/TCAD.2013.2244643	journal	June 2013
Subdivided Phase Oracle for NISQ Search Algorithms Satoh, Takahiko; Ohkura, Yasuhiro; Van Meter, Rodney IEEE Transactions on Quantum Engineering, Vol. 1 https://doi.org/10.1109/TQE.2020.3012068	journal	January 2020
Group Theoretical Formulation of a Quantum Partial Search Algorithm Korepin, V. E.; Vallilo, B. C. Progress of Theoretical Physics, Vol. 116, Issue 5 https://doi.org/10.1143/PTP.116.783	journal	November 2006
Quantum Computing in the NISQ era and beyond Preskill, John Quantum, Vol. 2 https://doi.org/10.22331/q-2018-08-06-79	journal	August 2018

Similar Records

Noisy intermediate-scale quantum algorithms

Journal Article · 2022 · Reviews of Modern Physics · OSTI ID:1980381

Benchmarking Quantum Processor Performance through Quantum Distance Metrics Over An Algorithm Suite

Conference · 2022 · OSTI ID:1894585

Related Subjects

Physics

Quantum search on noisy intermediate-scale quantum devices

Citation Formats

References (27)

Similar Records

Related Subjects