Theory of Quantum Annealing of an Ising Spin Glass
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Probing the lowest energy configuration of a complex system by quantum annealing was recently found to be more effective than its classical, thermal counterpart. By comparing classical and quantum Monte Carlo annealing protocols on the two-dimensional random Ising model (a prototype spin glass), we confirm the superiority of quantum annealing relative to classical annealing. We also propose a theory of quantum annealing based on a cascade of Landau-Zener tunneling events. For both classical and quantum annealing, the residual energy after annealing is inversely proportional to a power of the logarithm of the annealing time, but the quantum case has a larger power that makes it faster.
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The adiabatic theorem of quantum mechanics ensures that QA identi fi es the optimal solution regardless of the size and landscape of the combinatorial parametric space, highlighting QA as a powerful and practical solver 11 -14 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [11]
Experimental — accuracy not yet measured
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
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
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
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Suzuki, M. (1976) · Progress of Theoretical Physics · doi:10.1143/ptp.56.1454 · Cited by 1,132
Ordering Energy Levels of Interacting Spin Systems
Lieb, E., & Mattis, D. (1962) · Journal of Mathematical Physics · doi:10.1063/1.1724276 · Cited by 882
Ordered Phase of Short-Range Ising Spin-Glasses
Fisher, D. S., & Huse, D. A. (1986) · Physical Review Letters · doi:10.1103/physrevlett.56.1601 · Cited by 806
Quantum annealing: A new method for minimizing multidimensional functions
Finnila, A. B., Gomez, M. A., Sebenik, C., Stenson, C., & Doll, J. D. (1994) · Chemical Physics Letters · doi:10.1016/0009-2614(94)00117-0 · Cited by 644
Quantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Research works printed but not linked: 2
- Supplementary details of the method are available on Science Online at www.sciencemag.org/cgi/content/full/295/5564/2427/DC1.
- L. D. Landau E. M. Lifshitz Quantum Mechanics—Non-Relativistic Theory (Pergamon Oxford 1977).
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Meeting the Clean Energy Demand: Nanostructure Architectures for Solar Energy Conversion
Kamat, P. V. (2007) · The Journal of Physical Chemistry C · doi:10.1021/jp066952u · Cited by 2,249
Robel, I., Subramanian, V., Kuno, M., & Kamat, P. V. (2006) · Journal of the American Chemical Society · doi:10.1021/ja056494n · Cited by 1,762
General Route to Vertical ZnO Nanowire Arrays Using Textured ZnO Seeds
Greene, L. E., Law, M., Tan, D. H., Montano, M., Goldberger, J., Somorjai, G., & Yang, P. (2005) · Nano Letters · doi:10.1021/nl050788p · Cited by 1,442
Fluorescence Resonance Energy Transfer Between Quantum Dot Donors and Dye-Labeled Protein Acceptors
Clapp, A. R., Medintz, I. L., Mauro, J. M., Fisher, B. R., Bawendi, M. G., & Mattoussi, H. (2004) · Journal of the American Chemical Society · doi:10.1021/ja037088b · Cited by 1,302
Designing PbSe Nanowires and Nanorings through Oriented Attachment of Nanoparticles
Cho, K.-S., Talapin, D. V., Gaschler, W., & Murray, C. B. (2005) · Journal of the American Chemical Society · doi:10.1021/ja050107s · Cited by 1,215
Kline, R. J., McGehee, M. D., Kadnikova, E. N., Liu, J., Fréchet, J. M. J., & Toney, M. F. (2005) · Macromolecules · doi:10.1021/ma047415f · Cited by 1,072
Luminscent Graphene Quantum Dots for Organic Photovoltaic Devices
Gupta, V., Chaudhary, N., Srivastava, R., Sharma, G. D., Bhardwaj, R., & Chand, S. (2011) · Journal of the American Chemical Society · doi:10.1021/ja2036749 · Cited by 946
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
“[11], we also observe that the simulated quantum annealer here scales slightly worse than the simulated classical annealer.”
BackgroundMethodInfluentialGregg, B. A. (2003) · The Journal of Physical Chemistry B · doi:10.1021/jp022507x · Cited by 790
Colloquium : 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
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Phase space representation of quantum dynamics
Polkovnikov, A. (2010) · Annals of Physics · doi:10.1016/j.aop.2010.02.006 · Cited by 595
Zhao, J., Bardecker, J. A., Munro, A. M., Liu, M. S., Niu, Y., Ding, I.-K., Luo, J., Chen, B., Jen, A. K.-Y., & Ginger, D. S. (2006) · Nano Letters · doi:10.1021/nl052417e · Cited by 553
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
Marandi, A., Wang, Z., Takata, K., Byer, R. L., & Yamamoto, Y. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.249 · Cited by 541
Optimal Control at the Quantum Speed Limit
Caneva, T., Murphy, M., Calarco, T., Fazio, R., Montangero, S., Giovannetti, V., & Santoro, G. E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.240501 · Cited by 509
Self-citationPerspectives 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
Structural Characterization of Self-Assembled Multifunctional Binary Nanoparticle Superlattices
Shevchenko, E. V., Talapin, D. V., Murray, C. B., & O'Brien, S. (2006) · Journal of the American Chemical Society · doi:10.1021/ja0564261 · Cited by 501
Visible Light-Induced Charge Retention and Photocatalysis with Hybrid CdSe−Au Nanodumbbells
Costi, R., Saunders, A. E., Elmalem, E., Salant, A., & Banin, U. (2008) · Nano Letters · doi:10.1021/nl0730514 · Cited by 478
Photovoltaic Cells Using Composite Nanoclusters of Porphyrins and Fullerenes with Gold Nanoparticles
Hasobe, T., Imahori, H., Kamat, P. V., Ahn, T. K., Kim, S. K., Kim, D., Fujimoto, A., Hirakawa, T., & Fukuzumi, S. (2005) · Journal of the American Chemical Society · doi:10.1021/ja047768u · Cited by 459
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457
Gur, I., Fromer, N. A., Chen, C.-P., Kanaras, A. G., & Alivisatos, A. P. (2007) · Nano Letters · doi:10.1021/nl062660t · Cited by 451
ZnO−TiO2 Core−Shell Nanorod/P3HT Solar Cells
Greene, L. E., Law, M., Yuhas, B. D., & Yang, P. (2007) · The Journal of Physical Chemistry C · doi:10.1021/jp077593l · Cited by 451
Castro, S. L., Bailey, S. G., Raffaelle, R. P., Banger, K. K., & Hepp, A. F. (2004) · The Journal of Physical Chemistry B · doi:10.1021/jp049107p · Cited by 434
Liu, H., Owen, J. S., & Alivisatos, A. P. (2007) · Journal of the American Chemical Society · doi:10.1021/ja0656696 · Cited by 420
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
“Moreover, [11,29,32] showed that adiabatic computation can ‘tunnel’ through wide energy barriers and thus outperform simulated annealing, a classical counterpart of the adiabatic model.”
BackgroundCoherent Ising machine based on degenerate optical parametric oscillators
Wang, Z., Marandi, A., Wen, K., Byer, R. L., & Yamamoto, Y. (2013) · Physical Review A · doi:10.1103/physreva.88.063853 · Cited by 391
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381
Shape-Controlled Synthesis and Shape-Induced Texture of MnFe 2 O 4 Nanoparticles
Zeng, H., Rice, P. M., Wang, S. X., & Sun, S. (2004) · Journal of the American Chemical Society · doi:10.1021/ja045911d · Cited by 369
Finding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366
Optimization 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
Self-citationHamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2019) · Science Advances · doi:10.1126/sciadv.aau0823 · Cited by 328
Narayanaswamy, A., Xu, H., Pradhan, N., Kim, M., & Peng, X. (2006) · Journal of the American Chemical Society · doi:10.1021/ja0627601 · Cited by 307
Experimental signature of programmable quantum annealing
Boixo, S., Albash, T., Spedalieri, F. M., Chancellor, N., & Lidar, D. A. (2013) · Nature Communications · doi:10.1038/ncomms3067 · Cited by 293
Regioregular Copolymers of 3-Alkoxythiophene and Their Photovoltaic Application
Shi, C., Yao, Y., Yang, & Pei, Q. (2006) · Journal of the American Chemical Society · doi:10.1021/ja061664x · Cited by 288
Synthesis of Platinum Multipods: An Induced Anisotropic Growth
Teng, X., & Yang, H. (2005) · Nano Letters · doi:10.1021/nl0503072 · Cited by 279
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R., Johnson, M. W., Lanting, T., Berkley, A. J., Johansson, J., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Ladizinsky, N., Oh, T., et al. (2010) · Physical Review B · doi:10.1103/physrevb.82.024511 · Cited by 273
A quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
Quantum critical dynamics in a 5,000-qubit programmable spin glass
King, A. D., Raymond, J., Lanting, T., Harris, R., Zucca, A., Altomare, F., Berkley, A. J., Boothby, K., Ejtemaee, S., Enderud, C., et al. (2023) · Nature · doi:10.1038/s41586-023-05867-2 · Cited by 242
High-performance combinatorial optimization based on classical mechanics
Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., & Tatsumura, K. (2021) · Science Advances · doi:10.1126/sciadv.abe7953 · Cited by 231
Quantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209
“While the founding principles of the technique have been investigated numerically [3], analytically [4,5], and experimentally [6] in the past decade, the disordered, interacting, time-dependent, and open nature of the many-body problem makes it very hard to draw universal conclusions about the power of the technique […”
BackgroundLi, R. Y., Di Felice, R., Rohs, R., & Lidar, D. A. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0060-8 · Cited by 202
“[49]), (iii) simulated quantum annealing [50] (SQA), a classical algorithm that can represent the potential of a noiseless thermal quantum annealer, (iv) L 2 regularized multiple linear regression (MLR), (v) Lasso [51] and (vi) a scalable machine learning tool known as XGBoost (XGB) [52].”
MethodDemonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238
“2, where we compare the DW2KQ results to three classical algorithms: SA with single-spin updates [36], SQA based on the discrete-time path-integral quantum Monte Carlo algorithm [37], and the SVMC algorithm [38].”
MethodEntanglement in a Quantum Annealing Processor
Lanting, T., Przybysz, A. J., Smirnov, A. Y., Spedalieri, F. M., Amin, M. H., Berkley, A. J., Harris, R., Altomare, F., Boixo, S., Bunyk, P., et al. (2014) · Physical Review X · doi:10.1103/physrevx.4.021041 · Cited by 195
“A wide variety of optimization problems naturally map onto this physical system [19–22].”
BackgroundExperimental demonstration of a robust and scalable flux qubit
Harris, R., Johansson, J., Berkley, A. J., Johnson, M. W., Lanting, T., Han, S., Bunyk, P., Ladizinsky, E., Oh, T., Perminov, I., et al. (2010) · Physical Review B · doi:10.1103/physrevb.81.134510 · Cited by 177
Quantum Speedup by Quantum Annealing
Somma, R. D., Nagaj, D., & Kieferová, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050501 · Cited by 176
Multiple Wurtzite Twinning in CdTe Nanocrystals Induced by Methylphosphonic Acid
Carbone, L., Kudera, S., Carlino, E., Parak, W. J., Giannini, C., Cingolani, R., & Manna, L. (2006) · Journal of the American Chemical Society · doi:10.1021/ja054893c · Cited by 158
Quantum Annealing for Constrained Optimization
Hen, I., & Spedalieri, F. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.5.034007 · Cited by 114
“One of the more novel approaches to optimization is that of Quantum annealing (QA) [2–6], a technique that utilizes gradually decreasing quantum fluctuations to traverse the barriers in the energy landscape in search of global minima of complicated cost functions.”
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
Benchmarking Quantum Annealing Controls with Portfolio Optimization
Grant, E., Humble, T. S., & Stump, B. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014012 · Cited by 90
Quantum Approach to Classical Statistical Mechanics
Somma, R. D., Batista, C. D., & Ortiz, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.030603 · Cited by 87
A deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
Reinforcement-learning-assisted quantum optimization
Wauters, M. M., Panizon, E., Mbeng, G. B., & Santoro, G. E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033446 · Cited by 80
Self-citationClassical variational simulation of the Quantum Approximate Optimization Algorithm
Medvidović, M., & Carleo, G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00440-z · Cited by 79
Mandrà, S., Zhu, Z., & Katzgraber, H. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.070502 · Cited by 72
Optimization by Self-Organized Criticality
Hoffmann, H., & Payton, D. W. (2018) · Scientific Reports · doi:10.1038/s41598-018-20275-7 · Cited by 65
Readiness of Quantum Optimization Machines for Industrial Applications
Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S. V., Zhu, Z., O’Gorman, B., Katzgraber, H. G., Diedrich, A., Neven, H., de Kleer, J., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.014004 · Cited by 62
“This scaling advantage already yields a difference of approximately 6 orders of magnitude on a single-core CPU in the TTS between DW2X and SA/C for the largest problem studied (mult[4-4]).”
Reinforcement Quantum Annealing: A Hybrid Quantum Learning Automata
Ayanzadeh, R., Halem, M., & Finin, T. (2020) · Scientific Reports · doi:10.1038/s41598-020-64078-1 · Cited by 57
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“The adiabatic theorem of quantum mechanics ensures that QA identi fi es the optimal solution regardless of the size and landscape of the combinatorial parametric space, highlighting QA as a powerful and practical solver 11 – 14 .”
On the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
“In the 1990s, an optimization algorithm called quantum annealing (QA) was proposed with the aim of providing a fast heuristic for solving combinatorial optimization problems [44, 68, 26, 23, 71].”
Hybrid Quantum Annealing for Larger-than-QPU Lattice-structured Problems
Raymond, J., Stevanovic, R., Bernoudy, W., Boothby, K., McGeoch, C. C., Berkley, A. J., Farré, P., Pasvolsky, J., & King, A. D. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3579368 · Cited by 39
“Thermal and quantum evolution-based heuristics such as SA and QA can perform well in spin glasses relative to other heuristics and exact methods, with experimental and theoretical work indicating quantum mechanisms that may bestow some advantages to QA [9, 23, 28, 41, 43].”
Two-parameter counter-diabatic driving in quantum annealing
Prielinger, L., Hartmann, A., Yamashiro, Y., Nishimura, K., Lechner, W., & Nishimori, H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013227 · Cited by 39
Benchmark Test of Black-box Optimization Using D-Wave Quantum Annealer
Koshikawa, A. S., Ohzeki, M., Kadowaki, T., & Tanaka, K. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.064001 · Cited by 43
Fair sampling of ground-state configurations of binary optimization problems
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2019) · Physical Review E · doi:10.1103/physreve.99.063314 · Cited by 17
Bass, G., Tomlin, C., Kumar, V., Rihaczek, P., & Dulny, J. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaadc2 · Cited by 16
Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2024) · arXiv · doi:10.48550/arxiv.2402.17667 · Cited by 3
Non-classical role of potential energy in adiabatic quantum annealing
Das, A. (2009) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/143/1/012001 · Cited by 2
Metadata
- Authors
- Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R.
- Affiliations
- Scuola Internazionale Superiore di Studi Avanzati (IT)
- Swiss Centre for Scientific Computing, CH-6928 Manno, Switzerland, and Department of Physical Chemistry, ETH-Zürich, CH-8093 Zürich, Switzerland.
- The Abdus Salam International Centre for Theoretical Physics (ICTP) (IT)
- Princeton University (US)
- Corresponding author
- Tosatti, Erio
- Venue
- Science
- Published
- 2002-03-29
- Volume
- 295
- Issue
- 5564
- Pages
- 2427-2430
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2007473024
- Semantic Scholar
- f19cee6e5ad555d4cc414aac3a09fa34bb8fabde
- Cited by
- 734
- References
- 21
- Citations by year
- 2026: 25 · 2025: 44 · 2024: 33 · 2023: 34 · 2022: 43 · 2021: 62 · 2020: 41 · 2019: 47 · 2018: 36 · 2017: 35 · 2016: 38 · 2015: 38 · 2014: 27 · 2013: 12 · 2012: 19
- FWCI
- 23.03
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- SDL (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, Ising spin glass, random Ising model, Landau-Zener tunneling, residual energy, ground state search
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
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.