相关论文: Efficient Cluster Algorithm for CP(N-1) Models
We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach…
D-theory provides an alternative lattice regularization of the (1+1)-d CP(N-1) quantum field theory. In this formulation the continuous classical CP(N-1) fields emerge from the dimensional reduction of discrete SU(N) quantum spins. In…
We present numerical results for 2-d CP(N-1) models at \theta=0 and \pi obtained in the D-theory formulation. In this formulation we construct an efficient cluster algorithm and we show numerical evidence for a first order transition for…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
We present a numerical study using a cluster algorithm for the 1-d $S=1/2$ quantum Heisenberg models. The dynamical critical exponent for anti-ferromagnetic chains is $z=0.0(1)$ such that critical slowing down is eliminated.
The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…
We exactly reformulate the lattice CP(N-1) spin model on a D dimensional torus as a loop model whose configurations correspond to the complete set of strong coupling graphs of the original system. A Monte Carlo algorithm is described and…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
The (discrete) Gross-Neveu model is studied in a lattice realization with an N-component Majorana Wilson fermion field. It has an internal O(N) symmetry in addition to the euclidean lattice symmetries. The discrete chiral symmetry for…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
We investigate the critical behavior of three-dimensional ferromagnetic CP(N-1) models, which are characterized by a global U(N) and a local U(1) symmetry. We perform numerical simulations of a lattice model for N=2, 3, and 4. For N=2 we…
We calculate the dynamic critical exponent for the Niedermayer algorithm applied to the two-dimensional Ising and XY models, for various values of the free parameter $E_0$. For $E_0=-1$ we regain the Metropolis algorithm and for $E_0=1$ we…
Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins. The performance of the multi-cluster…
We demonstrate how correlation functions for non-diagonal operators can be measured with the loop-cluster algorithm for quantum spin models. We introduce the U(1) quantum link model and present the construction of a cluster algorithm for…
In this paper we lay special stress on analyzing the topological properties of the lattice systems and try to ovoid the conventional ways to calculate the critical points. Only those clusters with finite sizes can execute the self similar…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…
We study the performance of a Wolff-type embedding algorithm for $RP^N$ $\sigma$-models. We find that the algorithm in which we update the embedded Ising model \`a la Swendsen-Wang has critical slowing-down as $z_\chi \approx 1$. If instead…