The DOI matches its Crossref record; 95 of the 95 references it cites were found in a registry or an index.
Colloquium : Quantum annealing and analog quantum computation
Open accessAbstract
The recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced in successive steps through studying the mapping of such computationally hard problems to classical spin-glass problems, quantum spin-glass problems arising with the introduction of quantum fluctuations, and the annealing behavior of the systems as these fluctuations are reduced slowly to zero. This provides a general framework for realizing analog quantum computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
In the citing paper
“Mean field [85], DFT [86, 87], or DMFT [88], finally, have other limitations, e.g., they are essentially designed for weakly-correlated systems.”
From Can one trust quantum simulators? (2012) · cites this paper as [88]
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,450
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Spin glasses: Experimental facts, theoretical concepts, and open questions
Binder, K., & Young, A. P. (1986) · Reviews of Modern Physics · doi:10.1103/revmodphys.58.801 · Cited by 5,191
Topology of cosmic domains and strings
Kibble, T. W. B. (1976) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/9/8/029 · Cited by 4,626
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Edwards, S. F., & Anderson, P. W. (1975) · Journal of Physics F: Metal Physics · doi:10.1088/0305-4608/5/5/017 · Cited by 3,991
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Research works printed but not linked: 8
- 2005, Quantum Annealing and Related Optimization Methods
- Fu, Y., 1986, J. Phys. A, 19, 1620
- Hartmann, A., 2002, Optimization in Physics
- Hatano, N., 2005, Quantum Annealing and Related Optimization Methods
- Inoue, J.-I., 2005, Quantum Annealing and Related Optimization Methods
- Mezard, M., 1987, Spin Glass Theory and Beyond
- Rieger, H., 2005, Quantum Annealing and Related Optimization Methods
- Suzuki, S., 2005, Quantum Annealing and Related Optimization Methods
Cited by
Sorted by citations
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Microwave photonics with superconducting quantum circuits
Gu, X. Q., Kockum, A. F., Miranowicz, A., Liu, Y.-X., & Nori, F. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.002 · Cited by 1,337
Quantum information processing with superconducting circuits: a review
Wendin, G. P. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 1,022
Programmable quantum simulations of spin systems with trapped ions
Monroe, C. R., Campbell, W. C., Duan, L.-M., Gong, Z., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N. M., Pagano, G., et al. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025001 · Cited by 891
Metadata
- Authors
- Das, A., & Chakrabarti, B. K.
- Affiliations
- Saha Institute of Nuclear Physics (IN)
- Venue
- Reviews of Modern Physics
- Publisher
- American Physical Society (APS)
- Published
- 2008-09-05
- Volume
- 80
- Issue
- 3
- Pages
- 1061-1081
- ISSN
- 0034-6861 (ISSN-L)
- 1539-0756
- OpenAlex
- W174492123
- Cited by
- 700
- References
- 93
- Citations by year
- 2026: 40 · 2025: 72 · 2024: 54 · 2023: 60 · 2022: 64 · 2021: 62 · 2020: 52 · 2019: 44 · 2018: 44 · 2017: 34 · 2016: 45 · 2015: 34 · 2014: 22 · 2013: 12 · 2012: 19
- FWCI
- 22.16
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Reviews of Modern Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, other-oa)
- 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 many-body systems
- Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
- Keywords
- quantum annealing, quantum fluctuations, spin glass, quantum spin glass, combinatorial optimization, annealing behavior
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
