Solving Spin Glasses with Optimized Trees of Clustered Spins

Abstract

We present an algorithm for the optimization and thermal equilibration of spin glasses - or more generally, cost functions of the Ising form $H={\sum }_{⟨ij⟩}{J}_{ij}{s}_i{s}_j+{\sum }_i{h}_i{s}_i$, 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.

10 pages, 10 figures

References in corpus (6)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Phase transition in the three dimensional Heisenberg spin glass: Finite-size scaling analysis
• Simulating spin systems on IANUS, an FPGA-based computer
• Unraveling Quantum Annealers using Classical Hardness
• Tunneling spectroscopy using a probe qubit
• Practical engineering of hard spin-glass instances

Cited by in corpus (2)

• Low depth mechanisms for quantum optimization
• Approximate optimization, sampling and spin-glass droplets discovery with tensor networks