Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.31114

Overcoming critical slowing down in frustrated spin systems by learned multiscale sampling

Gabriele Bandini, Giulio Biroli, Patrick Charbonneau, Andrea Gambassi

Published Aug 31, 2026• 1 citation
arXivHTMLPDF

Abstract

Cluster algorithms, such as the Swendsen--Wang and Wolff methods, are among the most successful MCMC methods for mitigating critical slowing down in statistical systems. These constructive cluster algorithms, however, fail in the presence of even extremely weak frustration. Here, we sidestep this fundamental limitation by learning rather than constructing the relevant clusters. Specifically, we use the wavelet conditional renormalization group (WCRG) sampling method to learn the probability distribution of collective fluctuations of a frustrated two-dimensional soft-spin model. Configurations are then generated recursively from coarse to fine scales by sampling conditional wavelet distributions. The WCRG method reproduces the main statistical properties of the system across different phases, including the local-field distribution and the structure factor. At an Ising-like critical point, the conditional dynamics remains decorrelated within $\mathcal{O}(1)$ sweeps at each scale, yielding an overall sampling complexity of $\mathcal{O}(\log_2 L)$, thus making WCRG much more efficient than standard local MCMC methods. These results show that learned multiscale sampling can overcome critical slowing down in frustrated systems for which conventional cluster algorithms fail. By assessing the sampling accuracy of different observables, we also clarify the main tradeoff of the WCRG method: the accuracy of the fast sampling scheme depends on the expressiveness of the energy-based model used to estimate the wavelet conditional distributions.

DOI
10.48550/arxiv.2608.31114

Related papers

Multiscale Data-Driven Energy Estimation and Generation

Tanguy Marchand, Misaki Ozawa, Giulio Biroli +1 more

We develop a multiscale approach to estimate high-dimensional probability distributions.Our approach applies to cases in which the energy function (or Hamiltonian) is not known from the start.Using data acquired from experiments or simulations we can estimate the energy function.We obtain a representation of the approximate probability distribution based on a multiscale cascade of conditional probabilities.This representation allows for fast sampling of many-body systems in various domains, from statistical physics to cosmology.Our method-the wavelet-conditional renormalization group (WCRG)-proceeds scale by scale, estimating models for the conditional probabilities of "fast degrees of freedom" conditioned by coarse-grained fields.These probability distributions are modeled by energy functions associated with scale interactions, and are represented in an orthogonal wavelet basis.The WCRG decomposes the microscopic energy function as a sum of interaction energies at all scales and can efficiently generate new samples by going from coarse to fine scales.Near phase transitions, this representation of the approximate probability distribution completely avoids the "critical slowing-down" of direct estimation and sampling algorithms.This is explained theoretically by combining results from RG and wavelet theories, and verified numerically for the Gaussian and φ 4 -field theories.We show that multiscale WCRG energy-based models are more general than local potential models and can capture the physics of complex many-body interacting systems at all length scales.This is demonstrated for weak-gravitational-lensing fields reflecting darkmatter distributions in cosmology, which include long-range interactions with long-tail probability distributions.The WCRG has a large number of potential applications in nonequilibrium systems, where the underlying distribution is not known a priori.Finally, we discuss the connection between the WCRG and deep network architectures.

arXiv:2207.04941•Physical Review X•Nov 30, 2023•46 citations

Critical Slowing Down of Cluster Algorithms for Ising Models Coupled to 2-d Gravity

Mark J. Bowick, Marco Falcioni, Geoffrey Harris +1 more

We simulate single and multiple Ising models coupled to 2–d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing down, particularly in the magnetization. We argue that this is primarily due to the local nature of the dynamical triangulation algorithm and to the generation of a distribution of baby universes which inhibits cluster growth. SU–HEP–93–4241–560 SCCS 568 hep-lat/9311036 Considerable work has been devoted to the study of the performance of cluster algorithms in reducing the critical slowing down of many statistical models. The Swendsen-Wang [1] and the Wolff [2] algorithms have proven very effective in beating the critical slowing down (CSD) exhibited by these models when simulated with a standard Metropolis [3] update. Reviews on cluster algorithms and CSD may be found on refs. [4]. In recent years, the numerical study of Potts models coupled to 2–d gravity has received much attention [5, 6, 7], aided as well by increased analytical understanding of these models [8]. Cluster algorithms have proved useful in saving computational effort on the update of the Potts variables. The present study is motivated by the fact that there is little understanding of the actual extent of the improvement achieved in these simulations. It is worthwhile, therefore, to measure CSD in the case of simple Ising spins coupled to a dynamical lattice in order to quantify the performance of cluster algorithms. We find that there is considerable CSD, especially in the magnetization, and we relate this to the dynamics of cluster formation on a random lattice.

