Efficient Monte Carlo algorithm in quasi-one-dimensional Ising spin systems

Abstract

We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with highly anisotropic exchange interactions. Both correlation time and real CPU time are reduced drastically. The algorithm is demonstrated in the layered triangular-lattice antiferromagnetic Ising model. We have obtained the relation between the transition temperature and the exchange interaction parameters, which modifies the result of the chain-mean-field theory.

4 pages, 3 figures

References in corpus (3)

• Ordered Phases and Phase Transitions in The Stacked Triangular Ising Antiferromagnet CsCoCl${}_3$ and CsCoBr${}_3$
• Spin-lattice model of Magneto-electric Transitions in RbCoBr${}_3$
• Universal Reduction of Effective Coordination Number in the Quasi-One-Dimensional Ising Model

Cited by in corpus (5)

• Evidence of columnar order in the fully frustrated transverse field Ising model on the square lattice
• Simulating the Transverse Field Ising Model on the Kagome Lattice using a Programmable Quantum Annealer
• A method to reduce the rejection rate in Monte Carlo Markov Chains
• Quantum-thermal annealing with cluster-flip algorithm
• Bulk and Boundary Quantum Phase Transitions in a Square Rydberg Atom Array