PreprintarXiv licencearXiv
Toward Compute-Bound Lattice-QCD Software
Abstract
Multi-right-hand-side multigrid inverters for lattice QCD are much less memory constrained than single-right-hand-side Krylov solvers, so the upper bound on efficiency of modern solvers is much higher than what was historically possible. This work presents a reanalysis of roofline estimates to reflect this new reality. It also describes the qc library, which implements multi-right-hand-side multigrid at an efficiency that can exceed 50% of the processor roofline.
Related
- Digital quantum lattice Boltzmann evolution by reversible compute and open-system reset
- On credit attribution and research software: A case study from lattice QCD
- Chiral enhancement of two-magnon bound states in an S=1/2 triangular-lattice magnet
- Symmetry Properties of Bound States in the Continuum in Hexagonal Lattice Photonic Crystal Slabs
- Non-Markovian quantum-emitter dynamics and bound-state formation in an Aubry--André--Harper photonic lattice
BibTeX
@misc{grebe2026toward,
title = {{Toward Compute-Bound Lattice-QCD Software}},
author = {Anthony V. Grebe},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.35526},
eprint = {2610.35526},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.35526},
}
RIS
TY - UNPB
TI - Toward Compute-Bound Lattice-QCD Software
AU - Anthony V. Grebe
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2610.35526
UR - https://arxiv.org/abs/2610.35526
AB - Multi-right-hand-side multigrid inverters for lattice QCD are much less memory constrained than single-right-hand-side Krylov solvers, so the upper bound on efficiency of modern solvers is much higher than what was historically possible. This work presents a reanalysis of roofline estimates to reflect this new reality. It also describes the qc library, which implements multi-right-hand-side multigrid at an efficiency that can exceed 50% of the processor roofline.
ER -