•Nov 23, 1993•4 citations

Tensor-Network Markov-Chain Monte Carlo: Efficient Sampling of Three-Dimensional Spin Glasses

Tao Chen, Jing Liu, Youjin Deng +1 more

Sampling equilibrium configurations of three-dimensional (3D) spin glasses with quenched disorder remains a fundamental challenge in statistical physics. The rugged energy landscape, pronounced critical slowing down, and intrinsic ergodicity breaking render standard Monte Carlo methods severely inefficient, particularly for large systems at low temperatures. In this Letter, we introduce the tensor-network Markov-chain Monte Carlo (TNMCMC) approach to address the issue. By formulating large-scale collective updates via tensor-network contractions on 2D lattice slices, TNMCMC yields unbiased samples of the Boltzmann distribution while substantially reducing autocorrelation times relative to conventional MCMC approaches. Numerical benchmarks on 3D spin glasses demonstrate that the method systematically mitigates critical slowing down. Furthermore, application to three- and four-state 3D Potts models shows that TNMCMC can traverse the exponential free-energy barriers of first-order phase transitions that typically hinder local MC updates. These results establish TNMCMC as a promising numerical framework capable of addressing important 3D problems in statistical physics and beyond, such as the precise computation of low-temperature thermodynamic properties of three-dimensional spin glasses and the decoding of quantum error-correcting codes with a three-dimensional topology.

arXiv:2509.23945•Physical Review Letters•Aug 12, 2026•8 citations

Critical dynamics of cluster algorithms in the random-bond Ising model

Ulvi Kanbur, Zeynep Demir Vatansever

In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.

Physical review. E•Feb 28, 2024•4 citations

Exploring Critical Phenomena in Frustrated Spin Systems with Population Monte Carlo Simulations

Denis Gessert

