The transition to the High-Luminosity Large Hadron Collider (HL-LHC) presents a computational challenge where particle reconstruction complexity may outpace classical computing resources. While quantum computing offers potential speedups, standard algorithms like Harrow-Hassidim-Lloyd (HHL) require prohibitive circuit depths for near-term hardware. Here, we introduce the 1-Bit Quantum Filter, a domain-specific adaptation of HHL that reformulates tracking from matrix inversion to binary ground-state filtering. By replacing high-precision phase estimation with a single-ancilla spectral threshold and exploiting the Hamiltonian's sparsity, we achieve an asymptotic gate complexity of O(NlogN), given Hamiltonian dimension N. We validate this approach by simulating LHCb Vertex Locator events with a toy model, and benchmark performance using the noise models of Quantinuum H2 trapped-ion and IBM Heron superconducting processors. This work establishes a resource-efficient track reconstruction method capable of solving realistic event topologies on noise-free simulators and smaller tracking scenarios within the current constraints of the Noisy Intermediate Scale Quantum (NISQ) era.
@article{arxiv.2601.07766,
title = {TrackHHL: The 1-Bit Quantum Filter for particle trajectory reconstruction},
author = {Xenofon Chiotopoulos and Davide Nicotra and George Scriven and Kurt Driessens and Marcel Merk and Jochen Schütz and Jacco de Vries and Mark H. M. Winands},
journal= {arXiv preprint arXiv:2601.07766},
year = {2026}
}