2019/06/16 by Satoshi Handa, Katsuhiro Kamakura, Handa, Satoshi +5
Computer Science · Mathematics · #60J20 #78M31 #82C20 #90C27 #Cellular Automata and Applications #FOS: Mathematics #FOS: Physical sciences #Markov Chains and Monte Carlo Methods #Mathematical Physics (math-ph) #Optimization and Control (math.OC) #Probability (math.PR) #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.1906.06645
openalex publication_date 2019/06/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Finding a ground state of a given Hamiltonian is an important but hard problem. One of the potential methods is to use a Markov chain Monte Carlo (MCMC) to sample the Gibbs distribution whose highest peaks correspond to the ground states. In this short paper, we use stochastic cellular automata (SCA) and see if it is possible to find a ground state faster than the conventional MCMCs, such as the Glauber dynamics. We show that, if the temperature is sufficiently high, it is possible for SCA to have more spin-flips per update in average than Glauber and, at the same time, to have an equilibrium distribution ``close" to the one for Glauber, i.e., the Gibbs distribution. During the course, we also propose a new way to characterize how close a probability measure is to the target Gibbs.