Frustrated spin systems exhibit a wide range of phenomena such as novel phases, residual entropy and glassy dynamics. In contrast to the usual assumption of universality, microscopic details such as the underlying lattice structure often play a crucial role in these systems. In this dissertation the frustrated J1-J2 Ising model on the honeycomb lattice is considered. Earlier work shows that the coupling ratio R = J2 /|J1 | = −1/4 separates regions of two different ground states. Above this threshold the ground state is (anti-)ferromagnetically ordered for (anti-)ferromagnetic J1 , whereas below it infinitely many states of minimal energy exist. A recent Monte Carlo (MC) study by Žukovič finds a continuous transition with Ising critical exponents for R ≥ −0.2, leaving open the question of criticality for −1/4 < R < −0.2, for which the study was obfuscated by the presence of strong metastability. The regime with the highly degenerate ground states (R < −1/4), on the other hand, is characterized by feature-rich specific heat curves, and slow low-temperature dynamics reminiscent of spin glasses, although there is no disorder in this system. Prior to this work, no order parameter has been identified, and there is no clear understanding of its potentially critical behavior. Here, the question of criticality for −1/4 < R < −0.2 is addressed, and Ising universality is found for lower values of R, namely, at least for R ≥ −0.23. This result is achieved by carrying out finite-size scaling analyses of response functions like the magnetic susceptibility, and of the complex partition function zeros. In both cases, the underlying numerical data was generated using population annealing (PA) MC, a framework devised for spin glasses but generally applicable to systems with metastability. Furthermore, the region of degenerate ground states is studied using different boundary conditions, which are found to strongly affect the thermodynamic observations. A broken symmetry at zero temperature is identified, which can be quantified using a complex nematic order parameter. The MC data are consistent with a continuous symmetry-breaking transition. However, due to the limited system sizes that could be studied, and the presence of strong finite-size effects, one cannot rule out a higher-order transition or a cross-over without any singularities. In the process of studying this system, also the understanding of the PA framework was further developed. Specifically, the role of the resampling step in the algorithm was investigated. While it is crucial for efficient equilibration, no benefit is found in noisier resampling schemes such as the multinomial resampling method. Instead, two resampling schemes, which have the lowest sampling variance, are identified as preferential.:1 Introduction I Background and Methodology 2 Background 2.1 Fundamentals of Statistical Mechanics 2.1.1 Equilibrium ensembles 2.1.2 Phase transitions and critical behavior 2.1.3 Common spin models 2.2 Frustrated Spin Models 2.2.1 Frustrated J1-J2 Ising model on the square lattice 2.2.2 Gonihedric model in two dimensions 2.3 Monte Carlo Simulations 2.3.1 Fundamentals 2.3.2 Autocorrelation and error bars in MCMC time series 2.3.3 Possible implementations 2.3.4 Generalized ensemble methods 3 Methodology 3.1 General Algorithmic Design 3.2 Population Annealing 3.2.1 Algorithm 3.2.2 Assessing population annealing performance 3.2.3 Adaptive temperature steps 3.2.4 Weighted averages 3.2.5 Population annealing and first-order transitions 3.3 Estimating Critical Exponents from Finite Systems 3.3.1 Standard finite size scaling 3.3.2 Complex partition function zeros II Results 4 Algorithmic Improvements and Extensions to the Population Annealing Framework 4.1 Resampling Step in Population Annealing 4.1.1 Conceptual overview 4.1.2 Possible resampling methods 4.1.3 Benchmarking different resampling methods 4.1.4 Simulation results 4.1.5 PA simulations with finite populations in the limit of perfect equilibration 4.1.6 PA simulations in the limit of infinite populations and perfect equilibration 4.1.7 Conclusion 4.2 Using Population Annealing on Many Computing Nodes 4.2.1 Literature overview and different rebalancing schemes 4.2.2 Simulations of simulations 4.2.3 Conclusion and outlook 4.3 Adaptive Number of Spin Updates in Population Annealing 4.4 Microcanonical Population Annealing 5 The Frustrated J1-J2 Ising Model on the Honeycomb Lattice 5.1 Overview 5.2 Regime of Ising Universality Class 5.2.1 Finite-size scaling analysis 5.2.2 Energy barriers 5.2.3 Exploring the complex partition function zeros 5.3 Finite Ground State Entropy per Spin for J2/|J1| = −1/4 5.4 Highly Degenerate Striped Phase for J2/|J1| < −1/4 5.4.1 Boundary conditions 5.4.2 Energy minimization and ground states 5.4.3 Topological defects 5.4.4 Observables 5.4.5 Simulation details 5.4.6 Simulation results for R = −0.5 5.4.7 Simulation results for R = −1 5.4.8 Discussion 5.4.9 Conclusion and outlook 6 Parallel tempering and its infinite-swap limit 6.1 Formalism 6.2 Details on Implementation 6.3 Numerical Results from INS-PT Simulations 6.3.1 One-dimensional Ising model 6.3.2 Two-dimensional Ising model 6.3.3 q-state Potts model 6.3.4 Lennard-Jones clusters 6.4 Discussion 7 Conclusions and outlook Bibliography Appendices A Algorithmic Improvements and Extensions to the Population Annealing framework: Further details A.1 Generating correlated energy time series B J1-J2 honeycomb Ising model: Further plots and details B.1 GPU domain decomposition B.2 Finite-size scaling using Metropolis population annealing B.3 The decoupled antiferromagnet limit B.4 Zero temperature value of the nematic order parameter B.5 Percolation properties for J2 = −0.5 B.6 Binder parameter of the one-dimensional Ising model C Application for Ethical Approval

•May 8, 2025•0 citations

Tensor network Monte Carlo simulations for the two-dimensional random-bond Ising model

Tao Chen, Erdong Guo, Wanzhou Zhang +2 more

