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

International Conference on High Energy Physics (ICHEP)

Quantum Track Reconstruction Algorithms for non-HEP applications

Kristiane Novotny, Cenk Tüysüz, Carla Rieger, D. Dobos, Karolos Jozef Potamianos, Sofia Vallecorsa, Federico Carminati, Bilge Melahat Demirköz, Jean-Roch Vlimant, Fabio Fracas

Published Feb 21, 2021• 1 citation
Publisher

Abstract

The expected increase in simultaneous collisions creates a challenge for accurate particle track reconstruction in High Luminosity LHC experiments. Similar challenges can be seen in non-HEP trajectory reconstruction use-cases, where tracking and track evaluation algorithms are used. High occupancy, track density, complexity and fast growth therefore exponentially increase the demand of algorithms in terms of time, memory and computing resources. While traditionally Kalman filter (or even simpler algorithms) are used, they are expected to scale worse than quadratic and thus strongly increasing the total processing time. Graph Neural Networks (GNN) are currently explored for HEP, but also non HEP trajectory reconstruction applications. Quantum Computers with their feature of evaluating a very large number of states simultaneously are therefore good candidates for such complex searches in large parameter and graph spaces. In this paper we present our work on implementing a quantum-based graph tracking machine learning algorithm to evaluate Traffic collision avoidance system (TCAS) probabilities of commercial flights.

DOI
10.22323/1.390.0983

Related papers

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•14 citations

Quantum Graph Neural Networks for Track Reconstruction in Particle Physics and Beyond

Cenk Tüysüz, Bilge Melahat Demirköz, D. Dobos +6 more

The Large Hadron Collider (LHC) at the European Organisation for Nuclear Research (CERN) will undergo an upgrade to further increase the instantaneous rate of particle collisions (luminosity) and become the High Luminosity LHC. This increase in luminosity, will yield many more detector hits (occupancy), and thus measurements will pose a challenge to track reconstruction algorithms being responsible to determine particle trajectories from those hits. Similar challenges exist in non-high energy physics (HEP) trajectory reconstruction use-cases. High occupancy, track density, complexity and fast growth exponentially increase the demand of algorithms in terms of time, memory and computing resources.

•Oct 22, 2020•0 citations

Performance of Particle Tracking Using a Quantum Graph Neural Network

Tüysüz, Cenk, Novotny, Kristiane, Rieger, Carla +7 more

The Large Hadron Collider (LHC) at the European Organisation for Nuclear Research (CERN) will be upgraded to further increase the instantaneous rate of particle collisions (luminosity) and become the High Luminosity LHC. This increase in luminosity, will yield many more detector hits (occupancy), and thus measurements will pose a challenge to track reconstruction algorithms being responsible to determine particle trajectories from those hits. This work explores the possibility of converting a novel Graph Neural Network model, that proven itself for the track reconstruction task, to a Hybrid Graph Neural Network in order to benefit the exponentially growing Hilbert Space. Several Parametrized Quantum Circuits (PQC) are tested and their performance against the classical approach is compared. We show that the hybrid model can perform similar to the classical approach. We also present a future road map to further increase the performance of the current hybrid model.

arXiv:2012.01379•Dec 2, 2020•4 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•29 citations

Embedding of particle tracking data using hybrid quantum-classical neural networks

Carla Rieger, Cenk Tüysüz, Kristiane Novotny +5 more

The High Luminosity Large Hadron Collider (HL-LHC) at CERN will involve a significant increase in complexity and sheer size of data with respect to the current LHC experimental complex. Hence, the task of reconstructing the particle trajectories will become more involved due to the number of simultaneous collisions and the resulting increased detector occupancy. Aiming to identify the particle paths, machine learning techniques such as graph neural networks are being explored in the HEP.TrkX project and its successor, the Exa.TrkX project. Both show promising results and reduce the combinatorial nature of the problem. Previous results of our team have demonstrated the successful attempt of applying quantum graph neural networks to reconstruct the particle track based on the hits of the detector. A higher overall accuracy is gained by representing the training data in a meaningful way within an embedded space. That has been included in the Exa.TrkX project by applying a classical MLP. Consequently, pairs of hits belonging to different trajectories are pushed apart while those belonging to the same ones stay close together. We explore the applicability of variational quantum circuits that include a relatively low number of qubits applicable to NISQ devices within the task of embedding and show preliminary results.

EPJ Web of Conferences•Jan 1, 2021•5 citations

Quantum Machine Learning for Track Reconstruction

Laura Cappelli, Matteo Argenton, C. Bozzi +2 more

