Pith. sign in

REVIEW 1 cited by

Non-renormalizability of the HMC algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1103.1810 v2 pith:LNLTSMFW submitted 2011-03-09 hep-lat

Non-renormalizability of the HMC algorithm

classification hep-lat
keywords theoryalgorithmalgorithmslatticemolecular-dynamicsrenormalizablealreadyattractive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In lattice field theory, renormalizable simulation algorithms are attractive, because their scaling behaviour as a function of the lattice spacing is predictable. Algorithms implementing the Langevin equation, for example, are known to be renormalizable if the simulated theory is. In this paper we show that the situation is different in the case of the molecular-dynamics evolution on which the HMC algorithm is based. More precisely, studying the phi^4 theory, we find that the hyperbolic character of the molecular-dynamics equations leads to non-local (and thus non-removable) ultraviolet singularities already at one-loop order of perturbation theory.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Bounding statistical errors in lattice field theory simulations

    hep-lat 2025-06 unverdicted novelty 5.0

    Introduces bounds-based stopping criteria and automatic windowing for autocorrelation integrals to estimate statistical errors in lattice field theory Monte Carlo simulations.