Cluster Monte Carlo Algorithm for the Quantum Rotor Model
Abstract
We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the pure quantum rotor model with μ=0 the new algorithm yields high precision estimates for the critical point Kc=0.33305(5) and the correlation length exponent =0.670(3). For the disordered case, μ=1/2 1/2, we find =1.15(10).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.