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:2403.00846 · The Astrophysical Journal Letters

Quantum Bayesian Inference with Renormalization for Gravitational Waves

Gabriel Escrig, Roberto Campos, H. Qi, Miguel Angel Martin-Delgado

Published Jan 28, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.3847/2041-8213/ada6ae

Related papers

Gravitational-wave matched filtering on a quantum computer

Doğa Veske, Cenk Tüysüz, Mirko Amico +6 more

Abstract State-of-the-art quantum computers have very limited applicability for accurate calculations. Here, we report the first experimental demonstration of qubit-based matched filtering for a detection of the gravitational-wave signal from a binary black hole merger. With our implementation on noisy superconducting qubits, we obtained a similar signal-to-noise ratio for the binary black hole merger as achievable with classical computation, providing evidence for the utility of qubits for practically relevant tasks. The algorithm we invented for this application is a Monte Carlo algorithm which uses quantum and classical computation together. It provides a quasi-quadratic speed-up for time-domain convolution, similar to achievable with fast Fourier transform.

arXiv:2204.04159•Physica Scripta•Jun 12, 2024•1 citation

Parameter estimation of gravitational waves with a quantum metropolis algorithm

Gabriel Escrig, Roberto Campos, Pablo A. M. Casares +1 more

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:2208.05506•Classical and Quantum Gravity•Jan 3, 2023•11 citations

Quantum state preparation of gravitational waves

F. J. Hayes, Sarah Croke, Christopher Messenger +1 more

We detail a quantum circuit capable of efficiently encoding analytical approximations to gravitational wave signal waveforms of compact binary coalescences into the amplitudes of quantum bits using both quantum arithmetic operations and hybrid classical-quantum generative modelling. The gate cost of the proposed method is considered and compared to a state preparation routine for arbitrary amplitudes, where we demonstrate up to a four orders of magnitude reduction in gate cost when considering the encoding of gravitational waveforms representative of binary neutron star inspirals detectable to the Einstein telescope. We demonstrate through a quantum simulation, that is limited to 28 qubits, the encoding of a second post-Newtonian inspiral waveform with a fidelity compared to the desired state of 0.995 when using the Grover-Rudolph algorithm, or 0.979 when using a trained quantum generative adversarial network with a significant reduction of required gates.

arXiv:2306.11073•Jun 19, 2023•1 citation

Gravitational wave matched filtering by quantum Monte Carlo integration and quantum amplitude amplification

Koichi Miyamoto, Gonzalo Morrás, Takahiro S. Yamamoto +2 more

The speedup of heavy numerical tasks by quantum computing is now actively investigated in various fields including data analysis in physics and astronomy. In this paper, we propose a new quantum algorithm for matched filtering in gravitational wave (GW) data analysis based on the previous work by Gao et al., Phys. Rev. Research 4, 023006 (2022) [arXiv:2109.01535]. Our approach uses the quantum algorithm for Monte Carlo integration for the signal-to-noise ratio (SNR) calculation instead of the fast Fourier transform used in Gao et al. and searches signal templates with high SNR by quantum amplitude amplification. In this way, we achieve an exponential reduction of the qubit number compared with Gao et al.'s algorithm, keeping a quadratic speedup over classical GW matched filtering with respect to the template number.

arXiv:2205.05966•May 12, 2022•0 citations

Gravitational wave matched filtering by quantum Monte Carlo integration and quantum amplitude amplification

Koichi Miyamoto, Gonzalo Morrás, Takahiro S. Yamamoto +2 more

The speedup of heavy numerical tasks by quantum computing is now actively investigated in various fields including data analysis in physics and astronomy. In this paper, we propose a quantum algorithm for matched filtering in gravitational wave (GW) data analysis based on the previous work by Gao et al. [Phys. Rev. Research 4, 023006 (2022)]. Our approach uses the quantum algorithm for Monte Carlo integration for the signal-to-noise ratio (SNR) calculation instead of the fast Fourier transform used in Gao et al. and searches signal templates with high SNR by quantum amplitude amplification. In this way, we achieve an exponential reduction of the qubit number compared with Gao et al.'s algorithm, keeping a quadratic speedup over classical GW matched filtering with respect to the template number.

Physical Review Research•Aug 26, 2022•6 citations

Quantum search for gravitational wave of massive black hole binaries

F.L. 福来 Guo 郭, J. He

