Cited by 98Quantum Computing Algorithms and ArchitectureQuantum many-body systemsMetaheuristic Optimization Algorithms Research

Quantum optimization with a novel Gibbs objective function and ansatz architecture search

Open access
Li, Li, Fan, Minjie, Coram, Marc, Riley, Patrick, Leichenauer, Stefan·2020·Physical Review Research

Abstract

This work proposes modifications on two key components of the Quantum Approximate Optimization Algorithm (QAOA): a Gibbs objective function and an ansatz architecture search algorithm. The authors explore how these propositions improve upon ordinary QAOA when finding low-energy states by using numerical experiments on grid and complete graph Ising models.

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

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • All of the objective function approaches (CVar, ascending CVar, Gibbs) serve to foster low-energy solutions and simultaneously avoid getting trapped in local minima.

    “All of these approaches serve to foster low-energy solutions and simultaneously avoid to get trapped in local minima.”

    From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [86]

    The Theory section (page not available) says the Gibbs objective rewards increased probability of low-energy outcomes and mentions CVaR as another objective function. It does not discuss ascending CVaR or establish that these approaches avoid trapping the optimization in local minima. (LLM, conf=0.87)

    Experimental — accuracy not yet measured
  • Architecture search approaches that adapt the ansatz of a variational approach may take an existing ansatz as a starting point or be more generally created.

    “Likewise, architecture search approaches that adapt the ansatz of the variational approach may take an existing ansatz as a starting point [86, 89, 155] or be more generally created [88, 96, 97, 151, 152].”
  • CVar, ascending CVar, and the Gibbs objective function can be regarded as adaptations of standard QAOA or VQE that affect their underlying objective function.

    “In this sense, CVar [10], ascending CVar [78], and the Gibbs objective function [86] can be regarded as adaptations of standard QAOA or VQE that affect their underlying objective function.”
  • Proposals to overcome fixed and rigid ansatz restrictions comprise methods that search in a generally unrestricted search space and approaches that take existing quantum algorithms as a starting point.

    “Proposals to overcome these restrictions comprise methods that search in a generally unrestricted search space [97, 151, 152], but also approaches that take existing quantum algorithms as a starting point [86, 155], as it will be further described in Section 4.1.3.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1411.4028. · arXiv
  2. E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1412.6062. · arXiv
  3. B. Zoph and Q. V. Le, in Proceedings of 2017 Interna- tional Conference on Learning Representations (OpenReview, 2017).
  4. L. Li and A. Talwalkar, in Proceedings of the 2019 Conference on Uncertainty in Artificial Intelligence (2019), http://auai.org/ uai2019/accepted.php.
  5. S.-M. Udrescu and M. Tegmark, arXiv:1905.11481. · arXiv
  6. K. Deb, in Search Methodologies (Springer, Boston, MA, 2014), pp. 403-449.
  7. Z. Li, Q. Chen, and V. Koltun, in Advances in Neural Infor- mation Processing Systems 31 (NIPS 2018) (Curran Associates, Red Hook, NY, 2018), pp. 539-548.
  8. R. Bunel, M. Hausknecht, J. Devlin, R. Singh, and P. Kohli, in Proceedings of 2018 International Conference on Learning Representations (OpenReview, 2018).

Cited by

Sorted by citations

Authors
Li, L., Fan, M., Coram, M., Riley, P., & Leichenauer, S.
Affiliations
Google (United States) (US)
Venue
Physical Review Research
Published
2020-04-24
Volume
2
Issue
2
ISSN
2643-1564 (ISSN-L)
OpenAlex
W2974416503
Cited by
98
References
23
Citations by year
2025: 9 · 2024: 32 · 2023: 17 · 2022: 19 · 2021: 13 · 2020: 7 · 2019: 1
FWCI
5.50
Type
journal article
Language
en
Open access
Locations
  • Physical Review Research (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University)
Funders
Association for Asian Studies
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
Keywords
quantum approximate optimization algorithm, quantum optimization, Ising model, low-energy states, variational quantum algorithms

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