Optimised simulated annealing for Ising spin glasses

Published: 01-01-2015| Version 1 | DOI: 10.17632/y5nybjdshn.1
S.V. Isakov,
I.N. Zintchenko,
T.F. Rønnow,
M. Troyer


This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract We present several efficient implementations of the simulated annealing algorithm for Ising spin glasses on sparse graphs. In particular, we provide a generic code for any choice of couplings, an optimised code for bipartite graphs, and highly optimised implementations using multi-spin coding for graphs with small maximum degree and discrete couplings with a finite range. The latter codes achieve up to 50 spin flips per nanosecond on modern Intel CPUs. We also compare the performance of the c... Title of program: SimAn v1.0 Catalogue Id: AEVZ_v1_0 Nature of problem Ising spin glass ground states on sparse graphs. Versions of this program held in the CPC repository in Mendeley Data AEVZ_v1_0; SimAn v1.0; 10.1016/j.cpc.2015.02.015