CoChat

Adiabatic quantum computing for random satisfiability problems

Open access
Hogg, Tad · 2003 · Physical Review A
Cited by 93

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

Abstract

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables, the adiabatic method gives solution probabilities close to 1 for problem sizes feasible to evaluate via simulation on current computers. However, for these sizes the minimum energy gaps of most instances are fairly large, so the good performance scaling seen for small problems may not reflect asymptotic behavior where costs are dominated by tiny gaps. Moreover, the resulting search costs are much higher than for other methods. Variants of the quantum algorithm that do not match the adiabatic limit give lower costs, on average, and slower growth than the conventional GSAT heuristic method.

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/physreva.67.022314

Cites

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

Research works printed but not linked: 10

  1. G. E. Santoro, 2002, Science, 295, 2427, 10.1126/science.1068774 · DOI · Paper page
  2. S. Kirkpatrick, 1994, Science, 264, 1297, 10.1126/science.264.5163.1297 · DOI · Paper page
  3. R. Monasson, 1999, Nature (London), 400, 133, 10.1038/22055 · DOI · Paper page
  4. T. Hogg, 2000, Phys. Rev. A, 61, 052311, 10.1103/PhysRevA.61.052311 · DOI · Paper page
  5. J. Frank, 1997, J. Artif. Intell. Res., 7, 249, 10.1613/jair.445 · doi:10.1613/jair.445
  6. S. F. Edwards, 1976, J. Phys. A, 9, 1595, 10.1088/0305-4470/9/10/011 · DOI · Paper page
  7. Z. Furedi, 1981, Combinatorica, 1, 233, 10.1007/BF02579329 · DOI · Paper page
  8. J. K. L. MacDonald, 1933, Phys. Rev., 43, 830, 10.1103/PhysRev.43.830 · DOI
  9. P.-O. Lowdin, 1965, Phys. Rev., 139, A357, 10.1103/PhysRev.139.A357 · DOI · Paper page
  10. S. M. Maurer, 2001, Phys. Rev. Lett., 87, 257901, 10.1103/PhysRevLett.87.257901 · DOI

Cited by

See all 93

Metadata

Authors
Hogg, T.
Venue
Physical Review A
Published
2003-02-28
Volume
67
Issue
2
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2031963870
Cited by
93
References
9
FWCI
5.30
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: Adiabatic quantum computing for random satisfiability problems. https://app.cochat.ai/papers/10.1103/physreva.67.022314
The paper
Hogg, T. (2003). Adiabatic quantum computing for random satisfiability problems. Physical Review A. https://doi.org/10.1103/physreva.67.022314

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.