Investigating Quantum Speedup for Track Reconstruction: Classical and Quantum Computational Complexity Analysis

Abstract

To investigate the fundamental nature of matter and its interactions, particles are accelerated to very high energies and collided within detectors, producing a multitude of other particles that are scattered in all directions. These particles leave signals of their passage while transversing the detector. The problem of track reconstruction is to recover the original trajectories from these signals. This represents a very demanding data analysis problem, and it will become even more so as the luminosity of the next generation accelerators keeps increasing. Approaches to track reconstruction based on quantum information technologies have recently been put forward. In order to access the potential for a quantum speedup for this problem, we start by elaborating a computational complexity analysis of a standard tracking algorithm, the Combinatorial Track Finder. First, we find that it is possible to improve the classical complexity of the original algorithm. We further show that we can use quantum search algorithms to reach a lower quantum computational complexity. To the best of our knowledge, this is the first computational complexity-level demonstration of a quantum advantage for a state-of-the-art track reconstruction method. Work developed in collaboration with A.Ambainis, P.Bargassa, M.Dimitrijevs, A.Glos, M.Kālis, A.Kumar, A.Locāns, Y.Omar, S.Pratapsi, G.Quinta, A.Rivošs, J.Seixas.