dorsal/arxiv
View SchemaTrackHHL: The 1-Bit Quantum Filter for particle trajectory reconstruction
| Authors | Xenofon Chiotopoulos, Davide Nicotra, George Scriven, Kurt Driessens, Marcel Merk, Jochen Schütz, Jacco de Vries, Mark H. M. Winands |
|---|---|
| Categories | |
| ArXiv ID | 2601.07766vv1 |
| URL | https://arxiv.org/abs/2601.07766 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
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(\sqrt{N} \log N)$, 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.
{
"annotation_id": "8b43acbe-3dc8-48e5-895b-34b466f90e63",
"date_created": "2026-02-17T05:53:11.948000Z",
"date_modified": "2026-02-17T05:53:11.948000Z",
"file_hash": "404f9c2af35de2cd0b221f1b186daec7be446cca939522ffd889b95c478c2a1f",
"private": false,
"record": {
"abstract": "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\u0027s sparsity, we achieve an asymptotic gate complexity of $O(\\sqrt{N} \\log N)$, 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.",
"arxiv_id": "2601.07766",
"authors": [
"Xenofon Chiotopoulos",
"Davide Nicotra",
"George Scriven",
"Kurt Driessens",
"Marcel Merk",
"Jochen Sch\u00fctz",
"Jacco de Vries",
"Mark H. M. Winands"
],
"categories": [
"quant-ph",
"hep-ex"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "TrackHHL: The 1-Bit Quantum Filter for particle trajectory reconstruction",
"url": "https://arxiv.org/abs/2601.07766",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f79f3bcc-b632-4cba-86ad-bc5f88665fdc",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}