Improved Success Probability with Greater Circuit Depth for the Quantum Approximate Optimization Algorithm
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Superconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544 · cited 2×
“Even though a large, fault-tolerant quantum computer is still many years away, impressive progress has been made over the last decade using superconducting circuits [2–4], leading to the noisy intermediate-scale quantum (NISQ) era [5].”
BackgroundSelf-citationCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 1×
“It was predicted that NISQ devices should allow for “quantum supremacy” [6], that is, solving a problem that is intractable on a classical computer in a reasonable time.”
BackgroundQuantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071 · cited 1×
“Quantum computing promises exponential computational speedup in a number of fields, such as cryptography, quantum simulation, and linear algebra [1].”
BackgroundScalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Research works printed but not linked: 10
- 10.1088/1361-6633/aa7e1a · DOI · Paper page
- 10.1016/j.physrep.2017.10.002 · DOI · Paper page
- 10.1103/PhysRevA.95.062317 · DOI · Paper page
- 10.1038/srep22307 · DOI
- 10.1103/PhysRevLett.123.120501 · DOI · Paper page
- 10.1103/PhysRevApplied.10.034050 · DOI · Paper page
- 10.1103/PhysRevA.96.022330 · DOI · Paper page
- 10.1103/PhysRevA.87.030301 · DOI · Paper page
- 10.1016/j.cpc.2017.06.011 · DOI · Paper page
- 10.1103/PhysRevA.81.062325 · DOI · Paper page
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan, M. P., Sung, K. J., Neeley, M., Satzinger, K. J., Arute, F., Arya, K., Atalaya, J., Bardin, J. C., Barends, R., Boixo, S., et al. (2021) · Nature Physics · doi:10.1038/s41567-020-01105-y · Cited by 564
A review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 408
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114
Self-citationBuilding blocks of a flip-chip integrated superconducting quantum processor
Kosen, S., Li, H.-X., Rommel, M., Shiri, D., Warren, C., Grönberg, L., Salonen, J., Abad, T., Biznárová, J., Caputo, M., et al. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac734b · Cited by 88
Self-citation
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
- Publisher
- American Physical Society (APS)
- 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.