Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.07766 · Communications Physics

A 1-bit quantum filter for particle trajectory reconstruction

Xenofon Chiotopoulos, Davide Nicotra, George Scriven, Kurt Driessens, Marcel Merk, Jochen Schütz, Jacco de Vries, Mark H. M. Winands

quant-phhep-exSubmitted Jan 12, 2026• Announced Jan 13, 2026• 1 citation• Revised Aug 7, 2026 (v2)
v1 · Jan 12, 2026v2 · Aug 7, 2026
arXivHTMLPDF

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.

Journal reference
Commun Phys (2026)
DOI
10.1038/s42005-026-02780-8

Related papers

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

Xenofon Chiotopoulos, Miriam Lucio Martinez, Davide Nicotra +4 more

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.

quant-pharXiv:2511.11458•EPJ Web of Conferences•Nov 17, 2025•2 citations

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

Xenofon Chiotopoulos, M. Lucio Martínez, Davide Nicotra +4 more

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 stateof-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. [1] and strives to fulfill these conditions and further streamlines the algorithm’s circuit depth by a factor up to 104. 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.

•Oct 7, 2025•0 citations

A quantum algorithm for track reconstruction in the LHCb vertex detector

Davide Nicotra, M. Lucio Martínez, Jacco Andreas De Vries +5 more

Abstract High-energy physics is facing increasingly demanding computational challenges in real-time event reconstruction for the near-future high-luminosity era. Using the LHCb vertex detector as a use case, we explore a new algorithm for particle track reconstruction based on the minimisation of an Ising-like Hamiltonian with a linear algebra approach. The use of a classical matrix inversion technique results in tracking performance similar to the current state-of-the-art but with worse scaling complexity in time. To solve this problem, we also present an implementation as a quantum algorithm, using the Harrow-Hassadim-Lloyd (HHL) algorithm: this approach can potentially provide an exponential speedup as a function of the number of input hits over its classical counterpart, in spite of limitations due to the well-known HHL Hamiltonian simulation and readout problems. The findings presented in this paper shed light on the potential of leveraging quantum computing for real-time particle track reconstruction in high-energy physics.

arXiv:2308.00619•Journal of Instrumentation•Nov 1, 2023•18 citations

Particle Track Reconstruction with Quantum Algorithms

Cenk Tüysüz, Federico Carminati, Bilge Melahat Demirköz +6 more

Accurate determination of particle track reconstruction parameters will be a major challenge for the High Luminosity Large Hadron Collider (HL-LHC) experiments. The expected increase in the number of simultaneous collisions at the HL-LHC and the resulting high detector occupancy will make track reconstruction algorithms extremely demanding in terms of time and computing resources. The increase in number of hits will increase the complexity of track reconstruction algorithms. In addition, the ambiguity in assigning hits to particle tracks will be increased due to the finite resolution of the detector and the physical “closeness” of the hits. Thus, the reconstruction of charged particle tracks will be a major challenge to the correct interpretation of the HL-LHC data. Most methods currently in use are based on Kalman filters which are shown to be robust and to provide good physics performance. However, they are expected to scale worse than quadratically. Designing an algorithm capable of reducing the combinatorial background at the hit level, would provide a much “cleaner” initial seed to the Kalman filter, strongly reducing the total processing time. One of the salient features of Quantum Computers is the ability to evaluate a very large number of states simultaneously, making them an ideal instrument for searches in a large parameter space. In fact, different R&D initiatives are exploring how Quantum Tracking Algorithms could leverage such capabilities. In this paper, we present our work on the implementation of a quantum-based track finding algorithm aimed at reducing combinatorial background during the initial seeding stage. We use the publicly available dataset designed for the kaggle TrackML challenge.

arXiv:2003.08126•EPJ Web of Conferences•Jan 1, 2020•31 citations

A Quantum Graph Neural Network Approach to Particle Track Reconstruction

Tüysüz, Cenk, Bilge Melahat Demirköz, Dobos, Daniel +7 more

The unprecedented increase of complexity and scale of data is expected in the necessary computation for tracking detectors of the High Luminosity Large Hadron Collider (HL-LHC) experiments. While currently used Kalman filter based algorithms are reaching their limits in terms of ambiguities from increasing number of simultaneous collisions, occupancy, and scalability (worse than quadratic), a variety of machine learning approaches to particle track reconstruction are explored. It has been demonstrated previously by HEP.TrkX using TrackML datasets, that graph neural networks, processing events as a graph connecting track measurements, are a promising solution and can reduce the combinatorial background to a manageable amount and are scaling to a computationally reasonable size. In previous work, we have shown a first attempt of Quantum Computing to Graph Neural Networks for track reconstruction of particles. We aim to leverage the capability of quantum computing to evaluate a very large number of states simultaneously and thus to effectively search in a large parameter space. As the next step in this paper, we present an improved model with an iterative approach to overcome the low accuracy convergence of the initial oversimplified Tree Tensor Network (TTN) model.

