Simulating the all-order strong coupling expansion. IV: CP(N - 1) as a loop model

DOI10.1016/J.NUCLPHYSB.2010.02.005zbMATH Open1204.82014OpenAlexW2526476377MaRDI QIDQ622686FDOQ622686

Authors U. Wolff

Publication date 3 February 2011

Published in Nuclear Physics B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1001.2231

zbMATH Keywords

Monte Carlo algorithmslattice field theoryspin models

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Model quantum field theories (81T10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Quantum field theory on lattices (81T25)

Abstract: 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 tested that samples the loop model with its configurations stored and manipulated as a linked list. Complete absence of critical slowing down and correspondingly small errors are found at D=2 for several observables including the mass gap. Using two different standard lattice actions universality is demonstrated in a finite size scaling study. The topological charge is identified in the loop model but not yet investigated numerically.

Recommendations

• Simulating the all-order strong coupling expansion. III: \(O(N)\) sigma/loop models
• Worm algorithm for the \(\mathbb{C} \mathrm{P}^{N - 1}\) model
• Efficient cluster algorithm for \(CP(N - 1)\) models
• Numerical simulations in CP\(^3\) model with \(\theta\)-term
• Simulating the all-order strong coupling expansion. I: Ising model demo

Cites work

• scientific article; zbMATH DE number 274399 (Why is no real title available?)
• Critical loop gases and the worm algorithm
• Efficient cluster algorithm for \(CP(N - 1)\) models
• Monte Carlo errors with less errors
• Nonlinear σ model at θ=π: Euclidean lattice formulation and solid-on-solid models
• Simulating the all-order strong coupling expansion. I: Ising model demo
• Simulating the all-order strong coupling expansion. III: \(O(N)\) sigma/loop models

Cited in

(10)

• A geometric Monte Carlo algorithm for the antiferromagnetic Ising model with ``topological term at \(\theta = \pi\)
• Simulating the all-order strong coupling expansion. V: Ising gauge theory
• Complex Langevin and other approaches to the sign problem in quantum many-body physics
• Worm algorithm for the \(\mathbb{C} \mathrm{P}^{N - 1}\) model
• The worm process for the Ising model is rapidly mixing
• The \(O(n)\) loop model on a three-dimensional lattice
• Simulating the all-order strong coupling expansion. III: \(O(N)\) sigma/loop models
• Efficient cluster algorithm for \(CP(N - 1)\) models
• \(\mathrm{SU}(3)\) quantum spin ladders as a regularization of the \(\mathbb CP(2)\) model at non-zero density: from classical to quantum simulation
• Dual lattice representations for \(\mathrm{O}(N)\) and \(\mathrm{CP}(N - 1)\) models with a chemical potential

Describes a project that uses

Uses Software

• POT4A

This page was built for publication: Simulating the all-order strong coupling expansion. IV: \(CP(N - 1)\) as a loop model

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