Related papers: The Cambridge Jet algorithm: features and applicat…
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…
Recent developments in jet clustering are reviewed. We present a list of fast and infrared and collinear safe algorithms, and also describe new tools like jet areas. We show how these techniques can be applied to the study of underlying…
A jet algorithm based on the k-means clustering procedure is proposed which can be used for the invariant-mass reconstruction of heavy states decaying to hadronic jets. The proposed algorithm was tested by reconstructing E+ E- to ttbar to 6…
We perform a comparison of two jet clusterization algorithms. The first one is the standard Durham algorithm and the second one is a global optimization scheme, Deterministic Annealing, often used in clusterization problems, and adapted to…
We show that a general purpose clusterization algorithm, Deterministic Annealing, can be adapted to the problem of jet identification in particle production by high energy collisions. In particular we consider the problem of jet searching…
Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might…
Experimental High-Energy Physics (HEP), especially the Large Hadron Collider (LHC) programme at the European Organization for Nuclear Research (CERN), is one of the most computationally intensive activities in the world. This demand is set…
Collimated streams of particles produced in high energy physics experiments are organized using clustering algorithms to form jets. To construct jets, the experimental collaborations based at the Large Hadron Collider (LHC) primarily use…
Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN's Large Hadron Collider (LHC) is computationally…
The currently predicted increase in computational demand for the upcoming High-Luminosity Large Hadron Collider (HL-LHC) event reconstruction, and in particular jet clustering, is bound to challenge present day computing resources, becoming…
We assess the performance of different jet-clustering algorithms, in the presence of different resolution parameters and reconstruction procedures, in resolving fully hadronic final states emerging from the chain decay of the discovered…
We study the case where quantum computing could improve jet clustering by considering two new quantum algorithms that might speed up classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based…
Jet finding algorithms, as they are used in $e^+ e^-$ and hadron collisions, are reviewed and compared. It is suggested that a successive combination style algorithm, similar to that used in $e^+ e^-$ physics, might be useful also in hadron…
We investigate a modification of the $k_\perp$-clustering jet algorithm for hadron-hadron collisions, analogous to the ``Cambridge'' algorithm recently proposed for $e^+e^-$ annihilation, in which pairs of objects that are close in angle…
Identifying jets formed in high-energy particle collisions requires solving optimization problems over potentially large numbers of final-state particles. In this work, we consider the possibility of using quantum computers to speed up jet…
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…
In collider physics at the TeV scale, there are many important processes which involve six or more jets. The sensitivity of the physics analysis depends critically on the performance of the jet clustering algorithm. We present a full…
We review recent developments related to jet clustering algorithms and jet finding. These include fast implementations of sequential recombination algorithms, new IRC safe algorithms, quantitative determination of jet areas and quality…
Jet clustering or reconstruction is a crucial component at high energy colliders, a procedure to identify sprays of collimated particles originating from the fragmentation and hadronization of quarks and gluons. It is a complicated…
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,…