Speaker
Description
Tracking is one of the most crucial components of reconstruction in collider experiments. It is known for high consumption of computing resources, and various investigations are ongoing to cope with this challenge. The track reconstruction can be considered as a quadratic unconstrained binary optimization (QUBO) problem. Recent progress with two complementary approaches will be presented: (1) the Quantum Approximate Optimization Algorithm (QAOA) implemented in the Origin Quantum hardware, (2) quantum annealing inspired algorithms, in particular the simulated bifurcation algorithms. Both approaches show promising performance on the track reconstruction, and the latter can particularly handle significantly large data at high speed; as much as four orders of magnitude faster than the simulated annealing.
[1] H. Okawa, Springer Communications in Computer and Information Science, 2036 (2024) 272–283, arXiv:2310.10255.
[2] H. Okawa, Q.-G. Zeng, X.-Z. Tao, M.-H. Yung, arXiv:2402.14718 (2024).
| I read the instructions above | Yes |
|---|
