Optimised simulated annealing for Ising spin glasses
From MaRDI portal
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 optimized code for bipartite graphs, and highly optimized 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.
Recommendations
Cites work
Cited in
(13)- Simulation reductions for the Ising model
- The potential of quantum annealing for rapid solution structure identification
- On computational capabilities of Ising machines based on nonlinear oscillators
- Quantum Monte Carlo annealing with multi-spin dynamics
- Solving combinatorial optimisation problems using oscillator based Ising machines
- Finding maximum independent set based on multi-stage simulated quantum adiabatic evolution
- Microwave photonics with superconducting quantum circuits
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- SimAn
- Mixing time and simulated annealing for the stochastic cellular automata
- Classical simulated annealing using quantum analogues
- The QISG suite: high-performance codes for studying quantum Ising spin glasses
- Graph minors from simulated annealing for annealing machines with sparse connectivity
This page was built for publication: Optimised simulated annealing for Ising spin glasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682429)