Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Phase analysis of Ising machines and their implications on optimization

Shu Zhou1, K. Y. Michael Wong1,*, Juntao Wang1,2, David Shui Wing Hui2, Daniel Ebler2,†, and Jie Sun2,‡

  • *Contact author: phkywong@ust.hk
  • †Contact author: ebler.daniel1@huawei.com
  • ‡Contact author: j.sun@huawei.com

Phys. Rev. Research 8, 033147 – Published 6 August, 2026

DOI: https://doi.org/10.1103/y38h-f27q

Abstract

Ising machines, which are dynamical systems designed to operate in a parallel and iterative manner, have emerged as a paradigm for solving combinatorial optimization problems. Despite computational advantages, the quality of solutions depends heavily on the form of dynamics and tuning of parameters, which are, in general, set heuristically due to the lack of systematic insights. Here, we focus on optimal Ising machine design by analyzing phase diagrams of spin distributions in the Sherrington-Kirkpatrick model. We find that the ground state can be achieved in the phase where the spin distribution becomes binary, and optimal solutions are produced where the binary phase and gapless phase coexist. Our analysis shows that such coexistence phase region can be expanded by carefully placing a digitization operation, giving rise to a family of superior Ising machines, as illustrated by the proposed algorithm digCIM.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (66)

  1. K. Ooka and M. Arai, Accurate prediction of protein folding mechanisms by simple structure-based statistical mechanical models, Nat. Commun. 14, 6338 (2023).
  2. S. Bao, M. Tawada, S. Tanaka, and N. Togawa, Multi-day travel planning using Ising machines for real-world applications, in 2021 IEEE International Intelligent Transportation Systems Conference (ITSC) (IEEE, Piscataway, NJ, USA, 2021), pp. 3704–3709.
  3. M. V. LeVine and H. Weinstein, Aim for allostery: Using the Ising model to understand information processing and transmission in allosteric biomolecular systems, Entropy 17, 2895 (2015).
  4. J. D. Bryngelson and P. G. Wolynes, Spin glasses and the statistical mechanics of protein folding, Proc. Natl. Acad. Sci. USA 84, 7524 (1987).
  5. A. Lucas, Ising formulations of many NP problems, Front. Phys. 2, 5 (2014).
  6. S. Brush, History of the Lenz-Ising model, Rev. Mod. Phys. 39, 883 (1967).
  7. F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A: Math. Gen. 15, 3241 (1982).
  8. S. Arora, E. Berger, E. Hazan, G. Kindler, and M. Safra, On non-approximability for quadratic programs, in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05) (IEEE Computer Society Press, Los Alamitos, CA, USA, 2005), pp. 206–215.
  9. When xi=0, the decoding rules are not well defined. In such cases, an arbitrary sign is assigned.
  10. N. Mohseni, P. L. McMahon, and T. Byrnes, Ising machines as hardware solvers of combinatorial optimization problems, Nat. Rev. Phys. 4, 363 (2022).
  11. T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58, 5355 (1998).
  12. M. Johnson, M. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. Berkley, J. Johansson, P. Bunyk, E. Chapple, C. Enderud, J. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, and G. Rose, Quantum annealing with manufactured spins, Nature (London) 473, 194 (2011).
  13. S. Boixo, T. F. Rønnow, S. Isakov, Z. Wang, D. Wecker, D. Lidar, J. Martinis, and M. Troyer, Evidence for quantum annealing with more than one hundred qubits, Nat. Phys. 10, 218 (2014).
  14. P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Perspectives of quantum annealing: Methods and implementations, Rep. Prog. Phys. 83, 054401 (2020).
  15. A. Marandi, Z. Wang, K. Takata, R. Byer, and Y. Yamamoto, Network of time-multiplexed optical parametric oscillators as a coherent Ising machine, Nat. Photonics 8, 937 (2014).
  16. Y. Yamamoto, K. Aihara, T. Leleu, K.-i. Kawarabayashi, S. Kako, M. Fejer, K. Inoue, and H. Takesue, Coherent Ising machines—Optical neural networks operating at the quantum limit, npj Quantum Inf. 3, 49 (2017).
  17. Z. Wang, A. Marandi, K. Wen, R. L. Byer, and Y. Yamamoto, A coherent Ising machine based on degenerate optical parametric oscillators, Phys. Rev. A 88, 063853 (2013).
  18. J. Chou, S. Bramhavar, S. Ghosh, and W. Herzog, Analog coupled oscillator based weighted Ising machine, Sci. Rep. 9, 14786 (2019).
  19. Y. Zhang, Y. Deng, Y. Lin, Y. Jiang, Y. Dong, X. Chen, G. Wang, D. S. Shang, Q. Wang, H. Yu, and Z. Wang, Oscillator-network-based Ising machine, Micromachines 13, 1016 (2022).
  20. Y. Salathé, M. Mondal, M. Oppliger, J. Heinsoo, P. Kurpiers, A. Potočnik, A. Mezzacapo, U. Las Heras, L. Lamata, E. Solano, S. Filipp, and A. Wallraff, Digital quantum simulation of spin models with circuit quantum electrodynamics, Phys. Rev. X 5, 021027 (2015).
  21. M. Yamaoka, C. Yoshimura, M. Hayashi, T. Okuyama, H. Aoki, and H. Mizuno, A 20k-spin Ising chip to solve combinatorial optimization problems with CMOS annealing, IEEE J. Solid-State Circuits 51, 303 (2015).
  22. M. Aramon, G. Rosenberg, E. Valiante, T. Miyazawa, H. Tamura, and H. Katzgraber, Physics-inspired optimization for quadratic unconstrained problems using a digital annealer, Front. Phys. 7, 48 (2019).
  23. K. Yamamoto, K. Kawamura, K. Ando, N. Mertig, T. Takemoto, M. Yamaoka, H. Teramoto, A. Sakai, S. Takamaeda-Yamazaki, and M. Motomura, Statica: A 512-spin 0.25 m-weight annealing processor with an all-spin-updates-at-once architecture for combinatorial optimization with complete spin-spin interactions, IEEE J. Solid-State Circuits 56, 165 (2020).
  24. T. Leleu, F. Khoyratee, T. Levi, R. Hamerly, T. Kohno, and K. Aihara, Scaling advantage of chaotic amplitude control for high-performance combinatorial optimization, Commun. phys. 4, 266 (2021).
  25. T. Inagaki, Y. Haribara, K. Igarashi, T. Sonobe, S. Tamate, T. Honjo, A. Marandi, P. McMahon, T. Umeki, K. Enbutsu, O. Tadanaga, H. Takenouchi, K. Aihara, K.-i. Kawarabayashi, K. Inoue, S. Utsunomiya, and H. Takesue, A coherent Ising machine for 2000-node optimization problems, Science 354, 603 (2016).
  26. T. Honjo, T. Sonobe, K. Inaba, T. Inagaki, T. Ikuta, Y. Yamada, T. Kazama, K. Enbutsu, T. Umeki, R. Kasahara, K. Kawarabayashi, and H. Takesue, 100,000-spin coherent Ising machine, Sci. Adv. 7, eabh0952 (2021).
  27. F. Böhm, T. Vaerenbergh, G. Verschaffelt, and G. Van der Sande, Order-of-magnitude differences in computational performance of analog Ising machines induced by the choice of nonlinearity, Commun. phys. 4, 149 (2021).
  28. E. S. Tiunov, A. E. Ulanov, and A. I. Lvovsky, Annealing by simulating the coherent Ising machine, Opt. Express 27, 10288 (2019).
  29. H. Goto, K. Endo, M. Suzuki, Y. Sakai, T. Kanao, Y. Hamakawa, R. Hidaka, M. Yamasaki, and K. Tatsumura, High-performance combinatorial optimization based on classical mechanics, Sci. Adv. 7, eabe7953 (2021).
  30. D. Sherrington and S. Kirkpatrick, Solvable model of a spin-glass, Phys. Rev. Lett. 35, 1792 (1975).
  31. S. Kirkpatrick and D. Sherrington, Frustration and ground-state degeneracy in spin glasses, Phys. Rev. B 16, 4630 (1977).
  32. D. J. Thouless, P. W. Anderson, and R. G. Palmer, Solution of ‘solvable model of a spin glass’, Philos. Mag. 35, 593 (1977).
  33. M. Mezard, G. Parisi, and M. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1987).
  34. A. Yamamura, H. Mabuchi, and S. Ganguli, Geometric landscape annealing as an optimization principle underlying the coherent Ising machine, Phys. Rev. X 14, 031054 (2024).
  35. See Supplemental Material at http://link.aps.org/supplemental/10.1103/y38h-f27q for detailed derivations of the replica saddle-point equations, stability analyses, phase diagrams, benchmark details, and scaling tests, which includes Refs.  [36, 37, 38].
  36. J. R. L. de Almeida and D. J. Thouless, Stability of the Sherrington-Kirkpatrick solution of a spin glass model, J. Phys. A: Math. Gen. 11, 983 (1978).
  37. M. Palassini, Ground-state energy fluctuations in the Sherrington–Kirkpatrick model, J. Stat. Mech. (2008) P10005.
  38. T. Aspelmeier, A. Billoire, E. Marinari, and M. Moore, Finite size corrections in the Sherrington-Kirkpatrick model, J. Phys. A: Math. Theor. 41, 324008 (2008).
  39. M. Opper and D. Saad, Advanced Mean Field Methods: Theory and Practice (MIT Press, Cambridge, 2001).
  40. H. Horner, Time dependent local field distribution and metastable states in the SK-spin glass, Eur. Phys. J. B 60, 413 (2007).
  41. H. J. Sommers and W. Dupont, Distribution of frozen fields in the mean-field theory of spin glasses, J. Phys. C: Solid State Phys. 17, 5785 (1984).
  42. M. Potters and J.-P. Bouchaud, A First Course in Random Matrix Theory: For Physicists, Engineers and Data Scientists (Cambridge University Press, Cambridge, UK, 2020).
  43. J. Wang, D. Ebler, K. Y. M. Wong, D. S. W. Hui, and J. Sun, Bifurcation behaviors shape how continuous physical dynamics solves discrete Ising optimization, Nat. Commun. 14, 2510 (2023).
  44. T. Leleu, Y. Yamamoto, P. L. McMahon, and K. Aihara, Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity, Phys. Rev. Lett. 122, 040607 (2019).
  45. G. Parisi, The order parameter for spin glasses: A function on the interval 0–1, J. Phys. A: Math. Gen. 13, 1101 (1980).
  46. T. Leleu, Y. Yamamoto, S. Utsunomiya, and K. Aihara, Combinatorial optimization using dynamical phase transitions in driven-dissipative systems, Phys. Rev. E 95, 022118 (2017).
  47. F. Böhm, G. Verschaffelt, and G. Van der Sande, A poor man’s coherent Ising machine based on opto-electronic feedback systems for solving optimization problems, Nat. Commun. 10, 3538 (2019).
  48. A. Braunstein, M. Mézard, and R. Zecchina, Survey propagation: An algorithm for satisfiability, Random Struct. Algorithms 27, 201 (2005).
  49. A. Montanari, F. Ricci-Tersenghi, and G. Semerjian, Solving constraint satisfaction problems through belief propagation-guided decimation, in Proceedings of the 45th Annual Allerton Conference on Communication, Control, and Computing (University of Illinois at Urbana-Champaign, Urbana, IL, USA, 2007), pp. 352–359.
  50. F. Ricci-Tersenghi and G. Semerjian, On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms, J. Stat. Mech. (2009) P09001.
  51. S. Higuchi and M. Mézard, Decimation flows in constraint satisfaction problems, J. Stat. Mech. (2009) P12009.
  52. H. Huang, J. Raymond, and K. Y. M. Wong, The network source location problem: Ground state energy, entropy and effects of freezing, J. Stat. Phys. 156, 301 (2014).
  53. J. Chavas, C. Furtlehner, M. Mézard, and R. Zecchina, Survey-propagation decimation through distributed local computations, J. Stat. Mech. (2005) P11016.
  54. L. Dall'Asta, A. Ramezanpour, and R. Zecchina, Entropy landscape and non-Gibbs solutions in constraint satisfaction problems, Phys. Rev. E 77, 031118 (2008).
  55. L. Zdeborova and M. Mezard, Constraint satisfaction problems with isolated solutions are hard, J. Stat. Mech. (2008) P12004.
  56. K. Y. Michael Wong and H. Nishimori, Error-correcting codes and image restoration with multiple stages of dynamics, Phys. Rev. E 62, 179 (2000).
  57. M. J. Schmidt, Replica Symmetry Breaking at Low Temperatures (Julius-Maximilians-Universität Würzburg, Würzburg, Germany, 2008).
  58. A. Crisanti and T. Rizzo, Analysis of the ∞-replica symmetry breaking solution of the Sherrington-Kirkpatrick model, Phys. Rev. E 65, 046137 (2002).
  59. S. Y. Kim, S. Y. Lee, and J. Lee, Ground-state energy and energy landscape of the Sherrington-Kirkpatrick spin glass, Phys. Rev. B 76, 184412 (2007).
  60. S. Boettcher, Extremal optimization for Sherrington-Kirkpatrick spin glasses, Eur. Phys. J. B 46, 501 (2005).
  61. S. Zhou, K. Y. M. Wong, J. Wang, D. S. W. Hui, D. Ebler, and J. Sun, Optimality and annealing path planning of dynamical analog solvers, arXiv:2603.13778.
  62. S. Boettcher, H. Katzgraber, and D. Sherrington, Local field distributions in spin glasses, J. Phys. A: Math. Theor. 41, 324007 (2008).
  63. Y. Haribara, H. Ishikawa, S. Utsunomiya, K. Aihara, and Y. Yamamoto, Performance evaluation of coherent Ising machines against classical neural networks, Quantum Sci. Technol. 2, 044002 (2017).
  64. Y. Ye, The Gset dataset, 2003, https://web.stanford.edu/%7Eyyye/yyye/Gset/.
  65. H. D. Mittelmann, Nonconvex QUBO-QPLIB benchmark, 2024, https://plato.asu.edu/ftp/qubo.html.
  66. F. Furini, E. Traversi, P. Belotti, A. Frangioni, A. Gleixner, N. Gould, L. Liberti, A. Lodi, R. Misener, H. Mittelmann, N. V. Sahinidis, S. Vigerske, and A. Wiegele, QPLIB: A library of quadratic programming instances, Math. Program. Comput. 11, 237 (2019).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation