Inference from Matrix Products: A Heuristic Spin Glass Algorithm

Abstract

We present an algorithm for finding ground states of two dimensional spin glass systems based on ideas from matrix product states in quantum information theory. The algorithm works directly at zero temperature and defines an approximate "boundary Hamiltonian" whose accuracy depends on a parameter $k$. We test the algorithm against exact methods on random field and random bond Ising models, and we find that accurate results require a $k$ which scales roughly polynomially with the system size. The algorithm also performs well when tested on small systems with arbitrary interactions, where no fast, exact algorithms exist. The time required is significantly less than Monte Carlo schemes.

4 pages, 1 figure, minor typos fixed

References in corpus (12)

• Entanglement Entropy and Quantum Field Theory
• An Area Law for One Dimensional Quantum Systems
• Matrix product states represent ground states faithfully
• Quantum Spin Chain, Toeplitz Determinants and Fisher-Hartwig Conjecture
• Optimization with Extremal Dynamics
• Entanglement Entropy dynamics in Heisenberg chains
• Density Matrix Renormalization Group Method for 2D Classical Models
• Exploiting Quantum Parallelism To Simulate Quantum Random Many-Body Systems
• Conformal Invariance and SLE in Two-Dimensional Ising Spin Glasses
• Finding Low-Temperature States with Parallel Tempering, Simulated Annealing and Simple Monte Carlo
• Are Domain Walls in Spin Glasses Described by Stochastic Loewner Evolutions?
• Improved extremal optimization for the Ising spin glass

Cited by in corpus (3)

• Linear-time general decoding algorithm for the surface code
• Low-energy excitations in the three-dimensional random-field Ising model
• Physical consequences of P$\ne$NP and the DMRG-annealing conjecture