Evaluation of disconnected quark loops for hadron structure using GPUs
C. Alexandrou, M. Constantinou, V. Drach, K. Hadjiyiannakou, K. Jansen, G. Koutsou, A. Strelchenko, A. Vaquero
TL;DR
The paper investigates the GPU-accelerated calculation of disconnected quark loops in lattice QCD using twisted-mass fermions with $N_f=2+1+1$, benchmarking variance-reduction methods such as the stochastic estimator, Truncated Solver Method (TSM), one-end trick, time-dilution, and Hopping Parameter Expansion (HPE) on a $32^3\times64$ lattice. It contrasts approaches for key observables like the isoscalar nucleon axial charge $g_A$ and sigma-terms, detailing parameter tuning, convergence behavior, and the relative efficiency of each method. The results show that the one-end trick, particularly when combined with TSM, offers the best efficiency for light and strange loops, while TSM's advantages decrease for charm unless applied to specific observables (e.g., $g_A^c$); time-dilution with HPE can be competitive in heavier-mass scenarios. By integrating plateau and summation analyses and enabling loops at all insertion times, the study provides practical guidance for high-precision flavor-singlet observables and demonstrates scalable GPU-enabled workflows for nucleon-structure studies.
Abstract
A number of stochastic methods developed for the calculation of fermion loops are investigated and compared, in particular with respect to their efficiency when implemented on Graphics Processing Units (GPUs). We assess the performance of the various methods by studying the convergence and statistical accuracy obtained for observables that require a large number of stochastic noise vectors, such as the isoscalar nucleon axial charge. The various methods are also examined for the evaluation of sigma-terms where noise reduction techniques specific to the twisted mass formulation can be utilized thus reducing the required number of stochastic noise vectors.
