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

Theoretical and Natural Science

Monte Carlo Simulations in Complex Systems: Challenges and New Approaches

Jiming Chen

Published Jan 15, 2025• 2 citations
Publisher

Abstract

Monte Carlo simulations are crucial for examining the Ising model, especially when it's tough to find analytical solutions. However, traditional Monte Carlo methods, like the Metropolis algorithm, encounter significant hurdles, such as slowing down near phase transitions and issues related to finite sizes. This paper looks into both the advantages and limitations of these traditional Monte Carlo techniques. It also covers recent developments like Tensor Network Monte Carlo and Quantum Monte Carlo methods, which have shown promise in overcoming these challenges. Furthermore, the paper explores how machine learning techniques are being incorporated into Monte Carlo simulations to enhance their efficiency and accuracy. These advancements represent a major leap forward in simulating complex systems and have expanded the use of Monte Carlo methods into new areas, including quantum systems and models with disorder. This paper finds that traditional Monte Carlo methods, like the Metropolis algorithm, face issues such as critical slowing down and finite-size effects. New methods, such as Tensor Network Monte Carlo (TNMC) and Quantum Monte Carlo (QMC), effectively address these challenges, enhancing simulation accuracy and efficiency in complex systems. Additionally, integrating machine learning optimizes parameters and accelerates convergence, expanding Monte Carlo’s applicability to large-scale, high-dimensional systems across various scientific fields.

DOI
10.54254/2753-8818/2025.20172

Related papers

Self-learning Monte Carlo Method: A Review

Gaopei Pan, Chuang Chen, Zi Yang Meng

The Self-Learning Monte Carlo (SLMC) method is a Monte Carlo approach that has emerged in recent years by integrating concepts from machine learning with conventional Monte Carlo techniques. Designed to accelerate the numerical study of interacting many-body systems, SLMC significantly improves sampling efficiency by constructing an effective model -- via machine learning methods -- based on configurations generated by conventional Monte Carlo methods and then proposes global updates based on the effective model. This enhancement leads to a substantial reduction in autocorrelation time, especially near the critical region, where traditional methods typically suffer from critical slowing down and increased computation complexity. Moreover, SLMC maintains statistical accuracy by implementing a cumulative update scheme that rigorously satisfies the detailed balance condition. And more recent applications have extended the SLMC to convolutional neural networks with applications not only in condensed matter physics but also high-energy physics, quantum chemistry, and quantum simulations. The generic applicability and high computational efficiency make SLMC a powerful and scalable framework for quantum Monte Carlo simulations of strongly correlated electron systems, extending the reach of numerical investigations beyond the limitations of conventional techniques.

arXiv:2507.12554•Jul 16, 2025•1 citation

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•12 citations

Quantum-Accelerated Monte Carlo Simulation of Complex Systems

Jincheng Zhang

Quantum-Accelerated Monte Carlo Simulation of Complex Systems Quantum-accelerated Monte Carlo simulation represents a significant advancement in computational science, offering the potential to dramatically reduce the time required to simulate complex systems across diverse fields. This paper investigates the design and implementation of a quantum algorithm specifically tailored for accelerating Monte Carlo simulations, leveraging quantum entanglement to enhance efficiency and accuracy. We detail the core mechanism, outlining the strategic use of quantum algorithms to navigate the expansive solution space of these simulations. The paper explores the potential benefits and challenges associated with this approach, highlighting the transformative impact it could have on scientific discovery and technological innovation.

•Aug 31, 2026•0 citations

Quantum-Inspired Sampling for Monte Carlo Simulations

Jincheng Zhang

Quantum-inspired sampling is a novel approach to Monte Carlo simulations that aims to overcome the limitations of traditional methods by incorporating quantum-like phenomena – specifically superposition and entanglement – into the sampling process. This paper investigates the potential of utilizing these principles to accelerate convergence, enhance accuracy, and improve the overall efficiency of Monte Carlo simulations, particularly in complex systems. We present a theoretical framework and preliminary implementation demonstrating the effectiveness of this technique. The core mechanism focuses on manipulating the probability distribution to guide the search towards promising solutions, effectively leveraging quantum-inspired dynamics.

