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

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

Classical variational simulation of the Quantum Approximate Optimization Algorithm

Open access
Medvidović, Matija, Carleo, Giuseppe · 2021 · npj Quantum Information

Abstract

A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum systems is an important component of addressing this question. We introduce a method to simulate layered quantum circuits consisting of parametrized gates, an architecture behind many variational quantum algorithms suitable for near-term quantum computers. A neural-network parametrization of the many-qubit wavefunction is used, focusing on states relevant for the Quantum Approximate Optimization Algorithm (QAOA). For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers, approximately implementing 324 RZZ gates and 216 RX gates without requiring large-scale computational resources. For larger systems, our approach can be used to provide accurate QAOA simulations at previously unexplored parameter values and to benchmark the next generation of experiments in the Noisy Intermediate-Scale Quantum (NISQ) era.

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.1038/s41534-021-00440-z

Cites

55 of 55 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

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?

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

Research works printed but not linked: 3

  1. Kingma, D. P. & Ba, J. L. Adam: a method for stochastic optimization. in 3rd Int. Conf. Learn. Represent. ICLR 2015 - Conf. Track Proc. (San Diego, CA, USA, 2015) https://dblp.org/db/conf/iclr/iclr2015.html.
  2. Gomes, J., Eastman, P., McKiernan, K. A. & Pande, V. S. Classical quantum optimization with neural network quantum states. Preprint at https://arxiv.org/abs/1910.10675 (2019). · arXiv
  3. Zhao, T., Carleo, G., Stokes, J. & Veerapaneni, S. Natural evolution strategies and variational Monte Carlo. Mach. Learn. Sci. Technol. 2, 2–3 (2020).

Cited by

See all 80

Metadata

Authors
Medvidović, M., & Carleo, G.
Affiliations
  • Flatiron Institute (US)
  • École Polytechnique Fédérale de Lausanne (CH)
Corresponding author
Carleo, Giuseppe
Venue
npj Quantum Information
Published
2021-06-18
Volume
7
Issue
1
ISSN
2056-6387 (ISSN-L)
OpenAlex
W3082481571
Cited by
79
References
47
Citations by year
2026: 7 · 2025: 14 · 2024: 17 · 2023: 23 · 2022: 13 · 2021: 4
FWCI
5.13
Type
journal article
Language
en
Open access
Licence
Locations
  • npj Quantum Information (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • Simons Foundation
  • Flatiron Health
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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum approximate optimization algorithm, classical simulation of quantum circuits, variational quantum algorithms, variational quantum eigensolver, NISQ devices, variational quantum circuits

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: Classical variational simulation of the Quantum Approximate Optimization Algorithm. https://app.cochat.ai/papers/10.1038/s41534-021-00440-z
The paper
Medvidović, M., & Carleo, G. (2021). Classical variational simulation of the Quantum Approximate Optimization Algorithm. npj Quantum Information. https://doi.org/10.1038/s41534-021-00440-z

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.