Solving Spin Glasses with Optimized Trees of Clustered Spins
arXiv:1705.02075 · doi:10.1103/PhysRevE.96.022105
Abstract
We present an algorithm for the optimization and thermal equilibration of spin glasses - or more generally, cost functions of the Ising form , defined on graphs with arbitrary connectivity. The algorithm consists of two repeated steps: i) the optimized construction of a random tree of spin clusters on the input problem graph, and ii) the thermal sampling of the generated tree. The randomly generated trees are constructed so as to optimize a balance between the size of the tree and the complexity required to draw Boltzmann samples from it. We benchmark the algorithm on several classes of problems and demonstrate its advantages over existing approaches.
arXiv comment10 pages, 10 figures
References in corpus (15)
- Ising formulations of many NP problems
- Exchange Monte Carlo Method and Application to Spin Glass Simulations
- Architectural considerations in the design of a superconducting quantum annealing processor
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- JANUS: an FPGA-based System for High Performance Scientific Computing
- Phase transition in the three dimensional Heisenberg spin glass: Finite-size scaling analysis
- Nature of the spin-glass phase at experimental length scales
- Janus II: a new generation application-driven computer for spin-system simulations
- Simulating spin systems on IANUS, an FPGA-based computer
- Unraveling Quantum Annealers using Classical Hardness
- Temperature chaos in 3D Ising Spin Glasses is driven by rare events
- Tunneling spectroscopy using a probe qubit
- Practical engineering of hard spin-glass instances
- The wormhole move: A new algorithm for polymer simulations
- Belief-Propagation Guided Monte-Carlo Sampling