CoChat

Mathematical foundation of quantum annealing

Open access
Morita, Satoshi, Nishimori, Hidetoshi · 2008 · Journal of Mathematical Physics

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

Abstract

Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schrödinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schrödinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.

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.1063/1.2995837

Cites

49 of 49 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

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?

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 49 references

Research works printed but not linked: 7

  1. T. Kadowaki , “Study of optimization problems by quantum annealing,” PhD thesis, Tokyo Institute of Technology, 1999;
  2. A. Das and B. K.Chakrabarti , e-print arXiv:0801.2193; · arXiv
  3. Quantum Annealing and Analog Quantum Computation
  4. 2006, J. Stat. Mech.: Theory Exp., P01008
  5. E. Farhi, J. Goldstone, S. Gutomann, and M. Sipser, e-print arXiv:quant-ph/0001106. · arXiv
  6. 1976, Quantum Mechanics
  7. 1963, J. Math. Mech., 12, 683

Cited by

See all 381

Metadata

Authors
Morita, S., & Nishimori, H.
Affiliations
  • Scuola Internazionale Superiore di Studi Avanzati (IT)
  • Tokyo Institute of Technology (JP)
Venue
Journal of Mathematical Physics
Published
2008-12-01
Volume
49
Issue
12
ISSN
  • 0022-2488 (ISSN-L)
  • 1089-7658
OpenAlex
W2019013791
Cited by
381
References
50
Citations by year
2026: 24 · 2025: 61 · 2024: 55 · 2023: 43 · 2022: 36 · 2021: 32 · 2020: 18 · 2019: 22 · 2018: 15 · 2017: 14 · 2016: 11 · 2015: 17 · 2014: 6 · 2013: 5 · 2012: 8
FWCI
7.39
Type
journal article
Language
en
Open access
Locations
  • Journal of Mathematical Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum annealing, quantum adiabatic evolution, optimization problems, convergence conditions, Schrödinger dynamics, stochastic dynamics, Monte Carlo dynamics, annealing schedule, error reduction, simulated annealing

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: Mathematical foundation of quantum annealing. https://app.cochat.ai/papers/10.1063/1.2995837
The paper
Morita, S., & Nishimori, H. (2008). Mathematical foundation of quantum annealing. Journal of Mathematical Physics. https://doi.org/10.1063/1.2995837

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.