Optimization of population annealing Monte Carlo for large-scale spin-glass simulations
arXiv:1710.09025 · doi:10.1103/PhysRevE.98.053308
Abstract
Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well suited for large-scale simulations of computationally hard problems. Here we present various ways of optimizing population annealing Monte Carlo using 2-local spin-glass Hamiltonians as a case study. We demonstrate how the algorithm can be optimized from an implementation, algorithmic accelerator, as well as scalable parallelization points of view. This makes population annealing Monte Carlo perfectly suited to study other frustrated problems such as pyrochlore lattices, constraint-satisfaction problems, as well as higher-order Hamiltonians commonly found in, e.g., topological color codes.
14 pages, 11 figures, 1 table. See also arXiv:1711.02146 by Amey and Machta
References in corpus (6)
- Universality in three-dimensional Ising spin glasses: A Monte Carlo study
- Comparing Monte Carlo methods for finding ground states of Ising spin glasses: population annealing, simulated annealing and parallel tempering
- Temperature and Disorder Chaos in Three-Dimensional Ising Spin Glasses
- Universality-class dependence of energy distributions in spin glasses
- Evidence against a mean field description of short-range spin glasses revealed through thermal boundary conditions
- Analysis and Optimization of Population Annealing
Cited by in corpus (20)
- Combinatorial Optimization with Physics-Inspired Graph Neural Networks
- Enhancing associative memory recall and storage capacity using confocal cavity QED
- Quantum computing for chemistry and physics applications from a Monte Carlo perspective
- Understanding population annealing Monte Carlo simulations
- Analysis and Optimization of Population Annealing
- Computational Overhead of Locality Reduction in Binary Optimization Problems
- Computational hardness of spin-glass problems with tile-planted solutions
- Estimating the Density of States of Frustrated Spin Systems
- Numerical observation of a glassy phase in the three-dimensional Coulomb glass
- Weighted averages in population annealing: analysis and general framework
- Melting of a two-dimensional monodisperse cluster crystal to a cluster liquid
- Optimal schedules for annealing algorithms
- From quantum-enhanced to quantum-inspired Monte Carlo
- Evidence of many thermodynamic states of the three-dimensional Ising spin glass
- Nonflat Histogram Techniques for Spin Glasses
- Algorithm for the replica redistribution in the implementation of parallel annealing method on the hybrid supercomputer architecture
- Ground state interface exponents of the diluted Sherrington-Kirkpatrick spin glass
- Optimization and benchmarking of the thermal cycling algorithm
- Population annealing with topological defect driven nonlocal updates for spin systems with quenched disorder
- Metastability in the diluted parallel Ising model