TY  - JOUR
A1  - Bharti, Kishor
A1  - Cervera-Lierta, Alba
A1  - Kyaw, Thi Ha
A1  - Haug, Tobias
A1  - Alperin-Lea, Sumner
A1  - Anand, Abhinav
A1  - Degroote, Matthias
A1  - Heimonen, Hermanni
A1  - Kottmann, Jakob S.
A1  - Menke, Tim
A1  - Mok, Wai-Keong
A1  - Sim, Sukin
A1  - Kwek, Leong-Chuan
A1  - Aspuru-Guzik, Alán
T1  - Noisy intermediate-scale quantum algorithms
T2  - Reviews of Modern Physics
N2  - A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. A comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.
KW  - General Physics and Astronomy
Y1  - 2022
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/101956
SN  - 0034-6861
SN  - 1539-0756
VL  - 94
SP  - 015004
PB  - American Physical Society (APS)
CY  - College Park, MD
ER  -