Disordered lattice spin systems are crucial in both theoretical and applied physics. However, understanding their properties poses significant challenges to Monte Carlo simulations. In this work, we investigate the two-dimensional random-bond Ising model using the recently proposed tensor network Monte Carlo (TNMC) method. This method generates biased samples from conditional probabilities computed via tensor network contractions and corrects the bias using the Metropolis scheme. Consequently, the proposals provided by tensor networks function as block updates for Monte Carlo simulations. Through extensive numerical experiments, we demonstrate that TNMC simulations can be performed on lattices as large as $1024\ifmmode\times\else\texttimes\fi{}1024$ spins with moderate computational resources, a substantial increase from the previous maximum size of $64\ifmmode\times\else\texttimes\fi{}64$ in Markov-chain Monte Carlo. Notably, we observe an almost complete absence of critical slowing down, enabling the efficient collection of unbiased samples and averaging over a large number of random realizations of bond disorders. We successfully pinpoint the multicritical point along the Nishimori line with significant precision and accurately determined the bulk and surface critical exponents. Our findings suggest that TNMC is a highly efficient algorithm for exploring disordered and frustrated systems in two dimensions.

arXiv:2409.06538•Physical review. B./Physical review. B•Mar 4, 2025•20 citations
Cluster algorithms, such as the Swendsen--Wang and Wolff methods, are among the most successful MCMC methods for mitigating critical slowing down in statistical systems. These constructive cluster algorithms, however, fail in the presence of even extremely weak frustration. Here, we sidestep this fundamental limitation by learning rather than constructing the relevant clusters. Specifically, we use the wavelet conditional renormalization group (WCRG) sampling method to learn the probability distribution of collective fluctuations of a frustrated two-dimensional soft-spin model. Configurations are then generated recursively from coarse to fine scales by sampling conditional wavelet distributions. The WCRG method reproduces the main statistical properties of the system across different phases, including the local-field distribution and the structure factor. At an Ising-like critical point, the conditional dynamics remains decorrelated within O(1)\mathcal{O}(1)O(1) sweeps at each scale, yielding an overall sampling complexity of O(log⁡2L)\mathcal{O}(\log_2 L)O(log2​L), thus making WCRG much more efficient than standard local MCMC methods. These results show that learned multiscale sampling can overcome critical slowing down in frustrated systems for which conventional cluster algorithms fail. By assessing the sampling accuracy of different observables, we also clarify the main tradeoff of the WCRG method: the accuracy of the fast sampling scheme depends on the expressiveness of the energy-based model used to estimate the wavelet conditional distributions.
We develop a multiscale approach to estimate high-dimensional probability distributions.Our approach applies to cases in which the energy function (or Hamiltonian) is not known from the start.Using data acquired from experiments or simulations we can estimate the energy function.We obtain a representation of the approximate probability distribution based on a multiscale cascade of conditional probabilities.This representation allows for fast sampling of many-body systems in various domains, from statistical physics to cosmology.Our method-the wavelet-conditional renormalization group (WCRG)-proceeds scale by scale, estimating models for the conditional probabilities of "fast degrees of freedom" conditioned by coarse-grained fields.These probability distributions are modeled by energy functions associated with scale interactions, and are represented in an orthogonal wavelet basis.The WCRG decomposes the microscopic energy function as a sum of interaction energies at all scales and can efficiently generate new samples by going from coarse to fine scales.Near phase transitions, this representation of the approximate probability distribution completely avoids the "critical slowing-down" of direct estimation and sampling algorithms.This is explained theoretically by combining results from RG and wavelet theories, and verified numerically for the Gaussian and φ 4 -field theories.We show that multiscale WCRG energy-based models are more general than local potential models and can capture the physics of complex many-body interacting systems at all length scales.This is demonstrated for weak-gravitational-lensing fields reflecting darkmatter distributions in cosmology, which include long-range interactions with long-tail probability distributions.The WCRG has a large number of potential applications in nonequilibrium systems, where the underlying distribution is not known a priori.Finally, we discuss the connection between the WCRG and deep network architectures.
We simulate single and multiple Ising models coupled to 2–d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing down, particularly in the magnetization. We argue that this is primarily due to the local nature of the dynamical triangulation algorithm and to the generation of a distribution of baby universes which inhibits cluster growth. SU–HEP–93–4241–560 SCCS 568 hep-lat/9311036 Considerable work has been devoted to the study of the performance of cluster algorithms in reducing the critical slowing down of many statistical models. The Swendsen-Wang [1] and the Wolff [2] algorithms have proven very effective in beating the critical slowing down (CSD) exhibited by these models when simulated with a standard Metropolis [3] update. Reviews on cluster algorithms and CSD may be found on refs. [4]. In recent years, the numerical study of Potts models coupled to 2–d gravity has received much attention [5, 6, 7], aided as well by increased analytical understanding of these models [8]. Cluster algorithms have proved useful in saving computational effort on the update of the Potts variables. The present study is motivated by the fact that there is little understanding of the actual extent of the improvement achieved in these simulations. It is worthwhile, therefore, to measure CSD in the case of simple Ising spins coupled to a dynamical lattice in order to quantify the performance of cluster algorithms. We find that there is considerable CSD, especially in the magnetization, and we relate this to the dynamics of cluster formation on a random lattice.
Sampling equilibrium configurations of three-dimensional (3D) spin glasses with quenched disorder remains a fundamental challenge in statistical physics. The rugged energy landscape, pronounced critical slowing down, and intrinsic ergodicity breaking render standard Monte Carlo methods severely inefficient, particularly for large systems at low temperatures. In this Letter, we introduce the tensor-network Markov-chain Monte Carlo (TNMCMC) approach to address the issue. By formulating large-scale collective updates via tensor-network contractions on 2D lattice slices, TNMCMC yields unbiased samples of the Boltzmann distribution while substantially reducing autocorrelation times relative to conventional MCMC approaches. Numerical benchmarks on 3D spin glasses demonstrate that the method systematically mitigates critical slowing down. Furthermore, application to three- and four-state 3D Potts models shows that TNMCMC can traverse the exponential free-energy barriers of first-order phase transitions that typically hinder local MC updates. These results establish TNMCMC as a promising numerical framework capable of addressing important 3D problems in statistical physics and beyond, such as the precise computation of low-temperature thermodynamic properties of three-dimensional spin glasses and the decoding of quantum error-correcting codes with a three-dimensional topology.
In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.
Frustrated spin systems exhibit a wide range of phenomena such as novel phases, residual entropy and glassy dynamics. In contrast to the usual assumption of universality, microscopic details such as the underlying lattice structure often play a crucial role in these systems. In this dissertation the frustrated J1-J2 Ising model on the honeycomb lattice is considered. Earlier work shows that the coupling ratio R = J2 /|J1 | = −1/4 separates regions of two different ground states. Above this threshold the ground state is (anti-)ferromagnetically ordered for (anti-)ferromagnetic J1 , whereas below it infinitely many states of minimal energy exist. A recent Monte Carlo (MC) study by Žukovič finds a continuous transition with Ising critical exponents for R ≥ −0.2, leaving open the question of criticality for −1/4 < R < −0.2, for which the study was obfuscated by the presence of strong metastability. The regime with the highly degenerate ground states (R < −1/4), on the other hand, is characterized by feature-rich specific heat curves, and slow low-temperature dynamics reminiscent of spin glasses, although there is no disorder in this system. Prior to this work, no order parameter has been identified, and there is no clear understanding of its potentially critical behavior. Here, the question of criticality for −1/4 < R < −0.2 is addressed, and Ising universality is found for lower values of R, namely, at least for R ≥ −0.23. This result is achieved by carrying out finite-size scaling analyses of response functions like the magnetic susceptibility, and of the complex partition function zeros. In both cases, the underlying numerical data was generated using population annealing (PA) MC, a framework devised for spin glasses but generally applicable to systems with metastability. Furthermore, the region of degenerate ground states is studied using different boundary conditions, which are found to strongly affect the thermodynamic observations. A broken symmetry at zero temperature is identified, which can be quantified using a complex nematic order parameter. The MC data are consistent with a continuous symmetry-breaking transition. However, due to the limited system sizes that could be studied, and the presence of strong finite-size effects, one cannot rule out a higher-order transition or a cross-over without any singularities. In the process of studying this system, also the understanding of the PA framework was further developed. Specifically, the role of the resampling step in the algorithm was investigated. While it is crucial for efficient equilibration, no benefit is found in noisier resampling schemes such as the multinomial resampling method. Instead, two resampling schemes, which have the lowest sampling variance, are identified as preferential.:1 Introduction I Background and Methodology 2 Background 2.1 Fundamentals of Statistical Mechanics 2.1.1 Equilibrium ensembles 2.1.2 Phase transitions and critical behavior 2.1.3 Common spin models 2.2 Frustrated Spin Models 2.2.1 Frustrated J1-J2 Ising model on the square lattice 2.2.2 Gonihedric model in two dimensions 2.3 Monte Carlo Simulations 2.3.1 Fundamentals 2.3.2 Autocorrelation and error bars in MCMC time series 2.3.3 Possible implementations 2.3.4 Generalized ensemble methods 3 Methodology 3.1 General Algorithmic Design 3.2 Population Annealing 3.2.1 Algorithm 3.2.2 Assessing population annealing performance 3.2.3 Adaptive temperature steps 3.2.4 Weighted averages 3.2.5 Population annealing and first-order transitions 3.3 Estimating Critical Exponents from Finite Systems 3.3.1 Standard finite size scaling 3.3.2 Complex partition function zeros II Results 4 Algorithmic Improvements and Extensions to the Population Annealing Framework 4.1 Resampling Step in Population Annealing 4.1.1 Conceptual overview 4.1.2 Possible resampling methods 4.1.3 Benchmarking different resampling methods 4.1.4 Simulation results 4.1.5 PA simulations with finite populations in the limit of perfect equilibration 4.1.6 PA simulations in the limit of infinite populations and perfect equilibration 4.1.7 Conclusion 4.2 Using Population Annealing on Many Computing Nodes 4.2.1 Literature overview and different rebalancing schemes 4.2.2 Simulations of simulations 4.2.3 Conclusion and outlook 4.3 Adaptive Number of Spin Updates in Population Annealing 4.4 Microcanonical Population Annealing 5 The Frustrated J1-J2 Ising Model on the Honeycomb Lattice 5.1 Overview 5.2 Regime of Ising Universality Class 5.2.1 Finite-size scaling analysis 5.2.2 Energy barriers 5.2.3 Exploring the complex partition function zeros 5.3 Finite Ground State Entropy per Spin for J2/|J1| = −1/4 5.4 Highly Degenerate Striped Phase for J2/|J1| < −1/4 5.4.1 Boundary conditions 5.4.2 Energy minimization and ground states 5.4.3 Topological defects 5.4.4 Observables 5.4.5 Simulation details 5.4.6 Simulation results for R = −0.5 5.4.7 Simulation results for R = −1 5.4.8 Discussion 5.4.9 Conclusion and outlook 6 Parallel tempering and its infinite-swap limit 6.1 Formalism 6.2 Details on Implementation 6.3 Numerical Results from INS-PT Simulations 6.3.1 One-dimensional Ising model 6.3.2 Two-dimensional Ising model 6.3.3 q-state Potts model 6.3.4 Lennard-Jones clusters 6.4 Discussion 7 Conclusions and outlook Bibliography Appendices A Algorithmic Improvements and Extensions to the Population Annealing framework: Further details A.1 Generating correlated energy time series B J1-J2 honeycomb Ising model: Further plots and details B.1 GPU domain decomposition B.2 Finite-size scaling using Metropolis population annealing B.3 The decoupled antiferromagnet limit B.4 Zero temperature value of the nematic order parameter B.5 Percolation properties for J2 = −0.5 B.6 Binder parameter of the one-dimensional Ising model C Application for Ethical Approval
Disordered lattice spin systems are crucial in both theoretical and applied physics. However, understanding their properties poses significant challenges to Monte Carlo simulations. In this work, we investigate the two-dimensional random-bond Ising model using the recently proposed tensor network Monte Carlo (TNMC) method. This method generates biased samples from conditional probabilities computed via tensor network contractions and corrects the bias using the Metropolis scheme. Consequently, the proposals provided by tensor networks function as block updates for Monte Carlo simulations. Through extensive numerical experiments, we demonstrate that TNMC simulations can be performed on lattices as large as $1024\ifmmode\times\else\texttimes\fi{}1024$ spins with moderate computational resources, a substantial increase from the previous maximum size of $64\ifmmode\times\else\texttimes\fi{}64$ in Markov-chain Monte Carlo. Notably, we observe an almost complete absence of critical slowing down, enabling the efficient collection of unbiased samples and averaging over a large number of random realizations of bond disorders. We successfully pinpoint the multicritical point along the Nishimori line with significant precision and accurately determined the bulk and surface critical exponents. Our findings suggest that TNMC is a highly efficient algorithm for exploring disordered and frustrated systems in two dimensions.