Using a blockspin scheme, a cluster algorithm is developed for the numerical study of the quantum spin systems. The method is tested in detail for the ferro- and antiferromagnetic Heisenberg chains, of which our calculations show that the new algorithm can be used to simulate the induced classical spin systems efficiently by strongly reducing the slowing down effects.

Communications in Theoretical PhysicsJun 15, 19940 citations

arXiv:cond-mat/0701331 · International Journal of Modern Physics C

SPIN CHAIN SIMULATIONS WITH A MERON CLUSTER ALGORITHM

Thomas Boyer‐Kassem, Wolfgang Bietenholz A, JAIR WUILLOUD

Published Sep 1, 2007• 6 citations

arXiv HTML PDF

Abstract

DOI: 10.1142/s0129183107011510

Related papers

SPIN CHAIN SIMULATIONS WITH A MERON CLUSTER ALGORITHM

Thomas Boyer‐Kassem, Wolfgang Bietenholz A, J. Wuilloud

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.

Jan 1, 20076 citations

Meron-Cluster Simulation of Quantum Spin Ladders in a Magnetic Field

Shailesh Chandrasekharan A, B. Scarlet, U.‐J. Wiese

Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to quantum spin systems in an arbitrary external magnetic field, in which case standard cluster algorithms fail. As an example, we simulate antiferromagnetic quantum spin ladders in a uniform external magnetic field that competes with the spin-spin interaction. The numerical results are in agreement with analytic predictions for the magnetization as a function of the external field.Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Meron-cluster algorithms lead to an efficient solution of sign problems for both fermionic and bosonic models. Here we apply the meron concept to quantum spin systems in an arbitrary external magnetic field, in which case standard cluster algorithms fail. As an example, we simulate antiferromagnetic quantum spin ladders in a uniform external magnetic field that competes with the spin-spin interaction. The numerical results are in agreement with analytic predictions for the magnetization as a function of the external field.

arXiv:cond-mat/9909451Sep 30, 19992 citations

Meron-cluster simulation of the quantum antiferromagnetic Heisenberg model in a magnetic field in one- and two-dimensions

Palma, A. Riveros

Motivated by the numerical simulation of systems which display quantum phase transitions, we present a novel application of the meron-cluster algorithm to simulate the quantum antiferromagnetic Heisenberg model coupled to an external uniform magnetic field both in one and in two dimensions.In the infinite volume limit and at zero temperature we found numerical evidence that supports a quantum phase transition very close to the critical values B c = 2 and B c = 4 for the system in one and two dimensions, respectively.For the one dimensional system, we have compared the numerical data obtained with analytical predictions for the magnetization density as a function of the external field obtained by scaling-behaviour analysis and Bethe Ansatz techniques.Since there is no analytical solution for the two dimensional case, we have compared our results with the magnetization density obtained by scaling relations for small lattice sizes and with the approximated thermodynamical limit at zero temperature guessed by scaling relations.Moreover, we have compared the numerical data with other numerical simulations performed by using different algorithms in one and two dimensions, like the directed loop method.The numerical data obtained are in perfect agreement with all these previous results, which confirms that the meron-algorithm is reliable for quantum Monte Carlo simulations and applicable both in one and two dimensions.Finally, we have computed the integrated autocorrelation time to measure the efficiency of the meron algorithm in one dimension.Motivated by the numerical simulation of systems which display quantum phase transitions, we present a novel application of the meron-cluster algorithm to simulate the quantum antiferromagnetic Heisenberg model coupled to an external uniform magnetic field both in one and in two dimensions.In the infinite volume limit and at zero temperature we found numerical evidence that supports a quantum phase transition very close to the critical values B c = 2 and B c = 4 for the system in one and two dimensions, respectively.For the one dimensional system, we have compared the numerical data obtained with analytical predictions for the magnetization density as a function of the external field obtained by scaling-behaviour analysis and Bethe Ansatz techniques.Since there is no analytical solution for the two dimensional case, we have compared our results with the magnetization density obtained by scaling relations for small lattice sizes and with the approximated thermodynamical limit at zero temperature guessed by scaling relations.Moreover, we have compared the numerical data with other numerical simulations performed by using different algorithms in one and two dimensions, like the directed loop method.The numerical data obtained are in perfect agreement with all these previous results, which confirms that the meron-algorithm is reliable for quantum Monte Carlo simulations and applicable both in one and two dimensions.Finally, we have computed the integrated autocorrelation time to measure the efficiency of the meron algorithm in one dimension.

