Algorithms for Lattice QCD with Dynamical Fermions

TL;DR

This paper reviews recent advances in algorithms for lattice QCD simulations with dynamical fermions, focusing on efficiency, error control, and theoretical frameworks for algorithm comparison.

Contribution

It provides a comprehensive survey of state-of-the-art algorithms, including polynomial and rational approximations, and discusses theoretical aspects of chiral fermions on the lattice.

Findings

Comparison of algorithm performance and error control

Analysis of polynomial and rational approximation methods

Theoretical insights into chiral fermion implementation

Abstract

We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs between performance and control of systematic errors. We briefly review the use of polynomial and rational approximations in Hybrid Monte Carlo algorithms, and some of the theory of on-shell chiral fermions on the lattice. This provides a theoretical framework within which we compare algorithmic alternatives for their implementation; and again we examine the trade-offs between speed and error control.