Optimization by quantum annealing: Lessons from hard satisfiability problems
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The path integral Monte Carlo simulated quantum annealing algorithm is applied to the optimization of a large hard instance of the random satisfiability problem (N = 10,000). The dynamical behavior of the quantum and the classical annealing are compared, showing important qualitative differences in the way of exploring the complex energy landscape of the combinatorial optimization problem. At variance with the results obtained for the Ising spin glass and for the traveling salesman problem, in the present case the linear-schedule quantum annealing performance is definitely worse than classical annealing. Nevertheless, a quantum cooling protocol based on field-cycling and able to outperform standard classical simulated annealing over short time scales is introduced.
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
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
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
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: 34
- M. Nielsen, 2000, Quantum Computation and Quantum Information
- 10.1103/PhysRevA.57.2403 · DOI · Paper page
- 10.1016/0009-2614(94)00117-0 · DOI · Paper page
- 10.1126/science.1068774 · DOI · Paper page
- 10.1103/PhysRevB.66.094203 · DOI
- 10.1103/PhysRevE.70.057701 · DOI · Paper page
- 10.1126/science.220.4598.671 · DOI · Paper page
- W. Van Dam, 2001, Proceedings of the 42nd Annual Symposium on Foundations of Computer Science
- M. R. Garey, 1979, Computers and Intractability
- J.-P. Bouchaud, 1997, Spin Glasses and Random Fields
- 10.1103/PhysRevB.65.024439 · DOI
- 10.1103/PhysRevE.70.036107 · DOI
- 10.1088/0305-4470/37/6/008 · DOI
- S. A. Cook, 1971, Proc. of the Third Annual ACM Symposium on the Theory of Computing
- T. Larrabee, 1992, IEEE Trans. Comput.-Aided Des., 11, 6, 10.1109/43.108614 · DOI · Paper page
- 10.1007/BF01581082 · DOI
- 10.1126/science.1073287 · DOI · Paper page
- 10.1103/PhysRevE.66.056126 · DOI · Paper page
- G. Parisi, 1987, Spin Glass Theory and Beyond
- I. Gent, 1994, Proceedings of ECAI-94
- E. Aarts, 1989, Simulated Annealing and Boltzmann Machines
- R. H. Otten, 1989, The Annealing Algorithm, 10.1007/978-1-4613-1627-5 · DOI · Paper page
- 10.1143/PTP.56.1454 · DOI · Paper page
- B. K. Chakrabarti, 1996, Quantum Ising Phases and Transitions in Transverse Ising Models, 10.1007/978-3-540-49865-0 · DOI · Paper page
- 10.1103/PhysRevB.34.7896 · doi:10.1103/physrevb.34.7896
- N. Trivedi, 1989, Phys. Rev. B, 40, R2737, 10.1103/PhysRevB.40.2737 · DOI
- 10.1023/A:1004570713967 · DOI
- J. R. Koza, 1992, Genetic Programming: On the Programming of Computers by Means of Natural Selection
- J. H. Holland, 1962, Proc. Int. Un. Physiol. Soc., 3, 330
- 10.1103/PhysRevLett.88.178701 · doi:10.1103/physrevlett.88.178701
- J. H. Holland, 1971, Associative Information Processing
- H. Kleinert, 1995, Path Integrals in Quantum Mechanics, Statistics and Polymer Physics, 10.1142/1081 · doi:10.1142/1081
- 10.1109/TSMC.1980.4308561 · doi:10.1109/tsmc.1980.4308561
- 10.1021/jp991868i · DOI
Cited by
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
“A similar behavior has previously been reported for k-satisfiablity problems [27].”
BackgroundColloquium : 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
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
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-citationApplication of Ising Machines and a Software Development for Ising Machines
Tanahashi, K., Takayanagi, S., Motohashi, T., & Tanaka, S. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061010 · Cited by 142
Metadata
- Authors
- Battaglia, D. A., Santoro, G. E., & Tosatti, E.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-06-29
- Volume
- 71
- Issue
- 6
- Pages
- 066707-066707
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1990115083
- Cited by
- 106
- References
- 4
- FWCI
- 4.47
- Type
- journal article
- Language
- en
- Open access
- green
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: Optimization by quantum annealing: Lessons from hard satisfiability problems. https://app.cochat.ai/papers/10.1103/physreve.71.066707
- The paper
- Battaglia, D. A., Santoro, G. E., & Tosatti, E. (2005). Optimization by quantum annealing: Lessons from hard satisfiability problems. Physical Review E. https://doi.org/10.1103/physreve.71.066707
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.