arXiv:2007.06868•Apr 20, 2020•17 citations

Charged particle tracking with quantum annealing optimization

Alexander Zlokapa, Abhishek Anand, Jean-Roch Vlimant +4 more

Abstract At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for physics analysis will need to be upgraded to scale with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework for HL-LHC conditions. We develop additional techniques to embed the problem onto existing and near-term quantum annealing hardware. Results using simulated annealing and quantum annealing with the D-Wave 2X system on the TrackML open dataset are presented, demonstrating the successful application of a quantum annealing algorithm to the track reconstruction challenge. We find that combinatorial optimization problems can effectively reconstruct tracks, suggesting possible applications for fast hardware-specific implementations at the HL-LHC while leaving open the possibility of a quantum speedup for tracking.

arXiv:1908.04475•Quantum Machine Intelligence•Nov 2, 2021•53 citations
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(Nlog⁡N)O(\sqrt{N} \log N)O(N​logN), given Hamiltonian dimension NNN. 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.
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 10410^4104. 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.
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 stateof-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. [1] and strives to fulfill these conditions and further streamlines the algorithm’s circuit depth by a factor up to 104. 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.
Abstract High-energy physics is facing increasingly demanding computational challenges in real-time event reconstruction for the near-future high-luminosity era. Using the LHCb vertex detector as a use case, we explore a new algorithm for particle track reconstruction based on the minimisation of an Ising-like Hamiltonian with a linear algebra approach. The use of a classical matrix inversion technique results in tracking performance similar to the current state-of-the-art but with worse scaling complexity in time. To solve this problem, we also present an implementation as a quantum algorithm, using the Harrow-Hassadim-Lloyd (HHL) algorithm: this approach can potentially provide an exponential speedup as a function of the number of input hits over its classical counterpart, in spite of limitations due to the well-known HHL Hamiltonian simulation and readout problems. The findings presented in this paper shed light on the potential of leveraging quantum computing for real-time particle track reconstruction in high-energy physics.
Accurate determination of particle track reconstruction parameters will be a major challenge for the High Luminosity Large Hadron Collider (HL-LHC) experiments. The expected increase in the number of simultaneous collisions at the HL-LHC and the resulting high detector occupancy will make track reconstruction algorithms extremely demanding in terms of time and computing resources. The increase in number of hits will increase the complexity of track reconstruction algorithms. In addition, the ambiguity in assigning hits to particle tracks will be increased due to the finite resolution of the detector and the physical “closeness” of the hits. Thus, the reconstruction of charged particle tracks will be a major challenge to the correct interpretation of the HL-LHC data. Most methods currently in use are based on Kalman filters which are shown to be robust and to provide good physics performance. However, they are expected to scale worse than quadratically. Designing an algorithm capable of reducing the combinatorial background at the hit level, would provide a much “cleaner” initial seed to the Kalman filter, strongly reducing the total processing time. One of the salient features of Quantum Computers is the ability to evaluate a very large number of states simultaneously, making them an ideal instrument for searches in a large parameter space. In fact, different R&D initiatives are exploring how Quantum Tracking Algorithms could leverage such capabilities. In this paper, we present our work on the implementation of a quantum-based track finding algorithm aimed at reducing combinatorial background during the initial seeding stage. We use the publicly available dataset designed for the kaggle TrackML challenge.
The unprecedented increase of complexity and scale of data is expected in the necessary computation for tracking detectors of the High Luminosity Large Hadron Collider (HL-LHC) experiments. While currently used Kalman filter based algorithms are reaching their limits in terms of ambiguities from increasing number of simultaneous collisions, occupancy, and scalability (worse than quadratic), a variety of machine learning approaches to particle track reconstruction are explored. It has been demonstrated previously by HEP.TrkX using TrackML datasets, that graph neural networks, processing events as a graph connecting track measurements, are a promising solution and can reduce the combinatorial background to a manageable amount and are scaling to a computationally reasonable size. In previous work, we have shown a first attempt of Quantum Computing to Graph Neural Networks for track reconstruction of particles. We aim to leverage the capability of quantum computing to evaluate a very large number of states simultaneously and thus to effectively search in a large parameter space. As the next step in this paper, we present an improved model with an iterative approach to overcome the low accuracy convergence of the initial oversimplified Tree Tensor Network (TTN) model.
Abstract At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for physics analysis will need to be upgraded to scale with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework for HL-LHC conditions. We develop additional techniques to embed the problem onto existing and near-term quantum annealing hardware. Results using simulated annealing and quantum annealing with the D-Wave 2X system on the TrackML open dataset are presented, demonstrating the successful application of a quantum annealing algorithm to the track reconstruction challenge. We find that combinatorial optimization problems can effectively reconstruct tracks, suggesting possible applications for fast hardware-specific implementations at the HL-LHC while leaving open the possibility of a quantum speedup for tracking.