Efficient cluster algorithm for CP(N - 1) models

DOI10.1016/J.CPC.2006.06.007MaRDI QIDQ709946zbMATHOpenAlexFDO

Authors D. Kharzeev

Publication date 18 October 2010

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/hep-lat/0602018

zbMATH Keywords

dimensional reductionspontaneous symmetry breakingcritical slowing downcluster algorithm\(CP(N1)\) models

Mathematics Subject Classification ID

Symmetry breaking in quantum theory (81R40) Yang-Mills and other gauge theories in quantum field theory (81T13) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum field theory on lattices (81T25)

Abstract: 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 Wolff-type embedding algorithm. In this paper, we construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a regularization for CP(N-1) models in the framework of D-theory. We present detailed studies of the autocorrelations and find a dynamical critical exponent that is consistent with z = 0.

Recommendations

• Worm algorithm for the \(\mathbb{C} \mathrm{P}^{N - 1}\) model
• Simulating the all-order strong coupling expansion. IV: \(CP(N - 1)\) as a loop model
• Cluster Monte Carlo: Extending the range
• Cluster algorithms for anisotropic quantum spin models.
• A cluster algorithm for lattice gauge theories

Cites work

• -Vacuum: Phase Transitions and/or Symmetry Breaking at   =
• D-theory: field quantization by dimensional reduction of discrete variables
• From spin ladders to the 2D O(3) model at non-zero density
• Maximum Entropy Method Approach to the   Term
• Non-Abelian bosonization in two dimensions
• Recent Developments of World-Line Monte Carlo Methods

Cited in

(7)

• Simulating the all-order strong coupling expansion. IV: \(CP(N - 1)\) as a loop model
• Generalizing the Tomboulis-Yaffe inequality to \(SU(N)\) lattice gauge theories and general classical spin systems
• A surface cluster algorithm for the U(1) quantum link model
• Worm algorithm for the \(\mathbb{C} \mathrm{P}^{N - 1}\) model
• Simulating the all-order strong coupling expansion. III: \(O(N)\) sigma/loop models
• Progress in numerical simulations of systems with a \(\theta \)-vacuum like term: The two- and three-dimensional Ising model within an imaginary magnetic field
• \(\mathrm{SU}(3)\) quantum spin ladders as a regularization of the \(\mathbb CP(2)\) model at non-zero density: from classical to quantum simulation

This page was built for publication: Efficient cluster algorithm for \(CP(N - 1)\) models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709946)