Speaker
Description
Track and jet reconstruction are crucial components in high energy collider experiments. It is known for high consumption of computing resources, and various investigations are ongoing to cope with this challenge. These reconstruction tasks can be considered as quadratic unconstrained binary optimization (QUBO) problems, which are suitable to be solved with quantum algorithms. I will present recent studies on quantum-annealing-inspired algorithms, in particular the simulated bifurcation (SB) algorithms. They can handle significantly large data at high speed; e.g. as much as four orders of magnitude faster than the simulated annealing for the track reconstruction, demonstrated in our previous study. SB also provides promising performance on jet reconstruction.