Matched filtering is a common method for detecting gravitational waves. However, the computational costs of searching large template banks limit the efficiency of classical algorithms when searching for massive black hole binary (MBHB) systems. This work explores the application of a quantum matched filtering algorithm based on Grover's algorithm to MBHB signals. Under certain simplifying assumptions, the quantum approach can reduce the computational complexity from $O(N)$ to $O(\sqrt{N})$ theoretically, where $N$ is the size of the template bank. Simulated results illustrate the potential reduction in computational costs, while also showing that the performance can degrade in some cases due to instability of the algorithm. These findings reveal both the potential and the limitations of quantum search for MBHB signals, pointing to the importance of developing more robust and stable search strategies alongside realistic modeling in future work.

arXiv:2505.24459•Physical review. D/Physical review. D.•Sep 13, 2025•0 citations
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 State-of-the-art quantum computers have very limited applicability for accurate calculations. Here, we report the first experimental demonstration of qubit-based matched filtering for a detection of the gravitational-wave signal from a binary black hole merger. With our implementation on noisy superconducting qubits, we obtained a similar signal-to-noise ratio for the binary black hole merger as achievable with classical computation, providing evidence for the utility of qubits for practically relevant tasks. The algorithm we invented for this application is a Monte Carlo algorithm which uses quantum and classical computation together. It provides a quasi-quadratic speed-up for time-domain convolution, similar to achievable with fast Fourier transform.
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.
We detail a quantum circuit capable of efficiently encoding analytical approximations to gravitational wave signal waveforms of compact binary coalescences into the amplitudes of quantum bits using both quantum arithmetic operations and hybrid classical-quantum generative modelling. The gate cost of the proposed method is considered and compared to a state preparation routine for arbitrary amplitudes, where we demonstrate up to a four orders of magnitude reduction in gate cost when considering the encoding of gravitational waveforms representative of binary neutron star inspirals detectable to the Einstein telescope. We demonstrate through a quantum simulation, that is limited to 28 qubits, the encoding of a second post-Newtonian inspiral waveform with a fidelity compared to the desired state of 0.995 when using the Grover-Rudolph algorithm, or 0.979 when using a trained quantum generative adversarial network with a significant reduction of required gates.
The speedup of heavy numerical tasks by quantum computing is now actively investigated in various fields including data analysis in physics and astronomy. In this paper, we propose a new quantum algorithm for matched filtering in gravitational wave (GW) data analysis based on the previous work by Gao et al., Phys. Rev. Research 4, 023006 (2022) [arXiv:2109.01535]. Our approach uses the quantum algorithm for Monte Carlo integration for the signal-to-noise ratio (SNR) calculation instead of the fast Fourier transform used in Gao et al. and searches signal templates with high SNR by quantum amplitude amplification. In this way, we achieve an exponential reduction of the qubit number compared with Gao et al.'s algorithm, keeping a quadratic speedup over classical GW matched filtering with respect to the template number.
The speedup of heavy numerical tasks by quantum computing is now actively investigated in various fields including data analysis in physics and astronomy. In this paper, we propose a quantum algorithm for matched filtering in gravitational wave (GW) data analysis based on the previous work by Gao et al. [Phys. Rev. Research 4, 023006 (2022)]. Our approach uses the quantum algorithm for Monte Carlo integration for the signal-to-noise ratio (SNR) calculation instead of the fast Fourier transform used in Gao et al. and searches signal templates with high SNR by quantum amplitude amplification. In this way, we achieve an exponential reduction of the qubit number compared with Gao et al.'s algorithm, keeping a quadratic speedup over classical GW matched filtering with respect to the template number.
Matched filtering is a common method for detecting gravitational waves. However, the computational costs of searching large template banks limit the efficiency of classical algorithms when searching for massive black hole binary (MBHB) systems. This work explores the application of a quantum matched filtering algorithm based on Grover's algorithm to MBHB signals. Under certain simplifying assumptions, the quantum approach can reduce the computational complexity from O(N)O(N)O(N) to O(N)O(\sqrt{N})O(N​) theoretically, where NNN is the size of the template bank. Simulated results illustrate the potential reduction in computational costs, while also showing that the performance can degrade in some cases due to instability of the algorithm. These findings reveal both the potential and the limitations of quantum search for MBHB signals, pointing to the importance of developing more robust and stable search strategies alongside realistic modeling in future work.