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:2505.24459 · Physical review. D/Physical review. D.

Quantum search for gravitational wave of massive black hole binaries

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

Published Sep 13, 2025• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/3n8r-7dm7

Related papers

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

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

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

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

Long-algorithm based quantum search for gravitational wave

Fangzhou Guo, Jibo He

Gravitational wave astronomy is rapidly advancing with the development of new observatories, leading to an increasing volume and complexity of data. This trend places growing pressure on classical data analysis methods and motivates the exploration of quantum approaches. In this work, we introduce a quantum matched filtering framework for gravitational-wave detection based on the Long algorithm, marking its first application to the gravitational-wave data analysis. Numerical simulations show that the proposed approach preserves the quadratic speedup of quantum search while exhibiting significantly improved robustness, thereby overcoming key limitations of the Grover-algorithm based methods.

arXiv:2603.17698•Mar 18, 2026•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
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.
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.
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.
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 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.
Gravitational wave astronomy is rapidly advancing with the development of new observatories, leading to an increasing volume and complexity of data. This trend places growing pressure on classical data analysis methods and motivates the exploration of quantum approaches. In this work, we introduce a quantum matched filtering framework for gravitational-wave detection based on the Long algorithm, marking its first application to the gravitational-wave data analysis. Numerical simulations show that the proposed approach preserves the quadratic speedup of quantum search while exhibiting significantly improved robustness, thereby overcoming key limitations of the Grover-algorithm based methods.
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.