Quantum clustering and jet reconstruction at the LHC
arXiv:2204.06496 · doi:10.1103/PhysRevD.106.036021
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 -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.
arXiv comment24 pages, 17 figures, 2 tables
References in corpus (52)
- The anti-k_t jet clustering algorithm
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- FastJet user manual
- Quantum Mechanics helps in searching for a needle in a haystack
- Dispelling the N^3 myth for the Kt jet-finder
- Quantum fingerprinting
- Successive Combination Jet Algorithm For Hadron Collisions
- Better Jet Clustering Algorithms
- Quantum random access memory
- Quantum computing for finance: overview and prospects
- Strong Coupling of a Spin Ensemble to a Superconducting Resonator
- Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
- Quantum Algorithms for Quantum Field Theories
- Simulating Lattice Gauge Theories within Quantum Technologies
- High cooperativity coupling of electron-spin ensembles to superconducting cavities
- Quantum Simulations of Lattice Gauge Theories using Ultracold Atoms in Optical Lattices
- Physics potential and experimental challenges of the LHC luminosity upgrade
- Maximizing Boosted Top Identification by Minimizing N-subjettiness
- Quantum speedup of Monte Carlo methods
- Architectures for a quantum random access memory
- A Roadmap for HEP Software and Computing R&D for the 2020s
- Simulating lattice gauge theories on a quantum computer
- Variational Quantum State Diagonalization
- Storage of multiple coherent microwave excitations in an electron spin ensemble
- Quantum Algorithm Implementations for Beginners
- Clustering by soft-constraint affinity propagation: Applications to gene-expression data
- A quantum algorithm for high energy physics simulations
- Anomaly detection in high-energy physics using a quantum autoencoder
- Quantum Monte Carlo Methods in Nuclear Physics: Recent Advances
- Quantum Machine Learning in High Energy Physics
- 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
- Quantum Algorithms for Jet Clustering
- Quantum Singular Value Decomposer
- XCone: N-jettiness as an Exclusive Cone Jet Algorithm
- The controlled SWAP test for determining quantum entanglement
- Optimal Control for the Quantum Simulation of Nuclear Dynamics
- Quantum simulation of open quantum systems in heavy-ion collisions
- Determining the proton content with a quantum computer
- Quantum simulation of quantum field theories as quantum chemistry
- Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers
- Quark-mass effects for jet production in e^+ e^- collisions at the next-to-leading order: results and applications
- Hints on the gradual re-sizing of the torus in AGN by decomposing IRS/Spitzer spectra
- Unsupervised and semi-supervised clustering by message passing: Soft-constraint affinity propagation
- Quantum algorithm for Feynman loop integrals
- Optimal universal learning machines for quantum state discrimination
- Quantum-inspired event reconstruction with Tensor Networks: Matrix Product States
- A new jet algorithm based on the k-means clustering for the reconstruction of heavy states from jets
- Clustering with shallow trees
- Quantum Unsupervised and Supervised Learning on Superconducting Processors
- On the clustering properties of produced particles in high-energy collisions