Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2208.05506 · Classical and Quantum Gravity

Parameter estimation of gravitational waves with a quantum metropolis algorithm

Gabriel Escrig, Roberto Campos, Pablo A. M. Casares, Miguel Angel Martin-Delgado

Published Jan 3, 2023• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1361-6382/acafcf

Related papers

Quantum Bayesian Inference with Renormalization for Gravitational Waves

Gabriel Escrig, Roberto Campos, H. Qi +1 more

Abstract Advancements in gravitational-wave (GW) interferometers, particularly the next generation, are poised to enable the detections of orders of magnitude more GWs from compact binary coalescences. While the surge in detections will profoundly advance GW astronomy and multimessenger astrophysics, it also poses significant computational challenges in parameter estimation. In this work, we introduce a hybrid quantum algorithm qBIRD, which performs quantum Bayesian inference with renormalization and downsampling to infer GW parameters. We validate the algorithm using both simulated and observed GWs from binary black hole mergers on quantum simulators, demonstrating that its accuracy is comparable to classical Markov Chain Monte Carlo methods. Currently, our analyses focus on a subset of parameters, including chirp mass and mass ratio, due to the limitations from classical hardware in simulating quantum algorithms. However, qBIRD can accommodate a broader parameter space when the constraints are eliminated with a small-scale quantum computer of sufficient logical qubits.

arXiv:2403.00846•The Astrophysical Journal Letters•Jan 28, 2025•3 citations

Quantum variational rewinding for gravitational wave detection

Benjamin Rodrigues de Miranda, Domenica Dibenedetto, Niels M. P. Neumann +1 more

Abstract Gravitational waves carry information about far away phenomena which astronomers can use to form a better picture of the universe. Over the past few years, numerous gravitational waves have been detected using a method called matched filtering; however, this approach has two main drawbacks. First, it requires knowledge of the sought-after waveform beforehand. Second, it is infeasible for gravitational wave searches which are precise or cover a long time span. While attempts have been made to use classical machine learning to overcome these difficulties, the usage of quantum machine learning in this context is relatively unexplored. Quantum variational rewinding is a hybrid quantum-classical machine learning algorithm for time series anomaly detection. This work makes the first steps in investigating its potential for gravitational wave detection. Training and testing the algorithm was done without depending on synthetic data. In a noiseless simulated environment, quantum variational rewinding was able to pick out all confirmed gravitational wave signals from the background noise of a detector with perfect accuracy when filtering was applied before hand and was able to do so to a high degree of success without filtering. Anomaly detection with this algorithm was performed with two signals on quantum hardware as a proof of concept. Using Fisher information, both the capacity and the trainability of quantum variational rewinding are described so that future approaches can be compared in these regards. With new gravitational wave detectors under development, even more data will be generated for analysis in the future, compounding the existing bottlenecks in the search pipeline. As such, approaches which help tackle issues with the current approach to gravitational wave analysis are in demand, and the empirical results from this work assert that quantum computing should not be overlooked in this process.

Quantum Machine Intelligence•Feb 8, 2025•3 citations

A quantum algorithm for gravitational wave matched filtering

Sijia Gao, F. J. Hayes, Sarah Croke +2 more

Quantum computational devices, currently under development, have the potential to accelerate data analysis techniques beyond the ability of any classical algorithm. We propose the application of a quantum algorithm for the detection of unknown signals in noisy data. We apply Grover's algorithm to matched-filtering, a signal processing technique that compares data to a number of candidate signal templates. In comparison to the classical method, this provides a speed-up proportional to the square-root of the number of templates, which would make possible otherwise intractable searches. We demonstrate both a proof-of-principle quantum circuit implementation, and a simulation of the algorithm's application to the detection of the first gravitational wave signal GW150914. We discuss the time complexity and space requirements of our algorithm as well as its implications for the currently computationally-limited searches for continuous gravitational waves.

arXiv:2109.01535•Sep 3, 2021•0 citations

Quantum algorithm for gravitational-wave matched filtering

Sijia Gao, F. J. Hayes, Sarah Croke +2 more

