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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Ordering, metastability and phase transitions in two-dimensional systems
Kosterlitz, J. M., & Thouless, D. J. (1973) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/6/7/010 · Cited by 9,538
Theory of dynamic critical phenomena
Hohenberg, P. C., & Halperin, B. I. (1977) · Reviews of Modern Physics · doi:10.1103/revmodphys.49.435 · Cited by 6,891
Nonuniversal critical dynamics in Monte Carlo simulations
Swendsen, R. H., & Wang, J.-S. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.86 · Cited by 2,844
Collective Monte Carlo Updating for Spin Systems
Wolff, U. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.361 · Cited by 2,551
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282
Fortuin, C. M., & Kasteleyn, P. W. (1972) · Physica · doi:10.1016/0031-8914(72)90045-6 · Cited by 1,741
Surprises on the Way from One- to Two-Dimensional Quantum Magnets: The Ladder Materials
Dagotto, E., & Rice, T. M. (1996) · Science · doi:10.1126/science.271.5249.618 · Cited by 1,655
Exact sampling with coupled Markov chains and applications to statistical mechanics
Propp, J. G., & Wilson, D. B. (1996) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.0.co;2-o · Cited by 1,159
Suzuki, M. (1976) · Progress of Theoretical Physics · doi:10.1143/ptp.56.1454 · Cited by 1,132
Cited by
Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations
Troyer, M., & Wiese, U.-J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.170201 · Cited by 1,246
One dimensional bosons: From condensed matter systems to ultracold gases
Cazalilla, M. A., Citro, R., Giamarchi, T., Orignac, E., & Rigol, M. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.1405 · Cited by 1,107
The ALPS project release 2.0: open source software for strongly correlated systems
Bauer, B., Carr, L. D., Evertz, H. G., Feiguin, A., Freire, J., Fuchs, S., Gamper, L., Gukelberger, J., Gull, E., Guertler, S., et al. (2011) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2011/05/p05001 · Cited by 677
Self-citationChodera, J. D., Swope, W. C., Pitera, J. W., Seok, C., & Dill, K. A. (2007) · Journal of Chemical Theory and Computation · doi:10.1021/ct0502864 · Cited by 503
Temme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature · doi:10.1038/nature09770 · Cited by 305
Metadata
- Authors
- Evertz, H. G.
- Venue
- Advances in Physics
- Publisher
- Informa UK Limited
- 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.