Related papers: KtJet: A C++ implementation of the Kt clustering a…
The SISCone jet algorithm is a seedless infrared-safe cone jet algorithm. There exists an implementation which is highly optimised for a large number of final state particles. However, in fixed-order perturbative calculations with a small…
We describe an efficient implementation of the optimal jet definition derived in hep-ph/9901444 (revision of January, 2000) and implemented in Fortran 77. The algorithm handles both c.m.s. and hadron collision kinematics.
One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering…
We describe CIJET1.0, a Fortran program that aiming for the calculation of single-inclusive jet or dijet production cross sections induced by quark contact interactions from new physics at hadron colliders, up to next-to-leading order in…
In the particle-flow approach information from all available sub-detector systems is combined to reconstruct all stable particles. The global event reconstruction has been shown to improve, in particular, the resolution of jet energy and…
We consider the impact of the kt algorithm on energy flow into gaps between jets in any QCD hard process. While we confirm the observation that the kt clustering procedure considerably reduces the impact of non-global logarithms, we unearth…
In this article, we review some of the complexities of jet algorithms and of the resultant comparisons of data to theory. We review the extensive experience with jet measurements at the Tevatron, the extrapolation of this acquired wisdom to…
We review recent developments related to jet clustering algorithms and jet reconstruction, with particular emphasis on their implications in heavy ion collisions. These developments include fast implementations of sequential recombination…
In this work, we aim to solve a practical use-case of unsupervised clustering which has applications in predictive maintenance in the energy operations sector using quantum computers. Using only cloud access to quantum computers, we…
I describe a class of iterative jet algorithms that are based on maximizing a fixed function of the total 4-momentum rather than clustering of pairs of jets. I describe some of the properties of the simplest examples of this class,…
We define jet transition values for the anti-$k_{\bot}$ algorithm for both hadron and $e^+e^-$ colliders. We show how these transition values can be computed and how they can be used to improve the performance of clusterization when jet…
We revisit the impact of the jet algorithm on predictions of energy flow into gaps between hard jets, defined using the kt clustering procedure. The resulting prediction has two distinct components: a primary emission piece that is related…
It is common, in both theoretical and experimental studies, to separately discuss quark and gluon jets. However, even at parton level, widely-used jet algorithms fail to provide an infrared safe way of making this distinction. We examine…
We present a simple yet efficient algorithm for phase-space integration at hadron colliders. Individual mappings consist of a single t-channel combined with any number of s-channel decays, and are constructed using diagrammatic information.…
We introduce a new framework for jet definitions called p-jets that matches the computational speed of the currently used anti-k_T jet algorithm, but avoids combining much of the energy from background pileup events with signal jets. As a…
Over the years, many jet clustering algorithms have been proposed for the analysis of hadronic final states in $e^+e^-$ annihilations. These have somewhat different emphasis and are therefore more or less suited for various applications. We…
We introduce a new jet-finding algorithm for a hadron collider based on maximizing a J_{E_T} function for all possible combinations of particles in an event. This function prefers a larger value of the jet transverse energy and a smaller…
A new algorithm for jet finding in hadronic collisions is presented. The algorithm, based on a Gaussian filter in $(\eta,\phi)$, is specifically intended for use in heavy ion collisions and/or for detectors with limited acceptance. The…
In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid…
We introduce just-in-time (JIT) compilation to the integral kernels for Gaussian-type orbitals (GTOs) to enhance the efficiency of electron repulsion integral computations. For Coulomb and exchange (JK) matrices, JIT-based algorithms yield…