CoChat

Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems

Open access
Brady, Lucas T., Baldwin, Christopher L., Bapat, Aniruddha, Kharkov, Yaroslav, Gorshkov, Alexey V. · 2021 · Physical Review Letters
Cited by 117

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or "bang-bang") structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. The general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1103/physrevlett.126.070505

Cites

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 8 references

Cited by

See all 117

Metadata

Authors
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V.
Venue
Physical Review Letters
Published
2021-02-19
Volume
126
Issue
7
Pages
070505-070505
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W3012851713
Cited by
117
References
8
FWCI
7.67
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems. https://app.cochat.ai/papers/10.1103/physrevlett.126.070505
The paper
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2021). Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems. Physical Review Letters. https://doi.org/10.1103/physrevlett.126.070505

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.