Optimised simulated annealing for Ising spin glasses

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 codes to that of the special purpose D-Wave devices built for solving such Ising spin glass problems. Program summary Program title: SimAn v1.0 Catalogue identifier: AEVZ_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEVZ_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: GNU General Public License, version 3 No. of lines in distributed program, including test data, etc.: 14999 No. of bytes in distributed program, including test data, etc.: 26594 Distribution format: tar.gz Programming language: C++, OpenMP for parallelization. Computer: Any PC. Operating system: Linux/OS X/UNIX. Has the code been vectorised or parallelized?: Parallelized using OpenMP. RAM: Variable, from a few megabytes. Classification: 4.13, 6.5, 23. Nature of problem: Ising spin glass ground states on sparse graphs. Solution method: Simulated annealing. Running time: From milliseconds to seconds.

[1]  Finding Low-Temperature States With Parallel Tempering, Simulated Annealing And Simple Monte Carlo , 2002, cond-mat/0209248.

[2]  Peter Virnau,et al.  Multi-GPU accelerated multi-spin Monte Carlo simulations of the 2D Ising model , 2010, Comput. Phys. Commun..

[3]  Yasumasa Kanada,et al.  Monte Carlo simulation of the Ising model and random number generation on the vector processor , 1990, Proceedings SUPERCOMPUTING '90.

[4]  S. V. N. Vishwanathan,et al.  Robust Classification with Adiabatic Quantum Optimization , 2012, ICML.

[5]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[6]  Daniel A. Lidar,et al.  Defining and detecting quantum speedup , 2014, Science.

[7]  Hans-Otto Heuer,et al.  A fast vectorized Fortran 77 program for the Monte Carlo simulation of the three-dimensional Ising system , 1990 .

[8]  H. Rieger.  Fast vectorized algorithm for the Monte Carlo simulation of the random field Ising model , 1992 .

[9]  F. Nieto,et al.  The ground state energy of the Edwards–Anderson spin glass model with a parallel tempering Monte Carlo algorithm , 2008, 0806.1054.

[10]  Thomas H. Fischer,et al.  A new optimization technique for artificial neural networks applied to prediction of force constants of large molecules , 1995, J. Comput. Chem..

[11]  Gyan Bhanot,et al.  A fast algorithm for the Cyber 205 to simulate the 3D Ising model , 1986 .

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  W. Macready,et al.  Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization , 2008, 0804.4457.

[14]  Wang,et al.  Replica Monte Carlo simulation of spin glasses. , 1986, Physical review letters.

[15]  Cong Wang,et al.  Experimental evaluation of an adiabiatic quantum system for combinatorial optimization , 2013, CF '13.

[16]  L. Pierre,et al.  A new random-number generator for multispin Monte Carlo algorithms , 1987 .

[17]  C. Geyer.  Markov Chain Monte Carlo Maximum Likelihood , 1991 .