CoChat

Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm

Open access
Bengtsson, Andreas, Vikstål, Pontus, Warren, Christopher, Svensson, Marika, Gu, Xiu, Kockum, Anton Frisk, Krantz, Philip, Križan, Christian, Shiri, Daryoush, Svensson, Ida-Maria, Tancredi, Giovanna, Johansson, Göran, Delsing, Per, Ferrini, Giulia, Bylander, Jonas · 2020 · Physical Review Applied
Cited by 79

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

Abstract

Present-day, noisy, small or intermediate-scale quantum processors---although far from fault tolerant---support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP (nondeterministic polynomial time)-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two.

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/physrevapplied.14.034010

Cites

13 of 13 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 13 references

Research works printed but not linked: 10

  1. 10.1088/1361-6633/aa7e1a · DOI · Paper page
  2. 10.1016/j.physrep.2017.10.002 · DOI · Paper page
  3. 10.1103/PhysRevA.95.062317 · DOI · Paper page
  4. 10.1038/srep22307 · DOI
  5. 10.1103/PhysRevLett.123.120501 · DOI · Paper page
  6. 10.1103/PhysRevApplied.10.034050 · DOI · Paper page
  7. 10.1103/PhysRevA.96.022330 · DOI · Paper page
  8. 10.1103/PhysRevA.87.030301 · DOI · Paper page
  9. 10.1016/j.cpc.2017.06.011 · DOI · Paper page
  10. 10.1103/PhysRevA.81.062325 · DOI · Paper page

Cited by

See all 79

Metadata

Authors
Bengtsson, A., Vikstål, P., Warren, C., Svensson, M., Gu, X., Kockum, A. F., Krantz, P., Križan, C., Shiri, D., Svensson, I.-M., Tancredi, G., Johansson, G., Delsing, P., Ferrini, G., & Bylander, J.
Venue
Physical Review Applied
Published
2020-09-03
Volume
14
Issue
3
ISSN
2331-7019 (ISSN-L)
OpenAlex
W3084809630
Cited by
79
References
13
FWCI
5.11
Type
journal article
Language
en
Open access
hybrid

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: Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm. https://app.cochat.ai/papers/10.1103/physrevapplied.14.034010
The paper
Bengtsson, A., Vikstål, P., Warren, C., Svensson, M., Gu, X., Kockum, A. F., Krantz, P., Križan, C., Shiri, D., Svensson, I.-M., Tancredi, G., Johansson, G., Delsing, P., Ferrini, G., & Bylander, J. (2020). Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm. Physical Review Applied. https://doi.org/10.1103/physrevapplied.14.034010

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.