Parameter Estimation of Gravitational Waves with a Quantum Metropolis Algorithm
arXiv:2208.05506 · doi:10.1088/1361-6382/acafcf
Abstract
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 develop a quantum environment on classical hardware, implementing a metric to compare quantum versus classical algorithms in a fair way. We further test all these developments in the real inference of several sets of parameters of all the events of the first detection period GWTC-1 and we find a polynomial advantage in the quantum algorithms, thus setting a first starting point for future algorithms.
arXiv commentRevTex 4.2, 3 color Figures and 1 Table
References in corpus (24)
- Observation of Gravitational Waves from a Binary Black Hole Merger
- The Astropy Project: Building an inclusive, open-science project and status of the v2.0 core package
- GWTC-1: A Gravitational-Wave Transient Catalog of Compact Binary Mergers Observed by LIGO and Virgo during the First and Second Observing Runs
- Bilby: A user-friendly Bayesian inference library for gravitational-wave astronomy
- Robust parameter estimation for compact binaries with ground-based gravitational-wave observations using the LALInference software library
- The PyCBC search for gravitational waves from compact binary coalescence
- Information and Computation: Classical and Quantum Aspects
- An introduction to Bayesian inference in gravitational-wave astronomy: parameter estimation, model selection, and hierarchical models
- 3-OGC: Catalog of gravitational waves from compact-binary mergers
- Quantum Simulations of Classical Annealing Processes
- Spatial search by quantum walk is optimal for almost all graphs
- A Quantum-Quantum Metropolis Algorithm
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Speed-up via Quantum Sampling
- Parameter estimation of spinning binary inspirals using Markov-chain Monte Carlo
- Parameter estimation with gravitational waves
- Coherent Bayesian inference on compact binary inspirals using a network of interferometric gravitational wave detectors
- QFold: Quantum Walks and Deep Learning to Solve Protein Folding
- Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
- A Family of Grover's Quantum Searching Algorithms
- Quantum Metropolis Solver: A Quantum Walks Approach to Optimization Problems
- Resource estimate for quantum many-body ground-state preparation on a quantum computer
- Exploring gravitational-wave detection and parameter inference using Deep Learning methods
- Quantum Simulated Annealing
Cited by in corpus (6)
- Discrete-time Semiclassical Szegedy Quantum Walks
- SQUWALS: A Szegedy QUantum WALks Simulator
- Quantum Bayesian Inference with Renormalization for Gravitational Waves
- Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption
- Complex-Phase Extensions of Szegedy Quantum Walk on Graphs
- Gravitational-wave matched filtering on a quantum computer