Related papers: An Efficient Cluster Algorithm for CP(N-1) Models
Despite several attempts, no efficient cluster algorithm has been constructed for CP(N-1) models in the standard Wilson formulation of lattice field theory. In fact, there is a no-go theorem that prevents the construction of an efficient…
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…
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…
A new non-perturbative approach to quantum field theory --- D-theory --- is proposed, in which continuous classical fields are replaced by discrete quantized variables which undergo dimensional reduction. The 2-d classical O(3) model…
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…
Field theories are usually quantized by performing a path integral over configurations of classical fields. This is the case both in perturbation theory and in Wilson's nonperturbative lattice field theory. D-theory is an alternative…
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…
Quantum simulations would be highly desirable in order to investigate the finite density physics of QCD. $(1+1)$-d $\mathbb{C}P(N-1)$ quantum field theories are toy models that share many important features of QCD: they are asymptotically…
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 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…
Within a general cluster framework, we discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For…
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…
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…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
The 2d CP(N-1) models share a number of features with QCD, like asymptotic freedom, a dynamically generated mass gap and topological sectors. They have been formulated and analysed successfully in the framework of the so-called D-theory,…
A new approximate scheme, DSUB$m$, is described for the coupled cluster method. We then apply it to two well-studied (spin-1/2 Heisenberg antiferromagnet) spin-lattice models, namely: the $XXZ$ and the $XY$ models on the square lattice in…
Measurement-based quantum computation, an alternative paradigm for quantum information processing, uses simple measurements on qubits prepared in cluster states, a class of multiparty entangled states with useful properties. Here we propose…
In this work we experimentally study the efficiency of various dynamical decoupling sequences for suppressing decoherence of single as well as multiple quantum coherences on large spin-clusters. The system involves crystallites of a…