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:hep-lat/0510041

An Efficient Cluster Algorithm for CP(N-1) Models

Bernard B. Beard, Michele Pepe A, S. Riederer, U.‐J. Wiese

Published Oct 6, 2005• 2 citations
arXivHTMLPDF

Abstract

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 to quantum field theory formulated in terms of discrete quantum variables instead of classical fields. Despite several attempts, no efficient cluster algorithm has been constructed for CP(N-1) models in the standard formulation of lattice field theory. In fact, there is even a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm. We present various simulations for different correlation lengths, couplings and lattice sizes. We have simulated correlation lengths up to 250 lattice spacings on lattices as large as 640x640 and we detect no evidence for critical slowing down.

DOI
10.48550/arxiv.hep-lat/0510041

Related papers

Efficient Cluster Algorithms for CP(N-1) Models

S. Riederer, Michele Pepe A, U.‐J. Wiese +1 more

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 to quantum field theory formulated in terms of discrete quantum variables instead of classical fields.Despite several attempts, no efficient cluster algorithm has been constructed for CP(N -1) models in the standard formulation of lattice field theory.In fact, there is even a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm.We present various simulations for different correlation lengths, couplings and lattice sizes.We have simulated correlation lengths up to 250 lattice spacings on lattices as large as 640×640 and we detect no evidence for critical slowing down.

Proceedings of XXIIIrd International Symposium on Lattice Field Theory — PoS(LAT2005)•Dec 14, 2005•0 citations

Parallelized traveling cluster approximation to study numerically spin-fermion models on large lattices

Anamitra Mukherjee, Niravkumar D. Patel, Chris Bishop +1 more

Lattice spin-fermion models are important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the "spins," are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The "traveling cluster approximation" (TCA) is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10(3) sites. In this publication, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. This allows us to solve generic spin-fermion models easily on 10(4) lattice sites and with some effort on 10(5) lattice sites, representing the record lattice sizes studied for this family of models.

arXiv:1502.07028•Physical Review E•Jun 8, 2015•24 citations

Blockspin Cluster Algorithms for Quantum Spin Systems

U.‐J. Wiese, H. -p. Ying

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 maped to blockspin models with two-blockspin interactions. Clusters of blockspins are updated collectively. The efficiency of the method is investigated in detail for one-dimensional spin chains. Then in most cases the new algorithms solve the problems of slowing down from which standard algorithms are suffering. Two-dimensional quantum spin systems are relevant for the description of the undoped anti-ferromagnetic precursor insulators of high-Tc superconductors. Presumably understanding the physics of the superconductors requires an understanding of their precursor insulators. This already is a nontrivial problem, which most likely does not allow for a complete analytic solution. Therefore it is natural to use a numerical approach to compute the properties of these materials. At present different

•Jan 1, 2008•30 citations

A new efficient cluster algorithm for the Ising model

Matthias Nyfeler, Michele Pepe A, U.‐J. Wiese

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 correlation function with high precision over a surprisingly large number of orders of magnitude.

arXiv:hep-lat/0510040•Proceedings of XXIIIrd International Symposium on Lattice Field Theory — PoS(LAT2005)•Dec 14, 2005•0 citations

Cluster algorithm for vertex models

Hans Gerd Evertz, Gideon Lana, Mihai Marcu

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 loop algorithm. The basic steps in constructing a cluster are the breakup and the freezing of vertices. We concentrate on the case of the F model, which is a subset of the six-vertex model exhibiting a Kosterlitz-Thouless transition. The loop algorithm is also applicable to simulations of other vertex models and of one- and two-dimensional quantum spin systems.

arXiv:cond-mat/9211006•Physical Review Letters•Feb 15, 1993•374 citations

Meron-Cluster Algorithms for Quantum Link Models

João C. Pinto Barros, Thea Budde, Marina Krstić Marinković

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 by the sign problem. We discuss the simulation of lattice gauge theories in the Hamiltonian formalism and present a generalized meron-cluster algorithm for the simulation of the $U\left(1\right)$ Quantum Link Model for spin $1/2$. This enables the study of models directly relevant to current quantum simulators and is a promising first step toward constructing new efficient algorithms for more complicated gauge theories.

arXiv:2402.01039•International Symposium on Lattice Field Theory (LATTICE)•May 4, 2024•4 citations
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 to quantum field theory formulated in terms of discrete quantum variables instead of classical fields. Despite several attempts, no efficient cluster algorithm has been constructed for CP(N-1) models in the standard formulation of lattice field theory. In fact, there is even a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm. We present various simulations for different correlation lengths, couplings and lattice sizes. We have simulated correlation lengths up to 250 lattice spacings on lattices as large as 640x640 and we detect no evidence for critical slowing down.
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 to quantum field theory formulated in terms of discrete quantum variables instead of classical fields.Despite several attempts, no efficient cluster algorithm has been constructed for CP(N -1) models in the standard formulation of lattice field theory.In fact, there is even a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm.We present various simulations for different correlation lengths, couplings and lattice sizes.We have simulated correlation lengths up to 250 lattice spacings on lattices as large as 640×640 and we detect no evidence for critical slowing down.
Lattice spin-fermion models are important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the "spins," are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The "traveling cluster approximation" (TCA) is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10(3) sites. In this publication, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. This allows us to solve generic spin-fermion models easily on 10(4) lattice sites and with some effort on 10(5) lattice sites, representing the record lattice sizes studied for this family of models.
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 maped to blockspin models with two-blockspin interactions. Clusters of blockspins are updated collectively. The efficiency of the method is investigated in detail for one-dimensional spin chains. Then in most cases the new algorithms solve the problems of slowing down from which standard algorithms are suffering. Two-dimensional quantum spin systems are relevant for the description of the undoped anti-ferromagnetic precursor insulators of high-Tc superconductors. Presumably understanding the physics of the superconductors requires an understanding of their precursor insulators. This already is a nontrivial problem, which most likely does not allow for a complete analytic solution. Therefore it is natural to use a numerical approach to compute the properties of these materials. At present different
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 loop algorithm. The basic steps in constructing a cluster are the breakup and the freezing of vertices. We concentrate on the case of the F model, which is a subset of the six-vertex model exhibiting a Kosterlitz-Thouless transition. The loop algorithm is also applicable to simulations of other vertex models and of one- and two-dimensional quantum spin systems.
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 by the sign problem. We discuss the simulation of lattice gauge theories in the Hamiltonian formalism and present a generalized meron-cluster algorithm for the simulation of the U(1)U\left(1\right)U(1) Quantum Link Model for spin 1/21/21/2. This enables the study of models directly relevant to current quantum simulators and is a promising first step toward constructing new efficient algorithms for more complicated gauge theories.