Efficient cluster algorithm for \(CP(N - 1)\) models

DOI10.1016/j.cpc.2006.06.007zbMath1196.81186arXivhep-lat/0602018OpenAlexW1610027529MaRDI QIDQ709946

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

cluster algorithmdimensional reductionspontaneous symmetry breakingcritical slowing down\(CP(N1)\) models

Mathematics Subject Classification ID

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

Related Items (5)

Generalizing the Tomboulis-Yaffe inequality to \(SU(N)\) lattice gauge theories and general classical spin systems ⋮ Simulating the all-order strong coupling expansion. IV: \(CP(N - 1)\) as a loop 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

Cites Work

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

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