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:1903.08879

Track clustering with a quantum annealer for primary vertex reconstruction at hadron colliders

Souvik Das, Andrew James Wildridge, Andreas Werner Jung

Published Mar 21, 2019• 25 citations
arXivHTMLPDF

Abstract

Clustering of charged particle tracks along the beam axis is the first step in reconstructing the positions of hadronic interactions, also known as primary vertices, at hadron collider experiments. We use a 2036 physical qubit D-Wave quantum annealer to perform track clustering in a limited capacity on artificial events where the positions of primary vertices and tracks resemble those measured by the Compact Muon Solenoid experiment at the Large Hadron Collider. The algorithm, which is not a classical-quantum hybrid but relies entirely on quantum annealing, is tested on a variety of event topologies. We demonstrate a deterministic graph-embedding of the problem on the D-Wave Chimera architecture, a method for optimizing the coupling strengths within logical qubits, and a method for optimizing annealing time. Further, we benchmark it against simulated annealing on a commercial CPU constrained to the same processor time per anneal as the physical annealer. We note a quantum advantage against simulated annealing up to a 56 logical qubit problem that involves 665 physical qubits on average. Our embedding and optimization methods, and the benchmarking paradigm, can be applied generally to other clustering problems on quantum annealers. This algorithm may be used as a building-block for more sophisticated algorithms to reach the number of primary vertices at the LHC.

DOI
10.48550/arxiv.1903.08879

Related papers

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

Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders

H. Okawa, Q. Zeng, Xian-Zhe Tao +1 more

Abstract Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the particle multiplicity is high, which will be the conditions at future colliders, such as the High Luminosity Large Hadron Collider and Super Proton–Proton Collider. Track reconstruction can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, for which various quantum algorithms have been investigated and evaluated with both a quantum simulator and hardware. Simulated bifurcation algorithms are a set of quantum-annealing-inspired algorithms, known to be serious competitors to other Ising machines. In this study, we show that simulated bifurcation algorithms can be employed to solve the particle tracking problem. The simulated bifurcation algorithms run on classical computers and are suitable for parallel processing and usage of graphical processing units, and they can handle significantly large amounts of data at high speed. These algorithms exhibit reconstruction efficiency and purity comparable to or sometimes improved over those of simulated annealing, but the running time can be reduced by as much as four orders of magnitude. These results suggest that QUBO models together with quantum-annealing-inspired algorithms are valuable for current and future particle tracking problems.

arXiv:2402.14718•Computing and Software for Big Science•Aug 28, 2024•9 citations

A Pattern Recognition Algorithm for Quantum Annealers

Frédéric Bapst, W. Bhimji, P. Calafiura +4 more

Abstract The reconstruction of charged particles will be a key computing challenge for the high-luminosity Large Hadron Collider (HL-LHC) where increased data rates lead to a large increase in running time for current pattern recognition algorithms. An alternative approach explored here expresses pattern recognition as a quadratic unconstrained binary optimization (QUBO), which allows algorithms to be run on classical and quantum annealers. While the overall timing of the proposed approach and its scaling has still to be measured and studied, we demonstrate that, in terms of efficiency and purity, the same physics performance of the LHC tracking algorithms can be achieved. More research will be needed to achieve comparable performance in HL-LHC conditions, as increasing track density decreases the purity of the QUBO track segment classifier.

arXiv:1902.08324•Computing and Software for Big Science•Dec 9, 2019•59 citations

Quantum annealing algorithms for track pattern recognition

M. Saito, P. Calafiura, Heather M. Gray +7 more

The High-Luminosity Large Hadron Collider (HL-LHC) starts from 2027 to extend the physics discovery potential at the energy frontier. The HL-LHC produces experimental data with a much higher luminosity, requiring a large amount of computing resources mainly due to the complexity of a track pattern recognition algorithm. Quantum annealing might be a solution for an efficient track pattern recognition in the HL-LHC environment. We demonstrated to perform the track pattern recognition by using the D-Wave annealing machine and the Fujitsu Digital Annealer. The tracking efficiency and purity for the D-Wave quantum annealer are comparable with those for a classical simulated annealing at a low pileup condition, while a drop in performance is found at a high pileup condition, corresponding to the HL-LHC pileup environment. The tracking efficiency and purity for the Fujitsu Digital Annealer are nearly the same as the classical simulated annealing.

EPJ Web of Conferences•Jan 1, 2020•12 citations

A Digital Quantum Algorithm for Jet Clustering in High-Energy Physics

Pires, Diogo, P. Bargassa, J. Seixas +1 more

