Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 209

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 access
Zhu, Linghua, Tang, Ho Lun, Barron, George S., Calderon-Vargas, F. A., Mayhall, Nicholas J., Barnes, Edwin, Economou, Sophia E.·2022·Physical Review Research

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevresearch.4.033029

Cites

17 of 17 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 17 references

Research works printed but not linked: 18

  1. 10.1007/s10878-014-9734-0 · DOI · Paper page
  2. 10.3389/fphy.2014.00005 · DOI · Paper page
  3. 10.1073/pnas.2006373117 · DOI · Paper page
  4. 10.1103/PhysRevA.95.062317 · DOI
  5. 10.22331/q-2020-04-20-256 · DOI · Paper page
  6. 10.1007/s11128-020-02748-9 · DOI
  7. 10.1021/jp030708a · DOI · Paper page
  8. 10.1088/1751-8113/42/36/365303 · DOI · Paper page
  9. 10.1103/RevModPhys.91.045001 · DOI · Paper page
  10. 10.1103/PhysRevApplied.15.024038 · DOI
  11. 10.3390/a12020034 · DOI · Paper page
  12. R. Shaydulin, 2019, 2019 IEEE High Performance Extreme Computing Conference (HPEC)
  13. 10.1103/PhysRevE.88.062122 · DOI
  14. 10.1038/s41567-020-0989-3 · DOI
  15. 10.1016/j.physrep.2017.07.001 · DOI · Paper page
  16. 10.1073/pnas.1619826114 · DOI · Paper page
  17. 10.1103/PhysRevLett.123.090602 · DOI · Paper page
  18. 10.1103/PhysRevA.94.042132 · DOI · Paper page

Cited by

See all 209

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
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.