CoChat

First-Order Transitions and the Performance of Quantum Algorithms in Random Optimization Problems

Open access
Jörg, Thomas, Krzakala, Florent, Semerjian, Guilhem, Zamponi, Francesco · 2010 · Physical Review Letters
Cited by 100

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

Abstract

We present a study of the phase diagram of a random optimization problem in the presence of quantum fluctuations. Our main result is the characterization of the nature of the phase transition, which we find to be a first-order quantum phase transition. We provide evidence that the gap vanishes exponentially with the system size at the transition. This indicates that the quantum adiabatic algorithm requires a time growing exponentially with system size to find the ground state of this problem.

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/physrevlett.104.207206

Cites

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

Cited by

See all 100

Metadata

Authors
Jörg, T., Krzakala, F., Semerjian, G., & Zamponi, F.
Venue
Physical Review Letters
Published
2010-05-20
Volume
104
Issue
20
Pages
207206-207206
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1983666316
Cited by
100
References
2
FWCI
10.20
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: First-Order Transitions and the Performance of Quantum Algorithms in Random Optimization Problems. https://app.cochat.ai/papers/10.1103/physrevlett.104.207206
The paper
Jörg, T., Krzakala, F., Semerjian, G., & Zamponi, F. (2010). First-Order Transitions and the Performance of Quantum Algorithms in Random Optimization Problems. Physical Review Letters. https://doi.org/10.1103/physrevlett.104.207206

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.