Fermionic Monte Carlo algorithms for lattice QCD
Philippe de Forcrand
TL;DR
This paper reviews the computational complexity of fermionic Monte Carlo algorithms in lattice QCD, highlighting the slow progress in reducing systematic errors despite increased resources.
Contribution
It provides an elementary analysis of the origin of algorithmic complexity in fermionic Monte Carlo methods for lattice QCD and estimates their computational demands.
Findings
Complexity of fermionic algorithms is a major bottleneck.
Systematic error reduction is slow despite more computing resources.
Estimates of algorithmic complexity for three exact fermion algorithms.
Abstract
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary terms, the origin of this complexity, and estimate it for 3 exact fermion algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Chromodynamics and Particle Interactions · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods