The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
Open accessAbstract
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the standard QAOA Ansatz is not optimal, there is no systematic approach for finding better Ans\"atze. We address this problem by developing an iterative version of QAOA that is problem tailored, and which can also be adapted to specific hardware constraints. We simulate the algorithm on a class of Max-Cut graph problems and show that it converges much faster than the standard QAOA, while simultaneously reducing the required number of CNOT gates and optimization parameters. We provide evidence that this speedup is connected to the concept of shortcuts to adiabaticity.
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
An adaptive variational algorithm for exact molecular simulations on a quantum computer
Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2019) · Nature Communications · doi:10.1038/s41467-019-10988-2 · Cited by 1,033
Self-citationZhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan, M. P., Sung, K. J., Neeley, M., Satzinger, K. J., Arute, F., Arya, K., Atalaya, J., Bardin, J. C., Barends, R., Boixo, S., et al. (2021) · Nature Physics · doi:10.1038/s41567-020-01105-y · Cited by 564
Tang, H. L., Shkolnikov, V. O., Barron, G. S., Grimsley, H. R., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020310 · Cited by 408
Self-citationQuantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337
Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2019) · arXiv · doi:10.48550/arxiv.1910.08980 · Cited by 279
Obstacles to Variational Quantum Optimization from Symmetry Protection
Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260505 · Cited by 278
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256
Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021027 · Cited by 210
Research works printed but not linked: 18
- 10.1007/s10878-014-9734-0 · DOI · Paper page
- 10.3389/fphy.2014.00005 · DOI · Paper page
- 10.1073/pnas.2006373117 · DOI · Paper page
- 10.1103/PhysRevA.95.062317 · DOI
- 10.22331/q-2020-04-20-256 · DOI · Paper page
- 10.1007/s11128-020-02748-9 · DOI
- 10.1021/jp030708a · DOI · Paper page
- 10.1088/1751-8113/42/36/365303 · DOI · Paper page
- 10.1103/RevModPhys.91.045001 · DOI · Paper page
- 10.1103/PhysRevApplied.15.024038 · DOI
- 10.3390/a12020034 · DOI · Paper page
- R. Shaydulin, 2019, 2019 IEEE High Performance Extreme Computing Conference (HPEC)
- 10.1103/PhysRevE.88.062122 · DOI
- 10.1038/s41567-020-0989-3 · DOI
- 10.1016/j.physrep.2017.07.001 · DOI · Paper page
- 10.1073/pnas.1619826114 · DOI · Paper page
- 10.1103/PhysRevLett.123.090602 · DOI · Paper page
- 10.1103/PhysRevA.94.042132 · DOI · Paper page
Cited by
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
Generalization in quantum machine learning from few training data
Caro, M. C., Huang, H.-Y., Cerezo, M., Sharma, K., Sornborger, A., Cincio, L., & Coles, P. J. (2022) · Nature Communications · doi:10.1038/s41467-022-32550-3 · Cited by 476
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
Barren plateaus in variational quantum computing
Larocca, M., Thanasilp, S., Wang, S., Sharma, K., Biamonte, J., Coles, P. J., Cincio, L., McClean, J. R., Holmes, Z., & Cerezo, M. (2025) · Nature Reviews Physics · doi:10.1038/s42254-025-00813-9 · Cited by 257
Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
Liu, X., Angone, A., Shaydulin, R., Safro, I., Alexeev, Y., & Cincio, L. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3140190 · Cited by 78
Metadata
- Authors
- Zhu, L., Tang, H. L., Barron, G. S., Calderon-Vargas, F. A., Mayhall, N. J., Barnes, E., & Economou, S. E.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2022-07-11
- Volume
- 4
- Issue
- 3
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W3026387229
- Cited by
- 209
- References
- 17
- FWCI
- 13.73
- Type
- journal article
- Language
- en
- Open access
- gold
- Funders
- U.S. Department of Energy (DE-SC0019318, DE-SC0019199)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. https://app.cochat.ai/papers/10.1103/physrevresearch.4.033029
- The paper
- Zhu, L., Tang, H. L., Barron, G. S., Calderon-Vargas, F. A., Mayhall, N. J., Barnes, E., & Economou, S. E. (2022). Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. Physical Review Research. https://doi.org/10.1103/physrevresearch.4.033029
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.