Quantum computational devices currently under development have the potential to accelerate data analysis techniques beyond the ability of any classical algorithm. We propose the application of a quantum algorithm for the detection of unknown signals in noisy data. We apply Grover's algorithm to matched filtering, a signal processing technique that compares data to a number of candidate signal templates. In comparison to the classical method, this provides a speedup proportional to the square root of the number of templates, which would make possible otherwise intractable searches. We demonstrate both a proof-of-principle quantum circuit implementation and a simulation of the algorithm's application to the detection of the gravitational wave signal GW150914. We discuss the time complexity and space requirements of our algorithm as well as its implications for the currently computationally limited searches for continuous gravitational waves.

Physical Review Research•Apr 4, 2022•16 citations

Gravitational-wave matched filtering with variational quantum algorithms

Jason Pye, Edric Matwiejew, Aidan Smith +3 more

In this paper, we explore the application of variational quantum algorithms designed for classical optimization to the problem of matched filtering in the detection of gravitational waves. Matched filtering for detecting gravitational wave signals requires searching through a large number of template waveforms, to find one which is highly correlated with segments of detector data. This computationally intensive task needs to be done quickly for low latency searches in order to aid with follow-up multi-messenger observations. The variational quantum algorithms we study for this task consist of quantum walk-based generalizations of the Quantum Approximate Optimization Algorithm (QAOA). We present results of classical numerical simulations of these quantum algorithms using open science data from LIGO. These results show that the tested variational quantum algorithms are outperformed by an unstructured restricted-depth Grover search algorithm, suggesting that the latter is optimal for this computational task.

arXiv:2408.13177•Aug 23, 2024•0 citations

Quantum computing tools for fast detection of gravitational waves in the context of LISA space mission

Maria Catalina Isfan, L. Caramete, A. Caramete +2 more

Abstract The field of gravitational wave (GW) detection is progressing rapidly, with several next-generation observatories on the horizon, including LISA. GW data is challenging to analyze due to highly variable signals shaped by source properties and the presence of complex noise. These factors emphasize the need for robust, advanced analysis tools. In this context, we have initiated the development of a low-latency GW detection pipeline based on quantum neural networks (QNNs). Previously, we demonstrated that QNNs can recognize GWs simulated using post-Newtonian approximations in the Newtonian limit. We then extended this work using data from the LISA Consortium, training QNNs to distinguish between noisy GW signals and pure noise. Currently, we are evaluating performance on the Sangria LISA Data Challenge dataset and comparing it against classical methods. Our results show that QNNs can reliably distinguish GW signals embedded in noise, achieving classification accuracies above 98%. Notably, our QNN identified 5 out of 6 mergers in the Sangria blind dataset. The missed event corresponds to the lowest signal-to-noise ratio (SNR) source, indicating that model sensitivity improvements are needed for weak signals. This can potentially be addressed using additional mock training datasets, and by testing different QNN architectures and ansatzes. Compared with a recurrent neural network baseline, the QNN achieves comparable accuracy on higher-SNR events while using orders of magnitude fewer trainable parameters. These results demonstrate the feasibility of QNNs for GW detection and motivate further investigation of quantum-enhanced data analysis techniques for LISA.

