Adiabatic Quantum Algorithm for Multijet Clustering in High Energy Physics

Abstract

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 an even more complex combinatorial problem. In this paper, we show that quantum annealing can tackle dijet event clustering by introducing a novel quantum annealing binary clustering algorithm. The benchmarked efficiency is of the order of $96\%$, thus yielding substantial improvements over the current quantum state-of-the-art. Additionally, we also show how to generalize the proposed objective function into a more versatile form, capable of solving the clustering problem in multijet events.

References in corpus (2)

• An Introduction to PYTHIA 8.2
• Quantum Annealing for Combinatorial Clustering

Cited by in corpus (8)

• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Quantum algorithm for Feynman loop integrals
• Liouvillian Dynamics of the Open Schwinger Model: String Breaking and Kinetic Dissipation in a Thermal Medium
• A Digital Quantum Algorithm for Jet Clustering in High-Energy Physics
• Quantum Simulation of Bound State Scattering
• A Novel Quantum Realization of Jet Clustering in High-Energy Physics Experiments
• A Quantum Algorithm for Model-Independent Searches for New Physics
• Quantum-annealing-inspired algorithms for multijet clustering