Polarized and unpolarized gluon PDFs: generative machine learning applications for lattice QCD matrix elements at short distance and large momentum

• Published in: arXiv.org 2024-09
• Main Authors: Talal Ahmed Chowdhury, Izubuchi, Taku, Kamruzzaman, Methun, Karthik, Nikhil, Khan, Tanjib, Liu, Tianbo, Arpon, Paul, Schoenleber, Jakob, Raza, Sabbir Sufian
• Format: Article
• Language: English
• Subjects: Algorithms; Controllability; Correlation; Distribution functions; Gluons; Machine learning; Partons; Quantum chromodynamics; Quarks
• ISSN: 2331-8422

Lattice quantum chromodynamics (QCD) calculations share a defining challenge by requiring a small finite range of spatial separation \(z\) between quark/gluon bilinears for controllable power corrections in the perturbative QCD factorization, and a large hadron boost \(p_z\) for a successful determination of collinear parton distribution functions (PDFs). However, these two requirements make the determination of PDFs from lattice data very challenging. We present the application of generative machine learning algorithms to estimate the polarized and unpolarized gluon correlation functions utilizing short-distance data and extending the correlation up to \(zp_z \lesssim 14\), surpassing the current capabilities of lattice QCD calculations. We train physics-informed machine learning algorithms to learn from the short-distance correlation at \(z\lesssim 0.36\) fm and take the limit, \(p_z \to \infty\), thereby minimizing possible contamination from the higher-twist effects for a successful reconstruction of the polarized gluon PDF. We also expose the bias and problems with underestimating uncertainties associated with the use of model-dependent and overly constrained functional forms, such as \(x^\alpha(1-x)^\beta\) and its variants to extract PDFs from the lattice data. We propose the use of generative machine learning algorithms to mitigate these issues and present our determination of the polarized and unpolarized gluon PDFs in the nucleon.