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

Comparative study of quantum methods in the resolution of track findings instances

Do, Duy Dao, Hervé L. M. Kerivin, Philippe Lacomme, Bogdan Vulpescu

Published Oct 24, 2024• 0 citations
arXivHTMLPDF

Abstract

Track finding can be considered as a complex optimization problem initially introduced in particle physics involving the reconstruction of particle trajectories. A track is typically composed of several consecutive segments (track segments) that resembles a smooth curve without bifurcations. In this paper various modeling approaches are explored in order to assess both their impact and their effectiveness in solving them using quantum and classical methods. We present implementations of three classical models using CPLEX, two quantum models running on actual D-Wave quantum computers, and one quantum model on a D-Wave simulator. To facilitate a fair comparative study and encourage future research in this area, we introduce a new set of benchmark instances, categorized into small, medium, and large scales. Our evaluation of these methods on the benchmark instances indicates that D-Wave methods offer an excellent balance between computation time and result quality, outperforming CPLEX in numerous cases.

DOI
10.48550/arxiv.2410.18552

Related papers

Comparative Study of CPLEX and D-Wave for Track Finding Resolution

Duy Dao, Hervé L. M. Kerivin, Philippe Lacomme +1 more

Track finding is a complex optimization problem, originally introduced in particle physics for the reconstruction of the trajectories of particles. A track is typically composed of several consecutive segments, which together... | Find, read and cite all the research you need on Tech Science Press

Journal of quantum computing•Jan 1, 2025•1 citation

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

The Quantum Optimization Benchmarking Library

Thorsten Koch, David E. Bernal Neira, Ying Chen +24 more

Recent progress has brought benchmarking of (heuristic) quantum algorithms at scale within reach. Particularly in combinatorial optimization, it is key to empirically analyze and track progress towards quantum advantage. This work introduces a systematic, fair and comparable benchmarking framework for quantum optimization methods by presenting ten model-independent problem classes that are challenging for classical methods. Track records of specific instances and solutions are given in an accompanying open-source repository. While the individual properties of the problem classes vary, they all become challenging from less than 100 to, at most, an order of 100,000 decision variables. We reference results from state-of-the-art solvers for instances across all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems, which illustrate standardized benchmark reporting. The presented problem instances may be approached with classical or quantum algorithms executed on varying hardware platforms to drive the field towards quantum advantage.

arXiv:2504.03832•Nature Computational Science•Jun 23, 2026•6 citations

Evaluation of Quantum and Hybrid Solvers for Combinatorial Optimization

Amedeo Bertuzzi, Davide Ferrari, Antonio Manzalini +1 more

Academic and industrial sectors have been engaged in a fierce competition to develop quantum technologies, fueled by the explosive advancements in quantum hardware. While universal quantum computers have been shown to support up to hundreds of qubits, the scale of quantum annealers has reached three orders of magnitude (i.e., thousands of qubits). Therefore, quantum algorithms are becoming increasingly popular in a variety of fields, with optimization being one of the most prominent. This work aims to explore the topic of quantum optimization by comprehensively evaluating the technologies provided by D-Wave Systems. To do so, a model for the energy optimization of data centers is proposed as a benchmark. D-Wave quantum and hybrid solvers are compared, in order to identify the most suitable one for the considered application. To highlight its advantageous performance capabilities and associated solving potential, the selected D-Wave hybrid solver is then contrasted with CPLEX, a highly efficient classical solver.

arXiv:2403.10455•ACM International Conference on Computing Frontiers (CF)•May 7, 2024•8 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

Accuracy and performance evaluation of quantum, classical and hybrid solvers for the Max-Cut problem

Jaka Vodeb, Vid Eržen, Timotej Hrga +1 more

Abstract This paper benchmarks quantum, classical, and hybrid solvers on NP-hard Max-Cut and QUBO problems, emphasizing solution quality relative to known global optima. We evaluate D-Wave’s fast annealing QPU and Hybrid solver against classical simulated annealing (SA) and Toshiba’s simulated bifurcation machine (SBM) using 139 Max-Cut instances (100 to 10,000 nodes). For small instances ( $$\le $$ ≤ 250 nodes) with known global optima, Hybrid and SA consistently achieve optimal solutions, outperforming the QPU. For larger instances, SBM and slower SA yield superior solutions, while Hybrid and faster SA perform less effectively. Computation time varies across solvers.

arXiv:2412.07460•Quantum Information Processing•Jul 3, 2026•1 citation
Track finding can be considered as a complex optimization problem initially introduced in particle physics involving the reconstruction of particle trajectories. A track is typically composed of several consecutive segments (track segments) that resembles a smooth curve without bifurcations. In this paper various modeling approaches are explored in order to assess both their impact and their effectiveness in solving them using quantum and classical methods. We present implementations of three classical models using CPLEX, two quantum models running on actual D-Wave quantum computers, and one quantum model on a D-Wave simulator. To facilitate a fair comparative study and encourage future research in this area, we introduce a new set of benchmark instances, categorized into small, medium, and large scales. Our evaluation of these methods on the benchmark instances indicates that D-Wave methods offer an excellent balance between computation time and result quality, outperforming CPLEX in numerous cases.
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.
Recent progress has brought benchmarking of (heuristic) quantum algorithms at scale within reach. Particularly in combinatorial optimization, it is key to empirically analyze and track progress towards quantum advantage. This work introduces a systematic, fair and comparable benchmarking framework for quantum optimization methods by presenting ten model-independent problem classes that are challenging for classical methods. Track records of specific instances and solutions are given in an accompanying open-source repository. While the individual properties of the problem classes vary, they all become challenging from less than 100 to, at most, an order of 100,000 decision variables. We reference results from state-of-the-art solvers for instances across all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems, which illustrate standardized benchmark reporting. The presented problem instances may be approached with classical or quantum algorithms executed on varying hardware platforms to drive the field towards quantum advantage.
Academic and industrial sectors have been engaged in a fierce competition to develop quantum technologies, fueled by the explosive advancements in quantum hardware. While universal quantum computers have been shown to support up to hundreds of qubits, the scale of quantum annealers has reached three orders of magnitude (i.e., thousands of qubits). Therefore, quantum algorithms are becoming increasingly popular in a variety of fields, with optimization being one of the most prominent. This work aims to explore the topic of quantum optimization by comprehensively evaluating the technologies provided by D-Wave Systems. To do so, a model for the energy optimization of data centers is proposed as a benchmark. D-Wave quantum and hybrid solvers are compared, in order to identify the most suitable one for the considered application. To highlight its advantageous performance capabilities and associated solving potential, the selected D-Wave hybrid solver is then contrasted with CPLEX, a highly efficient classical solver.
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.
Abstract This paper benchmarks quantum, classical, and hybrid solvers on NP-hard Max-Cut and QUBO problems, emphasizing solution quality relative to known global optima. We evaluate D-Wave’s fast annealing QPU and Hybrid solver against classical simulated annealing (SA) and Toshiba’s simulated bifurcation machine (SBM) using 139 Max-Cut instances (100 to 10,000 nodes). For small instances ( ≤\le ≤ ≤ 250 nodes) with known global optima, Hybrid and SA consistently achieve optimal solutions, outperforming the QPU. For larger instances, SBM and slower SA yield superior solutions, while Hybrid and faster SA perform less effectively. Computation time varies across solvers.