The DOI matches its Crossref record; 245 of the 245 references it cites were found in a registry or an index.
A review on Quantum Approximate Optimization Algorithm and its variants
Open accessAbstract
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. Keywords: Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Algorithms (VQAs), Quantum Optimization, Combinatorial Optimization Problems, NISQ Algorithms
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Items 201–245 of 245
Lower bounds on circuit depth of the quantum approximate optimization algorithm
Herrman, R., Ostrowski, J., Humble, T. S., & Siopsis, G. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03001-7 · Cited by 35
Large Cuts with Local Algorithms on Triangle-Free Graphs
Hirvonen, J., Rybicki, J., Schmid, S., & Suomela, J. (2017) · The Electronic Journal of Combinatorics · doi:10.37236/6862 · Cited by 35
Approximating the quantum approximate optimization algorithm with digital-analog interactions
Headley, D., Müller, T., Martin, A., Solano, E., Sanz, M., & Wilhelm, F. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042446 · Cited by 35
Alam, M., Ash-Saki, A., & Ghosh, S. (2019) · arXiv · doi:10.48550/arxiv.1907.09631 · Cited by 33
Maciejewski, F. B., Baccari, F., Zimborás, Z., & Oszmaniec, M. (2021) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 33
Variational Quantum Algorithms for Chemical Simulation and Drug Discovery
Mustafa, H., Morapakula, S. N., Jain, P., & Ganguly, S. (2022) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt54229.2022.10041453 · Cited by 32
QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
Shaydulin, R., Marwaha, K., Wurtz, J., & Lotshaw, P. C. (2021) · 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00011 · Cited by 31
Bounds on approximating Max k XOR with quantum and classical local algorithms
Marwaha, K., & Hadfield, S. (2022) · Quantum · doi:10.22331/q-2022-07-07-757 · Cited by 31
Robust Control Optimization for Quantum Approximate Optimization Algorithms
Dong, Y., Meng, X., Lin, L., Kosut, R. L., & Whaley, K. B. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.130 · Cited by 30
Patterns for Hybrid Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Vietz, D. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_2 · Cited by 30
Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
Bae, E., & Lee, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04286-0 · Cited by 30
Implementing Graph-Theoretic Feature Selection by Quantum Approximate Optimization Algorithm
Li, Y., Zhou, R., Xu, R., Luo, J., Hu, W., & Fan, P. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3190042 · Cited by 29
Quantum approximate optimization for combinatorial problems with constraints
Ruan, Y., Yuan, Z., Xue, X., & Liu, Z. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.020 · Cited by 28
Augmenting QAOA Ansatz with Multiparameter Problem-Independent Layer
Chalupnik, M., Melo, H., Alexeev, Y., & Galda, A. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00028 · Cited by 27
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree
Barak, B., Moitra, A., O’Donnell, R., Raghavendra, P., Regev, O., Steurer, D., Trevisan, L., Vijayaraghavan, A., Witmer, D. K., & Wright, J. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx-random.2015.110 · Cited by 25
Donkers, H., Mesman, K. J., Al-Ars, Z., & Möller, M. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2205.12142 · Cited by 25
Zhu, L., Tang, H. L., Barron, G. S., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.10258 · Cited by 25
Error mitigation for quantum approximate optimization
Weidinger, A., Mbeng, G. B., & Lechner, W. (2023) · Physical Review A · doi:10.1103/physreva.108.032408 · Cited by 24
Proietti, M., Cerocchi, F., & Dispenza, M. (2022) · Physical Review A · doi:10.1103/physreva.106.022437 · Cited by 23
Shortcuts to the quantum approximate optimization algorithm
Chai, Y., Han, Y., Wu, Y.-C., Li, Y., Dou, M., & Guo, G. (2022) · Physical Review A · doi:10.1103/physreva.105.042415 · Cited by 22
Sreedhar, R., Vikstål, P., Svensson, M., Ask, A., Johansson, G., & García-Álvarez, L. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2207.03404 · Cited by 22
Approximating the quantum approximate optimization algorithm with digital-analog interactions
Headley, D., Müller, T., Martin, A., Solano, E., Sanz, M., & Wilhelm, F. K. (2020) · arXiv · doi:10.48550/arxiv.2002.12215 · Cited by 21
Fermionic quantum approximate optimization algorithm
Yoshioka, T., Sasada, K., Nakano, Y., & Fujii, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023071 · Cited by 20
Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Barak, B., & Marwaha, K. (2021) · arXiv · doi:10.48550/arxiv.2106.05900 · Cited by 19
Improving WalkSAT By Effective Tie-Breaking and Efficient Implementation
Cai, S., Luo, C. W., & Su, K. (2014) · The Computer Journal · doi:10.1093/comjnl/bxu135 · Cited by 19
Quantifying the impact of precision errors on quantum approximate optimization algorithms
Quiroz, G., Titum, P., Lotshaw, P. C., Lougovski, P., Schultz, K., Dumitrescu, E., & Hen, I. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023240 · Cited by 19
Simulations of frustrated Ising Hamiltonians using quantum approximate optimization
Lotshaw, P. C., Xu, H., Khalid, B., Buchs, G., Humble, T. S., & Banerjee, A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0414 · Cited by 19
Multiangle QAOA Does Not Always Need All Its Angles
Shi, K., Herrman, R., Shaydulin, R., Chakrabarti, S., Pistoia, M., & Larson, J. M. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00062 · Cited by 19
Reinforcement learning enhanced quantum-inspired algorithm for combinatorial optimization
Beloborodov, D., Ulanov, A. E., Foerster, J., Whiteson, S., & Lvovsky, A. I. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abc328 · Cited by 18
Improvement of Quantum Approximate Optimization Algorithm for Max–Cut Problems
Villalba-Díez, J., González‐Marcos, A., & Ordieres-Meré, J. B. (2021) · Sensors · doi:10.3390/s22010244 · Cited by 18
Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
Dupont, M., Didier, N., Hodson, M. J., Moore, J. E., & Reagor, M. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040339 · Cited by 18
Govia, L. C. G., Poole, C., Saffman, M. E., & Krovi, H. (2021) · Physical Review A · doi:10.1103/physreva.104.062428 · Cited by 17
Iteration Complexity of Variational Quantum Algorithms
Kungurtsev, V., Korpas, G., Mareček, J., & Zhu, E. Y. (2024) · Quantum · doi:10.22331/q-2024-10-10-1495 · Cited by 16
Investigating quantum approximate optimization algorithms under bang-bang protocols
Liang, D., Li, L., & Leichenauer, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033402 · Cited by 15
Reinforcement Learning with Quantum Variational CircuitsPreprint
Lockwood, O., & Si, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.07524 · Cited by 15
Optimizing quantum algorithms on bipotent architectures
Ji, Y., Koenig, K. F., & Polian, I. (2023) · Physical Review A · doi:10.1103/physreva.108.022610 · Cited by 15
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Pelofske, E., Bärtschi, A., Golden, J., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00064 · Cited by 15
Ability of error correlations to improve the performance of variational quantum algorithms
Kattemölle, J., & Burkard, G. (2023) · Physical Review A · doi:10.1103/physreva.107.042426 · Cited by 14
Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond
Chou, C.-N., Love, P. J., Sandhu, J. S., & Shi, J. (2021) · arXiv · doi:10.48550/arxiv.2108.06049 · Cited by 13
Self-citationExploring the neighborhood of 1-layer QAOA with instantaneous quantum polynomial circuits
Leontica, S., & Amaro, D. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013071 · Cited by 13
Rajakumar, J., Moondra, J., Gard, B., Gupta, S., & Herold, C. D. (2022) · Physical Review A · doi:10.1103/physreva.106.022606 · Cited by 11
Capturing Symmetries of Quantum Optimization Algorithms Using Graph Neural Networks
Deshpande, A., & Melnikov, A. A. (2022) · Symmetry · doi:10.3390/sym14122593 · Cited by 11
Ion-native variational ansatz for quantum approximate optimization
Rabinovich, D., Adhikary, S., Campos, E., Akshay, V., Anikin, E. V., Sengupta, R., Lakhmanskaya, O., Lakhmanskiy, K., & Biamonte, J. (2022) · Physical Review A · doi:10.1103/physreva.106.032418 · Cited by 10
Quantum approximate optimization algorithm with cat qubits
Vikstål, P., García-Álvarez, L., Puri, S., & Ferrini, G. (2026) · Scientific Reports · doi:10.1038/s41598-026-77938-z · Cited by 6
Quantum-Classical Hybrid Algorithms
Baaquie, B. E., & Kwek, L. C. (2023) · Springer eBooks · doi:10.1007/978-981-19-7517-2_16 · Cited by 4
Cited by
Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
Maciejewski, F. B., Biamonte, J., Hadfield, S., & Venturelli, D. (2025) · Quantum · doi:10.22331/q-2025-11-06-1906 · Cited by 10
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
Metadata
- Authors
- Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A.
- Venue
- Physics Reports
- Publisher
- Elsevier BV
- Published
- 2024-06
- Volume
- 1068
- Pages
- 1-66
- ISSN
- 0370-1573 (ISSN-L)
- OpenAlex
- W4392877631
- Cited by
- 408
- References
- 245
- FWCI
- 60.12
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.