Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The European Physical Journal B

Heisenberg-antiferromagnet and loop-soup

Franz J. Wagner

Published Jun 1, 1991• 3 citations
Publisher
DOI
10.1007/bf01313228

Related papers

Loop-cluster algorithm: an application for the 2D quantum Heisenberg antiferromagnet

He-Ping Ying, U.‐J. Wiese, JI DA-REN

Physics Letters A•Dec 1, 1993•15 citations

Solvable models for 2+1D quantum critical points: Loop soups of 1+1D conformal field theories

Amin Moharramipour, Dan Sehayek, Thomas Scaffidi

We construct a class of solvable models for 2+1D quantum critical points by attaching 1+1D conformal field theories (CFTs) to fluctuating domain walls forming a “loop soup”. Specifically, our local Hamiltonian attaches gapless spin chains to the domain walls of a triangular lattice Ising antiferromagnet. The macroscopic degeneracy between antiferromagnetic configurations is split by the Casimir energy of each decorating CFT, which is usually negative and thus favors a short loop phase with a finite gap. However, we found a set of 1D CFT Hamiltonians for which the Casimir energy is effectively positive, making it favorable for domain walls to coalesce into a single “snake” which is macroscopically long and thus hosts a CFT with a vanishing gap. The snake configurations are geometrical objects also known as fully-packed self-avoiding walks or Hamiltonian walks which are described by an \mathrm{O} O (n=0) loop ensemble with a non-unitary 2+0D CFT description. Combining this description with the 1+1D decoration CFT, we obtain a 2+1D theory with unusual critical exponents and entanglement properties. Regarding the latter, we show that the log contributions from the decoration CFTs conspire with the spatial distribution of loops crossing the entanglement cut to generate a “non-local area law”. Our predictions are verified by Monte Carlo simulations.

arXiv:2310.00037•SciPost Physics•Feb 28, 2024•1 citation

The antiferromagnetic Heisenberg cube

P.N. Moustanis, Stavros Thanos

Physica B Condensed Matter•Sep 1, 1994•2 citations

The Heisenberg Spin Chain

Carlo Heissenberg, Augusto Sagnotti

Cambridge University Press eBooks•Jan 6, 2022•0 citations

Quantum Cluster Algorithm Monte Carlo Method and Its Application to Higher-Spin Heisenberg Antiferromagnets

Synge Todo

The quantum Monte Carlo technique for quantum magnets has been greatly improved during the last decade. In this paper, we review the quantum cluster algorithm (loop algorithm) for higher-spin Heisenberg antiferromagnets, together with some technical aspects including parallelization technique and with its application to low-dimensional Heisenberg antiferromagnets.

Progress of Theoretical Physics Supplement•Jan 1, 2002•3 citations

Heisenberg Spin Chain

WORLD SCIENTIFIC eBooks•Sep 1, 1996•4 citations
We construct a class of solvable models for 2+1D quantum critical points by attaching 1+1D conformal field theories (CFTs) to fluctuating domain walls forming a “loop soup”. Specifically, our local Hamiltonian attaches gapless spin chains to the domain walls of a triangular lattice Ising antiferromagnet. The macroscopic degeneracy between antiferromagnetic configurations is split by the Casimir energy of each decorating CFT, which is usually negative and thus favors a short loop phase with a finite gap. However, we found a set of 1D CFT Hamiltonians for which the Casimir energy is effectively positive, making it favorable for domain walls to coalesce into a single “snake” which is macroscopically long and thus hosts a CFT with a vanishing gap. The snake configurations are geometrical objects also known as fully-packed self-avoiding walks or Hamiltonian walks which are described by an \mathrm{O} O (n=0) loop ensemble with a non-unitary 2+0D CFT description. Combining this description with the 1+1D decoration CFT, we obtain a 2+1D theory with unusual critical exponents and entanglement properties. Regarding the latter, we show that the log contributions from the decoration CFTs conspire with the spatial distribution of loops crossing the entanglement cut to generate a “non-local area law”. Our predictions are verified by Monte Carlo simulations.