A review on Quantum Approximate Optimization Algorithm and its variants

The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve combinatorial optimization problems that are classically intractable. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Physics reports Ročník 1068; s. 1 - 66
Hlavní autoři: Blekos, Kostas, Brand, Dean, Ceschini, Andrea, Chou, Chiao-Hui, Li, Rui-Hao, Pandya, Komal, Summer, Alessandro
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 02.06.2024
Témata:
ISSN:0370-1573, 1873-6270
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve combinatorial optimization problems that are classically intractable. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios, its applicability across various problem instances, and considerations of hardware-specific challenges such as error susceptibility and noise resilience. Additionally, we conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm. We aim to provide insights into key questions about the algorithm, such as whether it can outperform classical algorithms and under what circumstances it should be used. Towards this goal, we offer specific practical points in a form of a short guide.
ISSN:0370-1573
1873-6270
DOI:10.1016/j.physrep.2024.03.002