Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 271

The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.

The loop algorithm

Open access
Evertz, H. G.·2003·Advances in Physics

Abstract

A review of the loop algorithm , its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a quantum Monte Carlo procedure that employs non-local changes of worldline configurations, determined by local stochastic decisions. It is based on a formulation of quantum models of any dimension in an extended ensemble of worldlines and graphs, and is related to Swendsen-Wang algorithms. It can be represented directly on an operator level, both with a continuous imaginary time path integral and with the stochastic series expansion. It overcomes many of the difficulties of traditional worldline simulations. Autocorrelations are reduced by orders of magnitude. Grand-canonical ensembles, off-diagonal operators, and variance reduced estimators are accessible. In some cases, infinite systems can be simulated. For a restricted class of models, the fermion sign problem can be overcome. Transverse magnetic fields are handled efficiently, in contrast to strong diagonal fields. The method has been applied successfully to a variety of models for spin and charge degrees of freedom, including Heisenberg and XYZ spin models, hard-core bosons, Hubbard and t - J -models. Owing to the improved efficiency, precise calculations of asymptotic behaviour and of quantum critical exponents have been possible.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/0001873021000049195

Cites

69 of 69 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 69 references

Cited by

See all 271

Metadata

Authors
Evertz, H. G.
Venue
Advances in Physics
Published
2003-01
Volume
52
Issue
1
Pages
1-66
ISSN
  • 0001-8732 (ISSN-L)
  • 1460-6976
OpenAlex
W2105092797
Cited by
271
References
69
FWCI
14.16
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The loop algorithm. https://app.cochat.ai/papers/10.1080/0001873021000049195
The paper
Evertz, H. G. (2003). The loop algorithm. Advances in Physics. https://doi.org/10.1080/0001873021000049195

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.