Algorithms for lattice QCD: progress and challenges

TL;DR

This paper reviews recent progress and ongoing challenges in lattice QCD algorithms, focusing on algorithmic improvements, issues like topological slowing down, and implications for future simulations.

Contribution

It provides an overview of current lattice algorithms, discusses the problem of topological slowing down, and explores its impact on achieving finer lattice simulations.

Findings

Algorithms have improved enabling small quark mass calculations.

Finer lattices are now possible but face slowing down issues.

Topological slowing down may hinder continuum limit simulations.

Abstract

The development of improved algorithms for QCD on the lattice has enabled us to do calculations at small quark masses and get control over the chiral extrapolation. Also finer lattices have become possible, however, a severe slowing down associated with the topology of the gauge fields has been observed. This may prevent simulations of lattices fine enough for controlling the continuum extrapolation. This conference contribution introduces the basic concepts behind contemporary lattice algorithms, the current knowledge about their slowing down towards the continuum and its consequences for future lattice simulations.