Cited by 115Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

A study of heuristic guesses for adiabatic quantum computation

Open access
Perdomo-Ortiz, Alejandro, Venegas-Andraca, Salvador E., Aspuru-Guzik, Alán·2011·Quantum Information Processing

Integrity signals

Registry

Crossref · 10.1007/s11128-010-0168-z

Cites

60 of 60 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Promising improvement strategies for QA comprise non-stoquastic Hamiltonians, spatially inhomogeneous driving of the transverse field, and reverse annealing.

    “Promising improvement strategies comprise non-stoquastic Hamiltonians [170], spatially inhomogeneous driving of the transverse field, and reverse annealing [205].”

Cites

Flagged first, then by citations

4 of the 64 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Perdomo-Ortiz, A., Venegas-Andraca, S. E., & Aspuru-Guzik, A.
Affiliations
Tecnológico de Monterrey (MX)
Venue
Quantum Information Processing
Published
2010-03-14
Volume
10
Issue
1
Pages
33-52
ISSN
  • 1570-0755 (ISSN-L)
  • 1573-1332
OpenAlex
W2078536001
Cited by
111
References
64
Citations by year
2026: 5 · 2025: 12 · 2024: 8 · 2023: 11 · 2022: 10 · 2021: 16 · 2020: 10 · 2019: 15 · 2018: 4 · 2017: 3 · 2016: 2 · 2015: 6 · 2014: 4 · 2013: 1
FWCI
1.69
Type
journal article
Language
en
Open access
Locations
  • Quantum Information Processing (publishedVersion)
  • Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
  • Greater South Information System
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
adiabatic quantum computation, 3-SAT, satisfiability, Hamming distance

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