TrackHHL: The 1-Bit Quantum Filter for particle trajectory reconstruction

• URL: http://arxiv.org/abs/2601.07766v1
• Date: Mon, 12 Jan 2026 17:49:04 GMT
• Title: TrackHHL: 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,
• Abstract summary: We introduce the 1-Bit Quantum Filter, a domain-specific adaptation of Harrow-Hassidim-Lloyd (HHL)<n>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 (NISQ) era.
• Score: 0.2089615335919449
• 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.

Related papers

• TrackHHL: A Quantum Computing Algorithm for Track Reconstruction at the LHCb [0.21681971652284857]
  In the future high-luminosity LHC era, high-energy physics experiments face unprecedented computational challenges for event reconstruction.<n>We investigate a novel approach for charged particle track reconstruction using matrix inversion.<n>Exploiting the Harrow-Hassidim-Lloyd (HHL) quantum algorithm for linear systems holds the promise of an exponential speedup in the number of input hits over its classical counterpart.
  arXiv  Detail & Related papers  (2025-11-14T16:31:14Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla [0.0]
  Some quantum algorithms for simulating Lindblad dynamics achieve logarithmically short circuit depth in terms of accuracy $varepsilon$ by coherently encoding all possible jump processes with a large ancilla consumption.<n>We present a quantum algorithm for simulating general Lindblad dynamics with multiple jump operators aimed at an observable estimation, that achieves both a logarithmically short circuit depth and a minimum ancilla size.
  arXiv  Detail & Related papers  (2024-12-27T04:43:19Z)
• Efficient Quantum Simulation Algorithms in the Path Integral Formulation [0.5729426778193399]
  We provide two novel quantum algorithms based on Hamiltonian versions of the path integral formulation and another for Lagrangians of the form $fracm2dotx2 - V(x)$. We show that our Lagrangian simulation algorithm requires a number of queries to an oracle that computes the discrete Lagrangian that scales for a system with $eta$ particles in $D+1$ dimensions, in the continuum limit, as $widetildeO(eta D t2/epsilon)$ if $V(x)$ is bounded
  arXiv  Detail & Related papers  (2024-05-11T15:48:04Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• A quantum algorithm for track reconstruction in the LHCb vertex detector [0.09423257767158631]
  We present a new algorithm for particle track reconstruction based on the minimisation of an Ising-like Hamiltonian with a linear algebra approach. We also present an implementation as quantum algorithm, using the Harrow-Hassadim-Lloyd (HHL) algorithm.
  arXiv  Detail & Related papers  (2023-08-01T15:47:02Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Particle Track Reconstruction with Quantum Algorithms [1.087475836765689]
  We present our work on the implementation of a quantum-based track finding algorithm aimed at reducing background during the initial seeding stage. The reconstruction of charged particle tracks will be a major challenge to the correct interpretation of the HL-LHC data.
  arXiv  Detail & Related papers  (2020-03-18T09:59:20Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.