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.24382

Exact autoregressive sampling of planar Ising spin glasses via the Kac--Ward theory

Jing Liu, Tao Chen, Tianrui Che, Lei Wang, Youjin Deng, Pan Zhang

Published Aug 25, 2026• 0 citations
arXivHTMLPDF

Abstract

Exact sampling from the Boltzmann distribution of spin glasses remains an outstanding challenge: Markov chain Monte Carlo methods suffer from critical slowing down and metastable trapping, while modern neural autoregressive samplers such as variational autoregressive networks are approximate and, in the absence of exact reference samples, cannot be rigorously benchmarked. Here we present an exact autoregressive sampling algorithm for planar Ising spin glasses based on the Kac--Ward theory. Under the chain-rule factorization, sequentially fixing spins induces boundary-localized external fields, which destroy the zero-field structure required for exact evaluation. By encoding these fields with a planarity-preserving auxiliary spin construction, the conditional partition functions are mapped to an extended zero-field Ising model and exactly evaluated using the Kac--Ward determinant formula. The method generates strictly independent and identically distributed samples with exact normalized likelihoods at a computational cost of $\mathcal{O}(N^{5/2})$ for $N$ spins, thereby providing an exact baseline for benchmarking neural autoregressive samplers.

DOI
10.48550/arxiv.2608.24382

Related papers

Variational Monte Carlo (VMC) with row-update Projected Entangled-Pair States (PEPS) and its applications in quantum spin glasses

Tao Chen, Jing Liu, Yantao Wu +2 more

Solving the quantum many-body ground state problem remains a central challenge in computational physics. In this context, the Variational Monte Carlo (VMC) framework based on Projected Entangled Pair States (PEPS) has witnessed rapid development, establishing itself as a vital approach for investigating strongly correlated two-dimensional systems. However, standard PEPS-VMC algorithms predominantly rely on sequential local updates. This conventional approach often suffers from slow convergence and critical slowing down, particularly in the vicinity of phase transitions or within frustrated landscapes. To address these limitations, we propose an efficient autoregressive row-wise sampling algorithm for PEPS that enables direct, rejection-free sampling via single-layer contractions. By utilizing autoregressive single-layer row updates to generate collective, non-local configuration proposals, our method significantly reduces temporal correlations compared to local Metropolis moves. We benchmark the algorithm on the two-dimensional transverse-field Ising model and the quantum spin glass. Our results demonstrate that the row-wise scheme effectively mitigates critical slowing down near the Ising critical point. Furthermore, in the rugged landscape of the quantum spin glass, it yields improved optimization stability and lower ground-state energies. These findings indicate that single-layer autoregressive row updates provide a flexible and robust improvement to local PEPS-VMC sampling and may serve as a basis for more advanced sampling schemes.

arXiv:2601.20608•Jan 28, 2026•0 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•0 citations

Unbiased Monte Carlo cluster updates with autoregressive neural networks

Dian Wu, Riccardo Rossi, Giuseppe Carleo

Efficient sampling of complex high-dimensional probability distributions is a central task in computational science.Machine learning methods like autoregressive neural networks, used with Markov chain Monte Carlo sampling, provide good approximations to such distributions but suffer from either intrinsic bias or high variance.In this Letter, we propose a way to make this approximation unbiased and with low variance.Our method uses physical symmetries and variable-size cluster updates which utilize the structure of autoregressive factorization.We test our method for first-and second-order phase transitions of classical spin systems, showing its viability for critical systems and in the presence of metastable states.

arXiv:2105.05650•Physical Review Research•Nov 10, 2021•38 citations

Deep Autoregressive Models for the Efficient Variational Simulation of Many-Body Quantum Systems

Or Sharir, Yoav Levine, Noam Wies +2 more