•Sep 3, 2026•0 citations

Quantum Monte Carlo in the Age of Many-Body Quantum Information

Yi-Ming Ding, Bin-Bin Mao, Zheng Yan

Quantum Monte Carlo (QMC) methods are among the central numerical tools for studying strongly correlated quantum many-body systems, particularly in higher dimensions. As quantum information has introduced new information-theoretic perspectives and diagnostics into many-body physics, QMC methods have accordingly been extended beyond the measurement of conventional linear observables. This review summarizes recent progress in adapting QMC to many-body quantum-information, focusing on qubit or spin-$1/2$ systems as a concrete setting while keeping the discussion broadly applicable to qudit and bosonic systems. We present a unified perspective on the extraction of nonlinear diagnostics, including entanglement entropies and entanglement spectra, Rényi negativities for mixed-state entanglement, stabilizer entropies for quantum magic, and decoherence-driven phenomena such as the interplay between imaginary-time evolution and decoherence and strong-to-weak spontaneous symmetry breaking.

quant-pharXiv:2608.23231•Aug 25, 2026•0 citations

Self-learning QMC: application to the classical Holstein-Spin-Fermion model

Shaozhi Li

To evaluate the effectiveness of machine learning in systems with competing interactions, we developed a self-learning quantum Monte Carlo (SLQMC) method to simulate the phase transition in the classical Holstein-spin-fermion model. In SLQMC, machine learning techniques are employed to approximate the free energy, thereby bypassing the need for exact diagonalization and significantly reducing computational cost. We assess the performance of SLQMC using both linear regression and neural network models. Our results show that both models are capable of capturing the phase transition from the antiferromagnetic state to the charge-density-wave state. However, the sampling efficiency decreases near the AFM-CDW phase transition, which is attributed to the increased mean-squared-error of the machine learning model. Additionally, the sampling efficiency decreases with increasing lattice size. This suppression is due to the increased root-mean-squared-error as the machine learning model is applied to a large lattice and the finite-size effect, wherein the energy gap between the ground state and low-energy excited states decreases as the lattice grows. Our findings highlight the necessity of highly accurate machine learning models to simulate theoretical models with complex, competing microscopic interactions on a large lattice.