Experimental High-Energy Physics (HEP), especially the Large Hadron Collider (LHC) programme at the European Organization for Nuclear Research (CERN), is one of the most computationally intensive activities in the world. This demand is set to increase significantly with the upcoming High-Luminosity LHC (HL-LHC), and even more in future machines, such as the Future Circular Collider (FCC). As a consequence, event reconstruction, and in particular jet clustering, is bound to become an even more daunting problem, thus challenging present day computing resources. In this work, we present the first digital quantum algorithm to tackle jet clustering, opening the way for digital quantum processors to address this challenging problem. Furthermore, we show that, at present and future collider energies, our algorithm has comparable, yet generally lower complexity relative to the classical state-of-the-art $k_t$ clustering algorithm.

arXiv:2101.05618•Jan 11, 2021•22 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
Clustering of charged particle tracks along the beam axis is the first step in reconstructing the positions of hadronic interactions, also known as primary vertices, at hadron collider experiments. We use a 2036 physical qubit D-Wave quantum annealer to perform track clustering in a limited capacity on artificial events where the positions of primary vertices and tracks resemble those measured by the Compact Muon Solenoid experiment at the Large Hadron Collider. The algorithm, which is not a classical-quantum hybrid but relies entirely on quantum annealing, is tested on a variety of event topologies. We demonstrate a deterministic graph-embedding of the problem on the D-Wave Chimera architecture, a method for optimizing the coupling strengths within logical qubits, and a method for optimizing annealing time. Further, we benchmark it against simulated annealing on a commercial CPU constrained to the same processor time per anneal as the physical annealer. We note a quantum advantage against simulated annealing up to a 56 logical qubit problem that involves 665 physical qubits on average. Our embedding and optimization methods, and the benchmarking paradigm, can be applied generally to other clustering problems on quantum annealers. This algorithm may be used as a building-block for more sophisticated algorithms to reach the number of primary vertices at the LHC.
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.
Abstract Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the particle multiplicity is high, which will be the conditions at future colliders, such as the High Luminosity Large Hadron Collider and Super Proton–Proton Collider. Track reconstruction can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, for which various quantum algorithms have been investigated and evaluated with both a quantum simulator and hardware. Simulated bifurcation algorithms are a set of quantum-annealing-inspired algorithms, known to be serious competitors to other Ising machines. In this study, we show that simulated bifurcation algorithms can be employed to solve the particle tracking problem. The simulated bifurcation algorithms run on classical computers and are suitable for parallel processing and usage of graphical processing units, and they can handle significantly large amounts of data at high speed. These algorithms exhibit reconstruction efficiency and purity comparable to or sometimes improved over those of simulated annealing, but the running time can be reduced by as much as four orders of magnitude. These results suggest that QUBO models together with quantum-annealing-inspired algorithms are valuable for current and future particle tracking problems.
Abstract The reconstruction of charged particles will be a key computing challenge for the high-luminosity Large Hadron Collider (HL-LHC) where increased data rates lead to a large increase in running time for current pattern recognition algorithms. An alternative approach explored here expresses pattern recognition as a quadratic unconstrained binary optimization (QUBO), which allows algorithms to be run on classical and quantum annealers. While the overall timing of the proposed approach and its scaling has still to be measured and studied, we demonstrate that, in terms of efficiency and purity, the same physics performance of the LHC tracking algorithms can be achieved. More research will be needed to achieve comparable performance in HL-LHC conditions, as increasing track density decreases the purity of the QUBO track segment classifier.
The High-Luminosity Large Hadron Collider (HL-LHC) starts from 2027 to extend the physics discovery potential at the energy frontier. The HL-LHC produces experimental data with a much higher luminosity, requiring a large amount of computing resources mainly due to the complexity of a track pattern recognition algorithm. Quantum annealing might be a solution for an efficient track pattern recognition in the HL-LHC environment. We demonstrated to perform the track pattern recognition by using the D-Wave annealing machine and the Fujitsu Digital Annealer. The tracking efficiency and purity for the D-Wave quantum annealer are comparable with those for a classical simulated annealing at a low pileup condition, while a drop in performance is found at a high pileup condition, corresponding to the HL-LHC pileup environment. The tracking efficiency and purity for the Fujitsu Digital Annealer are nearly the same as the classical simulated annealing.
Experimental High-Energy Physics (HEP), especially the Large Hadron Collider (LHC) programme at the European Organization for Nuclear Research (CERN), is one of the most computationally intensive activities in the world. This demand is set to increase significantly with the upcoming High-Luminosity LHC (HL-LHC), and even more in future machines, such as the Future Circular Collider (FCC). As a consequence, event reconstruction, and in particular jet clustering, is bound to become an even more daunting problem, thus challenging present day computing resources. In this work, we present the first digital quantum algorithm to tackle jet clustering, opening the way for digital quantum processors to address this challenging problem. Furthermore, we show that, at present and future collider energies, our algorithm has comparable, yet generally lower complexity relative to the classical state-of-the-art ktk_tkt​ clustering algorithm.
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.