Tracking charged particles in high-energy physics experiments is a computationally intensive task. With the advent of the High Luminosity LHC era, which is expected to significantly increase the number of proton-proton interactions per beam collision, the amount of data to be analysed will increase significantly. As a consequence, local pattern recognition algorithms suffer from scaling problems. In this work, we investigate the possibility of using machine learning techniques in combination with quantum computing. In particular, we represent particle trajectories as a graph data structure and train a quantum graph neural network to perform global pattern recognition. We show recent results on the application of this method, with scalability tests for increasing pileup values. We also provide insights into various aspects of code development in different quantum programming frameworks such as Pennylane and IBM Qiskit. Finally, we discuss the critical points and give an outlook of potential improvements and alternative approaches.

EPJ Web of Conferences•Jan 1, 2025•0 citations
The expected increase in simultaneous collisions creates a challenge for accurate particle track reconstruction in High Luminosity LHC experiments. Similar challenges can be seen in non-HEP trajectory reconstruction use-cases, where tracking and track evaluation algorithms are used. High occupancy, track density, complexity and fast growth therefore exponentially increase the demand of algorithms in terms of time, memory and computing resources. While traditionally Kalman filter (or even simpler algorithms) are used, they are expected to scale worse than quadratic and thus strongly increasing the total processing time. Graph Neural Networks (GNN) are currently explored for HEP, but also non HEP trajectory reconstruction applications. Quantum Computers with their feature of evaluating a very large number of states simultaneously are therefore good candidates for such complex searches in large parameter and graph spaces. In this paper we present our work on implementing a quantum-based graph tracking machine learning algorithm to evaluate Traffic collision avoidance system (TCAS) probabilities of commercial flights.
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.
The Large Hadron Collider (LHC) at the European Organisation for Nuclear Research (CERN) will undergo an upgrade to further increase the instantaneous rate of particle collisions (luminosity) and become the High Luminosity LHC. This increase in luminosity, will yield many more detector hits (occupancy), and thus measurements will pose a challenge to track reconstruction algorithms being responsible to determine particle trajectories from those hits. Similar challenges exist in non-high energy physics (HEP) trajectory reconstruction use-cases. High occupancy, track density, complexity and fast growth exponentially increase the demand of algorithms in terms of time, memory and computing resources.
The Large Hadron Collider (LHC) at the European Organisation for Nuclear Research (CERN) will be upgraded to further increase the instantaneous rate of particle collisions (luminosity) and become the High Luminosity LHC. This increase in luminosity, will yield many more detector hits (occupancy), and thus measurements will pose a challenge to track reconstruction algorithms being responsible to determine particle trajectories from those hits. This work explores the possibility of converting a novel Graph Neural Network model, that proven itself for the track reconstruction task, to a Hybrid Graph Neural Network in order to benefit the exponentially growing Hilbert Space. Several Parametrized Quantum Circuits (PQC) are tested and their performance against the classical approach is compared. We show that the hybrid model can perform similar to the classical approach. We also present a future road map to further increase the performance of the current hybrid model.
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 High Luminosity Large Hadron Collider (HL-LHC) at CERN will involve a significant increase in complexity and sheer size of data with respect to the current LHC experimental complex. Hence, the task of reconstructing the particle trajectories will become more involved due to the number of simultaneous collisions and the resulting increased detector occupancy. Aiming to identify the particle paths, machine learning techniques such as graph neural networks are being explored in the HEP.TrkX project and its successor, the Exa.TrkX project. Both show promising results and reduce the combinatorial nature of the problem. Previous results of our team have demonstrated the successful attempt of applying quantum graph neural networks to reconstruct the particle track based on the hits of the detector. A higher overall accuracy is gained by representing the training data in a meaningful way within an embedded space. That has been included in the Exa.TrkX project by applying a classical MLP. Consequently, pairs of hits belonging to different trajectories are pushed apart while those belonging to the same ones stay close together. We explore the applicability of variational quantum circuits that include a relatively low number of qubits applicable to NISQ devices within the task of embedding and show preliminary results.
Tracking charged particles in high-energy physics experiments is a computationally intensive task. With the advent of the High Luminosity LHC era, which is expected to significantly increase the number of proton-proton interactions per beam collision, the amount of data to be analysed will increase significantly. As a consequence, local pattern recognition algorithms suffer from scaling problems. In this work, we investigate the possibility of using machine learning techniques in combination with quantum computing. In particular, we represent particle trajectories as a graph data structure and train a quantum graph neural network to perform global pattern recognition. We show recent results on the application of this method, with scalability tests for increasing pileup values. We also provide insights into various aspects of code development in different quantum programming frameworks such as Pennylane and IBM Qiskit. Finally, we discuss the critical points and give an outlook of potential improvements and alternative approaches.