SearcharxivSearch

arXiv · 2304.12796

Dynamical process of a bit-width reduced Ising model with simulated annealing

Abstract

Ising machines have attracted attention as efficient solvers for combinatorial optimization problems, which are formulated as ground-state (lowest-energy) search problems of the Ising model. Due to the limited bit-width of coefficients on Ising machines, the Ising model must be transformed into a bit-width reduced (BWR) Ising model. According to previous research, the bit-width reduction method, which adds auxiliary spins, ensures that the ground state of the BWR Ising model is theoretically the same as the Ising model before bit-width reduction (original Ising model). However, while the dynamical process is closely related to solution accuracy, how the BWR Ising model progresses towards the ground state remains to be elucidated. Therefore, we compared the dynamical processes of these models using simulated annealing (SA). Our findings reveal significant differences in the dynamical process across models. Analysis from the viewpoint of statistical mechanics found that the BWR Ising model has two characteristic properties: an effective temperature and a slow relaxation. These properties alter the temperature schedule and spin flip probability in the BWR Ising model, leading to differences in the dynamical process. Therefore, to obtain the same dynamical process as the original Ising model, we proposed SA parameters for the BWR Ising model. We demonstrated the proposed SA parameters using a square lattice Ising model, in which all coefficients were set uniformly to the same positive values or randomly. Our experimental evaluations demonstrated that the dynamical process of the BWR and original Ising model became closer.

Explore related subjects

Keep this discovery

BibTeXRIS

Shuta Kikuchi, Nozomu Togawa, Shu Tanaka. 2023-04-25. Dynamical process of a bit-width reduced Ising model with simulated annealing. https://doi.org/10.1109/access.2023.3310875

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech