Pith. sign in

REVIEW 1 cited by

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

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

arxiv 2409.06538 v2 pith:6E7HCIUQ submitted 2024-09-10 cond-mat.stat-mech

classification cond-mat.stat-mech
keywords carlomontesimulationstensornetworktnmccriticaldisordered
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Disordered lattice spin systems are crucial in both theoretical and applied physics. However, understanding their properties poses significant challenges for 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\times 1024$ spins with moderate computational resources, a substantial increase from the previous maximum size of $64\times 64$ in MCMC. 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 multi-critical 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Markov Chain Monte Carlo in Tensor Network Representation

    cond-mat.stat-mech 2024-12 conditional novelty 7.0 of 10

    A tensor-network-based MCMC algorithm using stochastic projectors removes the systematic error of finite bond dimension truncation and shows exponential variance reduction on the 2D Ising model.

Pith tools