REVIEW 4 cited by
Exchange Monte Carlo Method and Application to Spin Glass Simulations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is introduced. This exchange process is expected to let the system at low temperatures escape from a local minimum. By using this algorithm the three-dimensional $\pm J$ Ising spin glass model is studied. The ergodicity time in this method is found much smaller than that of the multi-canonical method. In particular the time correlation function almost follows an exponential decay whose relaxation time is comparable to the ergodicity time at low temperatures. It suggests that the system relaxes very rapidly through the exchange process even in the low temperature phase.
Forward citations
Cited by 4 Pith papers
-
Spectral Signatures of Replica Symmetry Breaking in Optimization-Induced Random Matrices
Difference spectra of two optimization-induced matrices from independent Gibbs samples form an explicit spectral transform of the Parisi overlap order parameter, while a single-matrix bulk is blind to replica symmetry...
-
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
A pre-computation method sets penalization weights for constrained QUBO problems with provable guarantees for Gibbs solvers and polynomial scaling for many problem classes.
-
Active Particle Doping Suppresses Brittle Failure in Ultrastable Glasses
Active particles are claimed to make ultrastable glasses yield homogeneously with multiple shear bands instead of failing brittlely, though the manuscript body provided is a different paper.
-
Permutation Matrix Representation Quantum Monte Carlo
A permutation-matrix quantum Monte Carlo algorithm samples closed walks of off-diagonal operators, unifies updates across models, and outperforms stochastic series expansion on transverse-field Ising benchmarks.
Discussion (0). Continue with ORCID to comment.