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:1404.4777 · Journal of Statistical Physics

Efficient Algorithms for the Two-Dimensional Ising Model with a Surface Field

Xintian Wu

Published Sep 12, 2014• 6 citations
arXivHTMLPDF
DOI
10.1007/s10955-014-1109-5

Related papers

Surface and corner magnetizations in the two-dimensional Ising model

Christian Kaiser, Ingo Peschel

Journal of Statistical Physics•Feb 1, 1989•30 citations

The surface critical exponent η⊥ in the two dimensional Ising model

J. Kroemer, W. Pesch

Physics Letters A•Mar 1, 1979•3 citations

Efficient quantum cluster algorithms for frustrated transverse field Ising antiferromagnets and Ising gauge theories

Biswas, Sounak, Kedar Damle

Working within the Stochastic Series Expansion (SSE) framework, we construct efficient quantum cluster algorithms for transverse field Ising antiferromagnets on the pyrochlore lattice and the planar pyrochlore lattice, for the fully frustrated square lattice Ising model in a transverse field (dual to the 2+1 dimensional odd Ising gauge theory), and for a transverse field Ising model with multi-spin interactions on the square lattice, which is dual to a 2+1 dimensional even Ising gauge theory (and reduces to the two dimensional quantum loop model in a certain limit). Our cluster algorithms use a microcanonical update procedure that generalizes and exploits the notion of "pre-marked motifs" introduced earlier in the context of a quantum cluster algorithm for triangular lattice transverse field Ising antiferromagnets. We demonstrate that the resulting algorithms are significantly more efficient than the standard link percolation based quantum cluster approach. We also introduce a new canonical update scheme that leads to a further improvement in measurement of some observables arising from its ability to make one-dimensional clusters in the "imaginary time" direction. Finally, we demonstrate that refinements in the choice of premarking strategies can lead to additional improvements in the efficiency of the microcanonical updates. As a first example of the physics that can be studied using these algorithmic developments, we obtain evidence for a power-law ordered intermediate-temperature phase associated with the two-step melting of long-range order in the fully frustrated square lattice transverse field Ising model.

arXiv:1812.05326•Dec 13, 2018•5 citations

A fast algorithm for investigations on the three-dimensional Ising model

Michael J. Creutz, P. Mitra, Kevin J. M. Moriarty

Computer Physics Communications•Oct 1, 1984•13 citations

Numerical Analysis of 2-D Ising Model

Ishita Agarwal

•Jan 1, 2011•1 citation

$2D$ and $3D$ Antiferromagnetic Ising Model with topological term at $θ=π$

V. Azcoiti, Gennaro Cortese, E. Follana +1 more

We study the two and three-dimensional Antiferromagnetic Ising Model with an imaginary magnetic field $iθ$ at $θ= π$. We use a new geometric algorithm which does not present a sign problem. This allows us to perform efficient numerical simulations of this system.

arXiv:1312.6847•Dec 24, 2013•1 citation
Working within the Stochastic Series Expansion (SSE) framework, we construct efficient quantum cluster algorithms for transverse field Ising antiferromagnets on the pyrochlore lattice and the planar pyrochlore lattice, for the fully frustrated square lattice Ising model in a transverse field (dual to the 2+1 dimensional odd Ising gauge theory), and for a transverse field Ising model with multi-spin interactions on the square lattice, which is dual to a 2+1 dimensional even Ising gauge theory (and reduces to the two dimensional quantum loop model in a certain limit). Our cluster algorithms use a microcanonical update procedure that generalizes and exploits the notion of "pre-marked motifs" introduced earlier in the context of a quantum cluster algorithm for triangular lattice transverse field Ising antiferromagnets. We demonstrate that the resulting algorithms are significantly more efficient than the standard link percolation based quantum cluster approach. We also introduce a new canonical update scheme that leads to a further improvement in measurement of some observables arising from its ability to make one-dimensional clusters in the "imaginary time" direction. Finally, we demonstrate that refinements in the choice of premarking strategies can lead to additional improvements in the efficiency of the microcanonical updates. As a first example of the physics that can be studied using these algorithmic developments, we obtain evidence for a power-law ordered intermediate-temperature phase associated with the two-step melting of long-range order in the fully frustrated square lattice transverse field Ising model.
2D2D2D and 3D3D3D Antiferromagnetic Ising Model with topological term at θ=πθ=πθ=π
We study the two and three-dimensional Antiferromagnetic Ising Model with an imaginary magnetic field iθiθiθ at θ=πθ= πθ=π. We use a new geometric algorithm which does not present a sign problem. This allows us to perform efficient numerical simulations of this system.