Ground-state statistics from annealing algorithms: quantum versus classical approaches
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
We study the performance of quantum annealing for systems with ground-state degeneracy by directly solving the Schrödinger equation for small systems and quantum Monte Carlo simulations for larger systems. The results indicate that naive quantum annealing using a transverse field may not be well suited to identify all degenerate ground-state configurations, although the value of the ground-state energy is often efficiently estimated. An introduction of quantum transitions to all states with equal weights is shown to greatly improve the situation, but with a sacrifice in annealing time. We also clarify the relation between the spin configurations in degenerate ground states and the probabilities that those states are obtained by quantum annealing. The strengths and weaknesses of quantum annealing for problems with degenerate ground states are discussed in comparison with classical simulated annealing.
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 annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
Self-citationColloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381
Self-citationOptimization using quantum mechanics: quantum annealing through adiabatic evolution
Santoro, G. E., & Tosatti, E. (2006) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/39/36/r01 · Cited by 354
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Self-citationChallenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“Hence, quantum annealing research tends to focus on empirical studies of the behaviour of the algorithm in ideal 47 and noisy computational settings 48,49 .”
Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02346-0 · Cited by 96
A coherent quantum annealer with Rydberg atoms
Glaetzle, A. W., van Bijnen, R. M. W., Zoller, P., & Lechner, W. (2017) · Nature Communications · doi:10.1038/ncomms15813 · Cited by 91
Metadata
- Authors
- Matsuda, Y., Nishimori, H., & Katzgraber, H. G.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2009-07-09
- Volume
- 11
- Issue
- 7
- Pages
- 073021
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2023905462
- Cited by
- 74
- References
- 5
- FWCI
- 3.98
- Type
- journal article
- Language
- en
- Open access
- gold
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: Ground-state statistics from annealing algorithms: quantum versus classical approaches. https://app.cochat.ai/papers/10.1088/1367-2630/11/7/073021
- The paper
- Matsuda, Y., Nishimori, H., & Katzgraber, H. G. (2009). Ground-state statistics from annealing algorithms: quantum versus classical approaches. New Journal of Physics. https://doi.org/10.1088/1367-2630/11/7/073021
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.