Artificial neural networks were recently shown to be an efficient representation of highly entangled many-body quantum states. In practical applications, neural-network states inherit numerical schemes used in variational Monte Carlo method, most notably the use of Markov-chain Monte Carlo (MCMC) sampling to estimate quantum expectations. The local stochastic sampling in MCMC caps the potential advantages of neural networks in two ways: (i) Its intrinsic computational cost sets stringent practical limits on the width and depth of the networks, and therefore limits their expressive capacity; (ii) its difficulty in generating precise and uncorrelated samples can result in estimations of observables that are very far from their true value. Inspired by the state-of-the-art generative models used in machine learning, we propose a specialized neural-network architecture that supports efficient and exact sampling, completely circumventing the need for Markov-chain sampling. We demonstrate our approach for two-dimensional interacting spin models, showcasing the ability to obtain accurate results on larger system sizes than those currently accessible to neural-network quantum states.

arXiv:1902.04057•Physical Review Letters•Jan 16, 2020•257 citations

Sampling two-dimensional spin systems with transformers

P. Białas, Piotr Korcyl, Tomasz Stebel +2 more

Autoregressive Neural Networks based on dense or convolutional layers have recently been shown to be a viable strategy for generating classical spin systems. Unlike these methods, sampling with transformers is commonly considered to be computationally inefficient. In this work, we propose a novel approach to transformer-based neural samplers in which we generate not a single spin per step but groups of spins. As an additional improvement, we construct a model of approximated probabilities, further improving the efficiency of the algorithm. Despite our approach being computationally heavier than dense networks or CNN-based approaches, we were able to sample larger systems of up to $180 \times 180$ spins in case of the Ising model. The Effective Sample Size of our sampler is $\sim 20$ times larger than that of the previous state-of-the-art neural sampler when trained for the $128 \times 128$ Ising model at critical temperature. Finally, we also test our algorithm on the 2D Edwards-Anderson model, where we train $64\times 64$ spin systems.

arXiv:2604.27738•Apr 30, 2026•0 citations

Numerically exact correlations and sampling in the two-dimensional Ising spin glass

Creighton K. Thomas, A. Alan Middleton

A powerful existing technique for evaluating statistical mechanical quantities in two-dimensional Ising models is based on constructing a matrix representing the nearest-neighbor spin couplings and then evaluating the Pfaffian of the matrix. Utilizing this technique and other more recent developments in evaluating elements of inverse matrices and exact sampling, a method and computer code for studying two-dimensional Ising models is developed. The formulation of this method is convenient and fast for computing the partition function and spin correlations. It is also useful for exact sampling, where configurations are directly generated with probability given by the Boltzmann distribution. These methods apply to Ising model samples with arbitrary nearest-neighbor couplings and can also be applied to general dimer models. Example results of computations are described, including comparisons with analytic results for the ferromagnetic Ising model, and timing information is provided.