arXiv:2509.12929•Classical and Quantum Gravity•Oct 24, 2025•2 citations
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.
Abstract Advancements in gravitational-wave (GW) interferometers, particularly the next generation, are poised to enable the detections of orders of magnitude more GWs from compact binary coalescences. While the surge in detections will profoundly advance GW astronomy and multimessenger astrophysics, it also poses significant computational challenges in parameter estimation. In this work, we introduce a hybrid quantum algorithm qBIRD, which performs quantum Bayesian inference with renormalization and downsampling to infer GW parameters. We validate the algorithm using both simulated and observed GWs from binary black hole mergers on quantum simulators, demonstrating that its accuracy is comparable to classical Markov Chain Monte Carlo methods. Currently, our analyses focus on a subset of parameters, including chirp mass and mass ratio, due to the limitations from classical hardware in simulating quantum algorithms. However, qBIRD can accommodate a broader parameter space when the constraints are eliminated with a small-scale quantum computer of sufficient logical qubits.
Abstract Gravitational waves carry information about far away phenomena which astronomers can use to form a better picture of the universe. Over the past few years, numerous gravitational waves have been detected using a method called matched filtering; however, this approach has two main drawbacks. First, it requires knowledge of the sought-after waveform beforehand. Second, it is infeasible for gravitational wave searches which are precise or cover a long time span. While attempts have been made to use classical machine learning to overcome these difficulties, the usage of quantum machine learning in this context is relatively unexplored. Quantum variational rewinding is a hybrid quantum-classical machine learning algorithm for time series anomaly detection. This work makes the first steps in investigating its potential for gravitational wave detection. Training and testing the algorithm was done without depending on synthetic data. In a noiseless simulated environment, quantum variational rewinding was able to pick out all confirmed gravitational wave signals from the background noise of a detector with perfect accuracy when filtering was applied before hand and was able to do so to a high degree of success without filtering. Anomaly detection with this algorithm was performed with two signals on quantum hardware as a proof of concept. Using Fisher information, both the capacity and the trainability of quantum variational rewinding are described so that future approaches can be compared in these regards. With new gravitational wave detectors under development, even more data will be generated for analysis in the future, compounding the existing bottlenecks in the search pipeline. As such, approaches which help tackle issues with the current approach to gravitational wave analysis are in demand, and the empirical results from this work assert that quantum computing should not be overlooked in this process.
Quantum computational devices, currently under development, have the potential to accelerate data analysis techniques beyond the ability of any classical algorithm. We propose the application of a quantum algorithm for the detection of unknown signals in noisy data. We apply Grover's algorithm to matched-filtering, a signal processing technique that compares data to a number of candidate signal templates. In comparison to the classical method, this provides a speed-up proportional to the square-root of the number of templates, which would make possible otherwise intractable searches. We demonstrate both a proof-of-principle quantum circuit implementation, and a simulation of the algorithm's application to the detection of the first gravitational wave signal GW150914. We discuss the time complexity and space requirements of our algorithm as well as its implications for the currently computationally-limited searches for continuous gravitational waves.
Quantum computational devices currently under development have the potential to accelerate data analysis techniques beyond the ability of any classical algorithm. We propose the application of a quantum algorithm for the detection of unknown signals in noisy data. We apply Grover's algorithm to matched filtering, a signal processing technique that compares data to a number of candidate signal templates. In comparison to the classical method, this provides a speedup proportional to the square root of the number of templates, which would make possible otherwise intractable searches. We demonstrate both a proof-of-principle quantum circuit implementation and a simulation of the algorithm's application to the detection of the gravitational wave signal GW150914. We discuss the time complexity and space requirements of our algorithm as well as its implications for the currently computationally limited searches for continuous gravitational waves.
In this paper, we explore the application of variational quantum algorithms designed for classical optimization to the problem of matched filtering in the detection of gravitational waves. Matched filtering for detecting gravitational wave signals requires searching through a large number of template waveforms, to find one which is highly correlated with segments of detector data. This computationally intensive task needs to be done quickly for low latency searches in order to aid with follow-up multi-messenger observations. The variational quantum algorithms we study for this task consist of quantum walk-based generalizations of the Quantum Approximate Optimization Algorithm (QAOA). We present results of classical numerical simulations of these quantum algorithms using open science data from LIGO. These results show that the tested variational quantum algorithms are outperformed by an unstructured restricted-depth Grover search algorithm, suggesting that the latter is optimal for this computational task.
Abstract The field of gravitational wave (GW) detection is progressing rapidly, with several next-generation observatories on the horizon, including LISA. GW data is challenging to analyze due to highly variable signals shaped by source properties and the presence of complex noise. These factors emphasize the need for robust, advanced analysis tools. In this context, we have initiated the development of a low-latency GW detection pipeline based on quantum neural networks (QNNs). Previously, we demonstrated that QNNs can recognize GWs simulated using post-Newtonian approximations in the Newtonian limit. We then extended this work using data from the LISA Consortium, training QNNs to distinguish between noisy GW signals and pure noise. Currently, we are evaluating performance on the Sangria LISA Data Challenge dataset and comparing it against classical methods. Our results show that QNNs can reliably distinguish GW signals embedded in noise, achieving classification accuracies above 98%. Notably, our QNN identified 5 out of 6 mergers in the Sangria blind dataset. The missed event corresponds to the lowest signal-to-noise ratio (SNR) source, indicating that model sensitivity improvements are needed for weak signals. This can potentially be addressed using additional mock training datasets, and by testing different QNN architectures and ansatzes. Compared with a recurrent neural network baseline, the QNN achieves comparable accuracy on higher-SNR events while using orders of magnitude fewer trainable parameters. These results demonstrate the feasibility of QNNs for GW detection and motivate further investigation of quantum-enhanced data analysis techniques for LISA.