http://arxiv.org/abs/2208.05506
After the first detection of a gravitational wave in 2015, the number of successes achieved by this innovative way of looking through the universe has not stopped growing. However, the current techniques for analyzing this type of events present a serious bottleneck due to the high computational power they require. In this article we explore how recent techniques based on quantum algorithms could surpass this obstacle. For this purpose, we propose a quantization of the classical algorithms used in the literature for the inference of gravitational wave parameters based on the well-known Quantum Walks technique applied to a Metropolis-Hastings algorithm. Finally, we compare this algorithm with its classical counterpart for all the events of the first GW catalog GWTC-1 for the estimation of different sets of parameters with increasing complexities and we find a polynomial advantage in the quantum algorithms, thus setting a first starting point for future algorithms.
G. Escrig, R. Campos, P. Casares, et. al.
Thu, 18 Aug 22
44/45
Comments: RevTex 4.2, 3 color Figures and 1 Table