Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders

Abstract

Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the particle multiplicity is high, which will be the conditions at future colliders, such as the High Luminosity Large Hadron Collider and Super Proton-Proton Collider. Track reconstruction can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, for which various quantum algorithms have been investigated and evaluated with both a quantum simulator and hardware. Simulated bifurcation algorithms are a set of quantum-annealing-inspired algorithms, known to be serious competitors to other Ising machines. In this study, we show that simulated bifurcation algorithms can be employed to solve the particle tracking problem. The simulated bifurcation algorithms run on classical computers and are suitable for parallel processing and usage of graphical processing units, and they can handle significantly large amounts of data at high speed. These algorithms exhibit reconstruction efficiency and purity comparable to or sometimes improved over those of simulated annealing, but the running time can be reduced by as much as four orders of magnitude. These results suggest that QUBO models together with quantum-annealing-inspired algorithms are valuable for current and future particle tracking problems.

10 pages, 4 figures

References in corpus (6)

• Observation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC
• Observation of a new boson at a mass of 125 GeV with the CMS experiment at the LHC
• CEPC Technical Design Report -- Accelerator (v2)
• A quantum algorithm for track reconstruction in the LHCb vertex detector
• Quantum Pathways for Charged Track Finding in High-Energy Collisions
• Charged particle reconstruction for future high energy colliders with Quantum Approximate Optimization Algorithm

Cited by in corpus (3)

• Quantum-annealing-inspired algorithms for multijet clustering
• Scalable Community Detection Using Quantum Hamiltonian Descent and QUBO Formulation
• From Hope to Heuristic: Realistic Runtime Estimates for Quantum Optimisation in NHEP