TrackHHL: A Quantum Computing Algorithm for Track Reconstruction at the LHCb

• URL: http://arxiv.org/abs/2511.11458v1
• Date: Fri, 14 Nov 2025 16:31:14 GMT
• Title: TrackHHL: A Quantum Computing Algorithm for Track Reconstruction at the LHCb
• Authors: Xenofon Chiotopoulos, Miriam Lucio Martinez, Davide Nicotra, Jacco A. de Vries, Kurt Driessens, Marcel Merk, Mark H. M. Winands,
• Abstract summary: 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.
• Score: 0.21681971652284857
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the future high-luminosity LHC era, high-energy physics experiments face unprecedented computational challenges for event reconstruction. Employing the LHCb vertex locator as a case study we investigate a novel approach for charged particle track reconstruction. The algorithm hinges on minimizing an Ising-like Hamiltonian using matrix inversion. Solving this matrix inversion classically achieves reconstruction efficiencies akin to current state-of-the-art algorithms. 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, contingent on the conditions of efficient quantum phase estimation (QPE) and effectively reading out the algorithm's output. This contribution builds on previous work by Nicotra et al and strives to fulfill these conditions and further streamlines the algorithm's circuit depth by a factor up to $10^4$. Our version of the HHL algorithm restricts the QPE precision to one bit, largely reducing circuit depth and addressing HHL's readout issue. Furthermore, this allows for the implementation of a post-processing algorithm that reconstructs event Primary Vertices (PVs). The findings presented here aim to further illuminate the potential of harnessing quantum computing for the future of particle track reconstruction in high-energy physics.

Related papers

• TrackHHL: The 1-Bit Quantum Filter for particle trajectory reconstruction [0.2089615335919449]
  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.
  arXiv  Detail & Related papers  (2026-01-12T17:49:04Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Quantum Discrete Adiabatic Linear Solver based on Block Encoding and Eigenvalue Separator [5.138262101775231]
  The rise of quantum computing has spurred interest in quantum linear system problems.<n>The performance of the HHL algorithm is constrained by its dependence on the square of the condition number.<n>This work proposes a quantum discrete adiabatic linear solver based on block encoding and eigenvalue separation techniques.
  arXiv  Detail & Related papers  (2024-12-09T04:50:48Z)
• Leapfrogging Sycamore: Harnessing 1432 GPUs for 7$\times$ Faster Quantum Random Circuit Sampling [40.83618005962484]
  Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms has significantly reduced the classical simulation time. Our work provides the first unambiguous experimental evidence to refute textitSycamore's claim of quantum advantage.
  arXiv  Detail & Related papers  (2024-06-27T05:01:47Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders [0.0]
  Track reconstruction can be formulated as a quadratic unconstrained binary optimization problem. We show that simulated bifurcation algorithms can be employed to solve the particle tracking problem.
  arXiv  Detail & Related papers  (2024-02-22T17:19:03Z)
• 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)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• 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)

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.