arXiv:1312.4915Condensed Matter PhysicsMay 25, 20158 citations

Testing Haldane's conjecture in the O(3) model by a meron cluster simulation

Wolfgang Bietenholz A, Andrew V. Pochinsky, U.‐J. Wiese

Twelve years ago, Haldane formulated his famous conjecture for 1-d antiferromagnetic quantum spin chains. In the context of the 2-d O(3) model with a \\theta term, it predicts a phase transition at \\theta = \\pi, which has not yet been verified reliably. To simulate this we use the Wolff cluster algorithm together with an improved estimator for the topological charge distribution. Each cluster carries integer or half integer charge. Clusters with charge 1/2 are identified with merons. At \\theta = \\pi they are inactive, such that the mass gap vanishes. We obtain critical exponents which are consistent with predictions from the k=1 WZNW model, therefore confirming a second order phase transition.Twelve years ago, Haldane formulated his famous conjecture for 1-d antiferromagnetic quantum spin chains. In the context of the 2-d O(3) model with a \\theta term, it predicts a phase transition at \\theta = \\pi, which has not yet been verified reliably. To simulate this we use the Wolff cluster algorithm together with an improved estimator for the topological charge distribution. Each cluster carries integer or half integer charge. Clusters with charge 1/2 are identified with merons. At \\theta = \\pi they are inactive, such that the mass gap vanishes. We obtain critical exponents which are consistent with predictions from the k=1 WZNW model, therefore confirming a second order phase transition.

Jan 1, 19954 citations

Cluster Monte Carlo algorithm for the quantum rotor model

Fabien Alet, Erik Schwartz Sørensen

We propose a highly efficient ``worm''-like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the algorithm even in the presence of disorder. For the pure quantum rotor model with $\ensuremath{\mu}=0,$ the algorithm yields high- precision estimates for the critical point ${K}_{c}=0.33305(5)$ and the correlation length exponent $\ensuremath{\nu}=0.670(3).$ For the disordered case, $\ensuremath{\mu}=\frac{1}{2}\ifmmode\pm\else\textpm\fi{}\frac{1}{2},$ we find $\ensuremath{\nu}=1.15(10).$We propose a highly efficient ``worm''-like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the algorithm even in the presence of disorder. For the pure quantum rotor model with $\ensuremath{\mu}=0,$ the algorithm yields high- precision estimates for the critical point ${K}_{c}=0.33305(5)$ and the correlation length exponent $\ensuremath{\nu}=0.670(3).$ For the disordered case, $\ensuremath{\mu}=\frac{1}{2}\ifmmode\pm\else\textpm\fi{}\frac{1}{2},$ we find $\ensuremath{\nu}=1.15(10).$

arXiv:cond-mat/0211262Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsJan 31, 200383 citations

An Efficient Cluster Algorithm and Its Numerical Study for the Quantum Spin systems

He-Ping Ying, JI DA-REN

Communications in Theoretical PhysicsJun 15, 19940 citations

{K}_{c}=0.33305(5)

and the correlation length exponent $\ensuremath{\nu}=0.670(3).$ For the disordered case, $\ensuremath{\mu}=\frac{1}{2}\ifmmode\pm\else\textpm\fi{}\frac{1}{2},$ we find $\ensuremath{\nu}=1.15(10).$