Quantum jet clustering with LHC simulated data

Abstract

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 distance between two data points, while the second one consists of a quantum circuit to track the rough maximum into a list of unsorted data. When one or both algorithms are implemented in classical versions of well-known clustering algorithms (K-means, Affinity Propagation and $k_T$-jet) we obtain efficiencies comparable to those of their classical counterparts. Furthermore, in the first two algorithms, an exponential speed up in dimensionality and data length can be achieved when applying the distance or the maximum search algorithm. In the $k_T$ algorithm, a quantum version of the same order as FastJet is achieved.

arXiv comment6 pages, 1 figure, 1 table, Contribution to 41st International Conference on High Energy physics - ICHEP 2022, 6-13 July 2022, Bologna, Italy

References in corpus (8)

• The anti-k_t jet clustering algorithm
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum fingerprinting
• Successive Combination Jet Algorithm For Hadron Collisions
• Quantum Algorithms for Jet Clustering
• Quantum algorithm for Feynman loop integrals
• Quantum Annealing for Jet Clustering with Thrust
• A Digital Quantum Algorithm for Jet Clustering in High-Energy Physics

Cited by in corpus (3)

• Efficient Quantum Simulation of QCD Jets on the Light Front
• Loop Feynman integration on a quantum computer
• Quantum integration of decay rates at second order in perturbation theory