arXiv:2509.05876•Sep 7, 2025•0 citations
Monte Carlo simulations are crucial for examining the Ising model, especially when it's tough to find analytical solutions. However, traditional Monte Carlo methods, like the Metropolis algorithm, encounter significant hurdles, such as slowing down near phase transitions and issues related to finite sizes. This paper looks into both the advantages and limitations of these traditional Monte Carlo techniques. It also covers recent developments like Tensor Network Monte Carlo and Quantum Monte Carlo methods, which have shown promise in overcoming these challenges. Furthermore, the paper explores how machine learning techniques are being incorporated into Monte Carlo simulations to enhance their efficiency and accuracy. These advancements represent a major leap forward in simulating complex systems and have expanded the use of Monte Carlo methods into new areas, including quantum systems and models with disorder. This paper finds that traditional Monte Carlo methods, like the Metropolis algorithm, face issues such as critical slowing down and finite-size effects. New methods, such as Tensor Network Monte Carlo (TNMC) and Quantum Monte Carlo (QMC), effectively address these challenges, enhancing simulation accuracy and efficiency in complex systems. Additionally, integrating machine learning optimizes parameters and accelerates convergence, expanding Monte Carlo’s applicability to large-scale, high-dimensional systems across various scientific fields.
The Self-Learning Monte Carlo (SLMC) method is a Monte Carlo approach that has emerged in recent years by integrating concepts from machine learning with conventional Monte Carlo techniques. Designed to accelerate the numerical study of interacting many-body systems, SLMC significantly improves sampling efficiency by constructing an effective model -- via machine learning methods -- based on configurations generated by conventional Monte Carlo methods and then proposes global updates based on the effective model. This enhancement leads to a substantial reduction in autocorrelation time, especially near the critical region, where traditional methods typically suffer from critical slowing down and increased computation complexity. Moreover, SLMC maintains statistical accuracy by implementing a cumulative update scheme that rigorously satisfies the detailed balance condition. And more recent applications have extended the SLMC to convolutional neural networks with applications not only in condensed matter physics but also high-energy physics, quantum chemistry, and quantum simulations. The generic applicability and high computational efficiency make SLMC a powerful and scalable framework for quantum Monte Carlo simulations of strongly correlated electron systems, extending the reach of numerical investigations beyond the limitations of conventional techniques.
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.
Quantum-Accelerated Monte Carlo Simulation of Complex Systems Quantum-accelerated Monte Carlo simulation represents a significant advancement in computational science, offering the potential to dramatically reduce the time required to simulate complex systems across diverse fields. This paper investigates the design and implementation of a quantum algorithm specifically tailored for accelerating Monte Carlo simulations, leveraging quantum entanglement to enhance efficiency and accuracy. We detail the core mechanism, outlining the strategic use of quantum algorithms to navigate the expansive solution space of these simulations. The paper explores the potential benefits and challenges associated with this approach, highlighting the transformative impact it could have on scientific discovery and technological innovation.
Quantum-inspired sampling is a novel approach to Monte Carlo simulations that aims to overcome the limitations of traditional methods by incorporating quantum-like phenomena – specifically superposition and entanglement – into the sampling process. This paper investigates the potential of utilizing these principles to accelerate convergence, enhance accuracy, and improve the overall efficiency of Monte Carlo simulations, particularly in complex systems. We present a theoretical framework and preliminary implementation demonstrating the effectiveness of this technique. The core mechanism focuses on manipulating the probability distribution to guide the search towards promising solutions, effectively leveraging quantum-inspired dynamics.
Quantum Monte Carlo (QMC) methods are among the central numerical tools for studying strongly correlated quantum many-body systems, particularly in higher dimensions. As quantum information has introduced new information-theoretic perspectives and diagnostics into many-body physics, QMC methods have accordingly been extended beyond the measurement of conventional linear observables. This review summarizes recent progress in adapting QMC to many-body quantum-information, focusing on qubit or spin-1/21/21/2 systems as a concrete setting while keeping the discussion broadly applicable to qudit and bosonic systems. We present a unified perspective on the extraction of nonlinear diagnostics, including entanglement entropies and entanglement spectra, Rényi negativities for mixed-state entanglement, stabilizer entropies for quantum magic, and decoherence-driven phenomena such as the interplay between imaginary-time evolution and decoherence and strong-to-weak spontaneous symmetry breaking.
To evaluate the effectiveness of machine learning in systems with competing interactions, we developed a self-learning quantum Monte Carlo (SLQMC) method to simulate the phase transition in the classical Holstein-spin-fermion model. In SLQMC, machine learning techniques are employed to approximate the free energy, thereby bypassing the need for exact diagonalization and significantly reducing computational cost. We assess the performance of SLQMC using both linear regression and neural network models. Our results show that both models are capable of capturing the phase transition from the antiferromagnetic state to the charge-density-wave state. However, the sampling efficiency decreases near the AFM-CDW phase transition, which is attributed to the increased mean-squared-error of the machine learning model. Additionally, the sampling efficiency decreases with increasing lattice size. This suppression is due to the increased root-mean-squared-error as the machine learning model is applied to a large lattice and the finite-size effect, wherein the energy gap between the ground state and low-energy excited states decreases as the lattice grows. Our findings highlight the necessity of highly accurate machine learning models to simulate theoretical models with complex, competing microscopic interactions on a large lattice.