Engineering PapersSearch

DOE OSTI · 2526271

QCD factorization with multihadron fragmentation functions

Abstract

Important aspects of quantum chromodynamics (QCD) factorization theorems are the properties of the objects involved that can be identified as universal. One example is that the definitions of parton densities and fragmentation functions for different types of hadrons differ only in the identity of the nonperturbative states that form the matrix elements, but are otherwise the same. This leads to independence of perturbative calculations on nonperturbative details of external states. It also lends support to interpretations of correlation functions as encapsulations of intrinsic nonperturbative properties. These characteristics have usually been presumed to still hold true in fragmentation functions even when the observed nonperturbative state is a small-mass cluster of n hadrons rather than simply a single isolated hadron. However, the multidifferential aspect of cross sections that rely on these latter types of fragmentation functions complicates the treatment of kinematical approximations in factorization derivations. That has led to recent claims that the operator definitions for fragmentation functions need to be modified from the single hadron case with nonuniversal prefactors. With such concerns as our motivation, we retrace the steps for factorizing the unpolarized semi-inclusive e + e − annihilation cross section and confirm that they do apply without modification to the case of a small-mass multihadron observed in the final state. In particular, we verify that the standard operator definition from single hadron fragmentation, with its usual prefactor, remains equally valid for the small-mass n -hadron case with the same hard parts and evolution kernels, whereas the more recently proposed definitions with nonuniversal prefactors do not. Our results reaffirm the reliability of most past phenomenological applications of dihadron fragmentation functions. Published by the American Physical Society 2025

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rogers, T. C. (ORCID:0000000207620275), Radici, M. (ORCID:0000000245429797), Courtoy, A. (ORCID:0000000189062440), Rainaldi, T. (ORCID:0000000283426765). 2025-03-03. QCD factorization with multihadron fragmentation functions. https://doi.org/10.1103/physrevd.111.056001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Vidyut3d: A GPU accelerated fluid solver for non-equilibrium plasmas on adaptive grids

We present the numerical methods, programming methodology, verification, and performance assessment of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures, in this work. Our plasma fluid model solves the coupled conservation equations for species transport, electrostatic Poisson and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive-grid/particle management library, AMReX, and is portable over widely available vendor specific GPU architectures. We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth-order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on capacitive discharges and atmospheric pressure streamer propagation. We demonstrate the use of our solver on two 3D simulation cases: an atmospheric streamer propagation in Ar-H2 mixtures and a low pressure three-electrode radio frequency reactor. Our performance studies on three different CPU+GPU architectures indicate ~ 150-400X speed-up using AMD and NVIDIA GPUs per time step compared to a single CPU core for a 4 million cell simulation with 15 species.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC