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

Physics Reports

Monte Carlo simulation of quantum statistical lattice models

Hans A. De Raedt, Ad Lagendijk

Published Oct 1, 1985• 188 citations
Publisher
DOI
10.1016/0370-1573(85)90044-4

Related papers

Quantum Monte Carlo on a Lattice

Jan Tobochnik, G. G. Batrouni, Harvey Gould

Computers in Physics•Nov 1, 1992•5 citations

Quantum Error Correction and Z(2) Lattice Gauge Theories

Seyong Kim

$Z(2)$ lattice gauge theory plays an important role in the study of the threshold probability of Quantum Error Correction (QEC) for a quantum code. For certain QEC codes, such as the well-known Kitaev's toric/surface code, one can find a mapping of the QEC decoding problem onto a statistical mechanics model for a given noise model. The investigation of the threshold probability then corresponds to that of the phase diagram of the mapped statistical mechanics model. This can be studied by Monte Carlo simulation of the statistical mechanics model. In~\cite{Rispler}, we investigate the effects of realistic noise models on the toric/surface code in two dimensions together with syndrome measurement noise and introduce the random coupled-plaquette gauge model, 3-dimensional $Z(2) \times Z(2)$ lattice gauge theory. This new Z(2) gauge theory model captures main aspects of toric/surface code under depolarizing and syndrome noise. In these proceedings, we mainly focus on the aspects of Mont Carlo simulation and discuss preliminary results from Monte Carlo simulations of mapped classes of Z(2) lattice theories.

arXiv:2501.13611•International Symposium on Lattice Field Theory (LATTICE)•Jan 30, 2025•0 citations

Historical Review on Analytic, Monte Carlo, and Renormalization Group Approaches to Critical Phenomena of Some Lattice Models

Chin‐Kun Hu

Analytic calculations, Monte Carlo (MC) simulations [N. Metropolis and S. Ulam, J. Am. Stat. Asso 44, 335 (1949)] and renormalization group (RG) theory [K. G. Wilson, Phys. Rev. B 4, 3174 and 3184 (1971)] are important methods of statistical physics to study phase transitions and critical phenomena. This paper gives a brief historical review on analytic, MC, and RG approaches to some lattice critical systems in memory of late Professors Shang-keng Ma (1940-1983) and Yu-Ming Shih (1942-2005), who played some key roles in early developments of statistical physics of critical phenomena in Taiwan. The paper first introduces some developments in the study of critical phenomena from late 19th century to early 70s in the 20th century when renormalization group theory was formulated. The paper then reviews some topics on analytic, Monte Carlo, and RG approach to some lattice models, including variational RG approach to the Ising model, slow relaxation of a spin glass model at low temperatures, iterative method for quantum spin models, percolation theory of critical phenomena of Ising-like models and hard-core particle model, histogram Monte Carlo method and histogram Monte Carlo RG method, universal finite-size scaling functions of lattice models, critical slowing down of the Ising model, finite-size corrections for critical lattice models, and self-organized critical systems. Such topics are closely related to the author's own research experience. Finally, the paper outlines some very recent developments, summarizes main results of this paper, and points out some interesting problems for further studies, e.g. why a biological system can maintain in a non-equilibrium state for a very long time.

Chinese Journal of Physics•Feb 1, 2014•46 citations

General Review of Quantum Statistical Monte Carlo Methods

Masuo Suzuki

Springer series in solid-state sciences•Jan 1, 1987•7 citations

METHODS IN QUANTUM MONTE CARLO

Malvin H. Kalos, G.A. Mikhailov

De Gruyter eBooks•Dec 31, 1987•0 citations

GPU Accelerated Monte Carlo Algorithm of Ising Model on Triangular Lattice

Wei Zhang

In the statistical model,the efficiency of most Monte Carlo algorithm reduces quickly near the critical point.In the analysis of traditional local algorithms,a GPU-based parallel simulation algorithm on the triangular lattice Ising model,which greatly improves the efficiency of the Monte Carlo simulation,is raised.For the model with the size of 1 024×1 024,a speedup of 69 is achieved.Besides,the critical behavior is analyzed,a high-precision critical point(βc=0.274 66(1)) and critical exponents(yt= 1.01(2),yh= 1.875 6(3)) of triangular lattice Ising model are obtained,which implies the effectiveness of the GPU algorithm.

Science Technology and Engineering•Jan 1, 2012•0 citations
Z(2)Z(2)Z(2) lattice gauge theory plays an important role in the study of the threshold probability of Quantum Error Correction (QEC) for a quantum code. For certain QEC codes, such as the well-known Kitaev's toric/surface code, one can find a mapping of the QEC decoding problem onto a statistical mechanics model for a given noise model. The investigation of the threshold probability then corresponds to that of the phase diagram of the mapped statistical mechanics model. This can be studied by Monte Carlo simulation of the statistical mechanics model. In~\cite{Rispler}, we investigate the effects of realistic noise models on the toric/surface code in two dimensions together with syndrome measurement noise and introduce the random coupled-plaquette gauge model, 3-dimensional Z(2)×Z(2)Z(2) \times Z(2)Z(2)×Z(2) lattice gauge theory. This new Z(2) gauge theory model captures main aspects of toric/surface code under depolarizing and syndrome noise. In these proceedings, we mainly focus on the aspects of Mont Carlo simulation and discuss preliminary results from Monte Carlo simulations of mapped classes of Z(2) lattice theories.
Analytic calculations, Monte Carlo (MC) simulations [N. Metropolis and S. Ulam, J. Am. Stat. Asso 44, 335 (1949)] and renormalization group (RG) theory [K. G. Wilson, Phys. Rev. B 4, 3174 and 3184 (1971)] are important methods of statistical physics to study phase transitions and critical phenomena. This paper gives a brief historical review on analytic, MC, and RG approaches to some lattice critical systems in memory of late Professors Shang-keng Ma (1940-1983) and Yu-Ming Shih (1942-2005), who played some key roles in early developments of statistical physics of critical phenomena in Taiwan. The paper first introduces some developments in the study of critical phenomena from late 19th century to early 70s in the 20th century when renormalization group theory was formulated. The paper then reviews some topics on analytic, Monte Carlo, and RG approach to some lattice models, including variational RG approach to the Ising model, slow relaxation of a spin glass model at low temperatures, iterative method for quantum spin models, percolation theory of critical phenomena of Ising-like models and hard-core particle model, histogram Monte Carlo method and histogram Monte Carlo RG method, universal finite-size scaling functions of lattice models, critical slowing down of the Ising model, finite-size corrections for critical lattice models, and self-organized critical systems. Such topics are closely related to the author's own research experience. Finally, the paper outlines some very recent developments, summarizes main results of this paper, and points out some interesting problems for further studies, e.g. why a biological system can maintain in a non-equilibrium state for a very long time.
In the statistical model,the efficiency of most Monte Carlo algorithm reduces quickly near the critical point.In the analysis of traditional local algorithms,a GPU-based parallel simulation algorithm on the triangular lattice Ising model,which greatly improves the efficiency of the Monte Carlo simulation,is raised.For the model with the size of 1 024×1 024,a speedup of 69 is achieved.Besides,the critical behavior is analyzed,a high-precision critical point(βc=0.274 66(1)) and critical exponents(yt= 1.01(2),yh= 1.875 6(3)) of triangular lattice Ising model are obtained,which implies the effectiveness of the GPU algorithm.