Quantum clustering and jet reconstruction at the LHC

Abstract

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 expensive and the difficulty of this task will increase with the upcoming High-Luminosity LHC (HL-LHC). In this paper, we study the case in which quantum computing algorithms might improve jet clustering by considering two novel quantum algorithms which may speed up the classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, whereas the second one consists of a quantum circuit to track the maximum into a list of unsorted data. The latter algorithm could be of value beyond particle physics, for instance in statistics. When one or both of these algorithms are implemented into the 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. Even more, exponential speed-up could be achieved, in the first two algorithms, in data dimensionality and data length when the distance algorithm or the maximum searching algorithm are applied.

24 pages, 17 figures, 2 tables

References in corpus (15)

• Quantum random access memory
• Strong Coupling of a Spin Ensemble to a Superconducting Resonator
• Architectures for a quantum random access memory
• Clustering by soft-constraint affinity propagation: Applications to gene-expression data
• Anomaly detection in high-energy physics using a quantum autoencoder
• Quantum Machine Learning for Particle Physics using a Variational Quantum Classifier
• Application of Quantum Machine Learning using the Quantum Variational Classifier Method to High Energy Physics Analysis at the LHC on IBM Quantum Computer Simulator and Hardware with 10 qubits
• Magnetic strong coupling in a spin-photon system and transition to classical regime
• The controlled SWAP test for determining quantum entanglement
• Quantum simulation of open quantum systems in heavy-ion collisions
• Determining the proton content with a quantum computer
• Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers
• Unsupervised and semi-supervised clustering by message passing: Soft-constraint affinity propagation
• Quantum algorithm for Feynman loop integrals
• Quantum-inspired event reconstruction with Tensor Networks: Matrix Product States

Cited by in corpus (1)

• Machine Learning for Anomaly Detection in Particle Physics