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

DOI10.1016/j.nuclphysb.2010.02.005zbMath1204.82014arXiv1001.2231OpenAlexW2526476377MaRDI QIDQ622686

Ulli 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

spin modelslattice field theoryMonte Carlo algorithms

Mathematics Subject Classification ID

Related Items (7)

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

Uses Software

• POT4A

Cites Work

• Unnamed Item
• Critical loop gases and the worm algorithm
• Monte Carlo errors with less errors
• Efficient cluster algorithm for \(CP(N - 1)\) 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
• Nonlinear σ model at θ=π: Euclidean lattice formulation and solid-on-solid models

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