Engineering Papers⌕ Search

DOE OSTI · 1029519

Recent Developments in SHERPA

Abstract

Some recent QCD-related developments in the SHERPA event generator are presented. In the past decades, event generators such as PYTHIA [1, 2] and HERWIG [3, 4] have been central for nearly all physics analyses at particle physics experiments at the high-energy frontier. This will also hold true at the LHC, where a large number of interesting signals for new particles or new phenomena (the Higgs boson or any other manifestation of the mechanism behind electro-weak symmetry breaking, supersymmetry, extra dimensions etc.) is hampered by a plethora of severe, sometimes overwhelming backgrounds. Nearly all of them are largely influenced by QCD. Therefore it seems fair to say that the success of the LHC in finding new physics may very well depend on a deep and detailed understanding of old physics, like QCD. Examples for this include, among others, the central-jet veto for the vector boson fusion channel for Higgs production or topologies, where gauge bosons emerge in association with many jets, a background for many search channels. In a reflection on increased needs by the experimental community, aiming at higher precision, incorporation of new physics models and so on, the work horses of old have undergone serious renovation efforts, resulting in new, improved versions of the respective codes, namely PYTHIA8 [5] and HERWIG++ [6]. In addition a completely new code, SHERPA [7], has been constructed and is in the process of maturing. The status of this code is the topic of this contribution. SHERPA's hallmark property is the inclusion of higher-order tree-level QCD contributions, leading to an improved modelling of jet production. They are introduced through a full-fledged matrix element generator, AMEGIC++ [8], which is capable of generating matrix elements and corresponding phase space mappings for processes with multi-particle final states in various models, including the Standard Model, anomalous gauge triple and quadruple couplings according to [9, 10], the Minimal Supersymmetric Standard Model with Feynman rules from [11], the ADD-model of extra dimensions [12, 13], and a model with an extra U(1) singlet coupling to the Higgs boson only [14]. The code has been thoroughly tested and validated [15]. This code, however, is limited, especially in the treatment of many ({ge} 6) external QCD particles. Therefore, in the near future, SHERPA will incorporate another, new matrix element generator, COMIX, which is based on Berends-Giele recursion relations [16] and color-dressing [17] rather than color-ordering. In Tabs. 1 and 2 some example cross sections for gg {yields} ng at fixed energies and pp {yields} b{bar b} + n jets obtained with this program are exhibited and compared to those from other programs. In addition, concerning the calculation of higher-order matrix elements and cross sections, there have been first steps towards an automation of such calculations at truly next-to leading order accuracy. They manifest themselves in the implementation of a procedure [19] to fully automatically construct and evaluate Catani-Seymour dipole subtraction terms [20] for the real part of such NLO calculations. The results from the matrix element calculations are merged with the subsequent parton shower through the formalism of [21, 22]. The results of its implementation in SHERPA [23] has recently been compared with other algorithms [24]. Although there remains some dispute about the theoretical equivalence of the different approaches, the overall results show satisfying agreement with each other, such that they can be used with confidence for data analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Archibald, Jennifer, Gleisberg, Tanju, Hoeche, Stefan, Krauss, Frank, Schonherr, Marek, Schumann, Steffen, Siegert, Frank, Winter, Jan. 2011-11-15. Recent Developments in SHERPA. https://www.osti.gov/biblio/1029519

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↗