English

Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension

Disordered Systems and Neural Networks 2015-08-18 v2 Quantum Physics

Abstract

Spin systems with frustration and disorder are notoriously difficult to study both analytically and numerically. While the simulation of ferromagnetic statistical mechanical models benefits greatly from cluster algorithms, these accelerated dynamics methods remain elusive for generic spin-glass-like systems. Here we present a cluster algorithm for Ising spin glasses that works in any space dimension and speeds up thermalization by at least one order of magnitude at temperatures where thermalization is typically difficult. Our isoenergetic cluster moves are based on the Houdayer cluster algorithm for two-dimensional spin glasses and lead to a speedup over conventional state-of-the-art methods that increases with the system size. We illustrate the benefits of the isoenergetic cluster moves in two and three space dimensions, as well as the nonplanar chimera topology found in the D-Wave Inc.~quantum annealing machine.

Keywords

Cite

@article{arxiv.1501.05630,
  title  = {Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension},
  author = {Zheng Zhu and Andrew J. Ochoa and Helmut G. Katzgraber},
  journal= {arXiv preprint arXiv:1501.05630},
  year   = {2015}
}

Comments

5 pages, 4 figures

R2 v1 2026-06-22T08:10:18.948Z