arXiv:1301.1252•Physical Review E•Apr 5, 2013•11 citations
Exact sampling from the Boltzmann distribution of spin glasses remains an outstanding challenge: Markov chain Monte Carlo methods suffer from critical slowing down and metastable trapping, while modern neural autoregressive samplers such as variational autoregressive networks are approximate and, in the absence of exact reference samples, cannot be rigorously benchmarked. Here we present an exact autoregressive sampling algorithm for planar Ising spin glasses based on the Kac--Ward theory. Under the chain-rule factorization, sequentially fixing spins induces boundary-localized external fields, which destroy the zero-field structure required for exact evaluation. By encoding these fields with a planarity-preserving auxiliary spin construction, the conditional partition functions are mapped to an extended zero-field Ising model and exactly evaluated using the Kac--Ward determinant formula. The method generates strictly independent and identically distributed samples with exact normalized likelihoods at a computational cost of O(N5/2)\mathcal{O}(N^{5/2})O(N5/2) for NNN spins, thereby providing an exact baseline for benchmarking neural autoregressive samplers.
Solving the quantum many-body ground state problem remains a central challenge in computational physics. In this context, the Variational Monte Carlo (VMC) framework based on Projected Entangled Pair States (PEPS) has witnessed rapid development, establishing itself as a vital approach for investigating strongly correlated two-dimensional systems. However, standard PEPS-VMC algorithms predominantly rely on sequential local updates. This conventional approach often suffers from slow convergence and critical slowing down, particularly in the vicinity of phase transitions or within frustrated landscapes. To address these limitations, we propose an efficient autoregressive row-wise sampling algorithm for PEPS that enables direct, rejection-free sampling via single-layer contractions. By utilizing autoregressive single-layer row updates to generate collective, non-local configuration proposals, our method significantly reduces temporal correlations compared to local Metropolis moves. We benchmark the algorithm on the two-dimensional transverse-field Ising model and the quantum spin glass. Our results demonstrate that the row-wise scheme effectively mitigates critical slowing down near the Ising critical point. Furthermore, in the rugged landscape of the quantum spin glass, it yields improved optimization stability and lower ground-state energies. These findings indicate that single-layer autoregressive row updates provide a flexible and robust improvement to local PEPS-VMC sampling and may serve as a basis for more advanced sampling schemes.
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.
Efficient sampling of complex high-dimensional probability distributions is a central task in computational science.Machine learning methods like autoregressive neural networks, used with Markov chain Monte Carlo sampling, provide good approximations to such distributions but suffer from either intrinsic bias or high variance.In this Letter, we propose a way to make this approximation unbiased and with low variance.Our method uses physical symmetries and variable-size cluster updates which utilize the structure of autoregressive factorization.We test our method for first-and second-order phase transitions of classical spin systems, showing its viability for critical systems and in the presence of metastable states.
Artificial neural networks were recently shown to be an efficient representation of highly entangled many-body quantum states. In practical applications, neural-network states inherit numerical schemes used in variational Monte Carlo method, most notably the use of Markov-chain Monte Carlo (MCMC) sampling to estimate quantum expectations. The local stochastic sampling in MCMC caps the potential advantages of neural networks in two ways: (i) Its intrinsic computational cost sets stringent practical limits on the width and depth of the networks, and therefore limits their expressive capacity; (ii) its difficulty in generating precise and uncorrelated samples can result in estimations of observables that are very far from their true value. Inspired by the state-of-the-art generative models used in machine learning, we propose a specialized neural-network architecture that supports efficient and exact sampling, completely circumventing the need for Markov-chain sampling. We demonstrate our approach for two-dimensional interacting spin models, showcasing the ability to obtain accurate results on larger system sizes than those currently accessible to neural-network quantum states.
Autoregressive Neural Networks based on dense or convolutional layers have recently been shown to be a viable strategy for generating classical spin systems. Unlike these methods, sampling with transformers is commonly considered to be computationally inefficient. In this work, we propose a novel approach to transformer-based neural samplers in which we generate not a single spin per step but groups of spins. As an additional improvement, we construct a model of approximated probabilities, further improving the efficiency of the algorithm. Despite our approach being computationally heavier than dense networks or CNN-based approaches, we were able to sample larger systems of up to 180×180180 \times 180180×180 spins in case of the Ising model. The Effective Sample Size of our sampler is ∼20\sim 20∼20 times larger than that of the previous state-of-the-art neural sampler when trained for the 128×128128 \times 128128×128 Ising model at critical temperature. Finally, we also test our algorithm on the 2D Edwards-Anderson model, where we train 64×6464\times 6464×64 spin systems.
A powerful existing technique for evaluating statistical mechanical quantities in two-dimensional Ising models is based on constructing a matrix representing the nearest-neighbor spin couplings and then evaluating the Pfaffian of the matrix. Utilizing this technique and other more recent developments in evaluating elements of inverse matrices and exact sampling, a method and computer code for studying two-dimensional Ising models is developed. The formulation of this method is convenient and fast for computing the partition function and spin correlations. It is also useful for exact sampling, where configurations are directly generated with probability given by the Boltzmann distribution. These methods apply to Ising model samples with arbitrary nearest-neighbor couplings and can also be applied to general dimer models. Example results of computations are described, including comparisons with analytic results for the ferromagnetic Ising model, and timing information is provided.