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:2611.14641

A Grover-Accelerated Search for Dark Matter

Zachary Bogorad, Roni Harnik

Published Nov 10, 2026• 0 citations
arXivHTMLPDF

Abstract

We show that Grover's algorithm can be used to parametrically accelerate wave-like dark matter searches. Despite having a finite coherence time $τ$, wavelike dark matter can imprint a coherent $O(1)$ phase onto a sensor through a dispersive coupling over an integration time which significantly exceeds $τ$. As such, we show that dark matter can be used as a repeatable quantum phase gate in a quantum device. If the sensor is prepared in a superposition of frequencies, we show that this phase can be transferred to a qubit register and digitized. The qubits are thus available for quantum computational processing in which dark matter can take part as a coherent gate. We show that Grover's algorithm can be used to speed up a search for dark matter in $N_{\rm bins}$ frequency bins by a factor of $\sqrt{N_{\rm bins}}$. Although the technological challenges to implementing such a search remain substantial, this demonstrates that there is no fundamental obstruction to accelerating wave-like dark matter searches with quantum computational techniques over many coherence times.

DOI
10.48550/arxiv.2611.14641

Related papers

Quantum Computing Enhanced Search for Wavelike Dark Matter

Yunjia Bao, Yu Cheng, Liang Jiang +1 more

Identifying a weak, stochastic signal hidden within a broad frequency band is a central challenge in the search for wavelike dark matter. We explore quantum computing enhanced sensing based on the Grover search algorithm to address this problem and find that a long integration time stabilizes the accumulated sensing phase, reducing quantum signal processing (QSP) errors induced by dark matter fluctuations. We further propose alternating the signs of the QSP angles between oracle calls to suppress the coherent accumulation of the intrinsic QSP approximation errors during the search. Combining these strategies in a transmon-based benchmark, we obtain a projected sensitivity to axion dark matter beyond existing astrophysical limits. This opens access to substantial unexplored parameter space across the $10$-$100\,μ\mathrm{eV}$ mass range and offers an accelerated discovery channel for wavelike dark matter. With $10^6$ entangled sensing qubits, the projected sensitivity reaches the QCD axion band. Although illustrated with transmons, the protocol can be adapted to other experimental platforms for wavelike dark matter detection.

arXiv:2611.14629•Nov 10, 2026•0 citations

Quantum Enhancement in Dark Matter Detection with Quantum Computation

S. Chen, Hajime Fukuda, Toshiaki Inada +3 more

We propose a novel method to significantly enhance the signal rate in qubit-based dark matter detection experiments with the help of quantum interference. Various quantum sensors possess ideal properties for detecting wavelike dark matter, and qubits, commonly employed in quantum computers, are excellent candidates for dark matter detectors. We demonstrate that, by designing an appropriate quantum circuit to manipulate the qubits, the signal rate scales proportionally to n_{q}^{2}, with n_{q} being the number of sensor qubits, rather than linearly with n_{q}. Consequently, in the dark matter detection with a substantial number of sensor qubits, a significant increase in the signal rate can be expected. We provide a specific example of a quantum circuit that achieves this enhancement by coherently combining the phase evolution in each individual qubit due to its interaction with dark matter. We also demonstrate that the circuit is fault tolerant to dephasing noises, a critical quantum noise source in quantum computers. The enhancement mechanism proposed here is applicable to various modalities for quantum computers, provided that the quantum operations relevant to enhancing the dark matter signal can be applied to these devices.

arXiv:2311.10413•Physical Review Letters•Jul 8, 2024•37 citations

The Quadratic Leap: How Grover's Algorithm is Redefining Core Problems in Computer Science and Engineering

Palaganti Venkata Nagendra Sai Sandeep

Grover's algorithm stands as a cornerstone of quantum computing, offering a theoretical quadratic speedup for unstructured search problems. This allows for finding a target item in an unsorted database of N entries in approximately the square root of N steps, a significant improvement over classical algorithms which require a number of operations on the order of N in the worst case. This speedup becomes particularly compelling for very large datasets, where classical exhaustive search becomes computationally intractable. The algorithm achieves this by leveraging fundamental quantum mechanical principles, primarily superposition and interference. It operates by preparing qubits in a uniform superposition of all possible states, then iteratively applying a quantum oracle to mark the desired state by flipping its phase, followed by a diffusion operator that amplifies the probability of the marked state. Despite its theoretical promise, real-world implementation faces substantial challenges stemming from Noisy Intermediate-Scale Quantum (NISQ) hardware, which is characterized by high error rates and short coherence times. Consequently, achieving a true, scalable quantum advantage remains a future endeavor, contingent on significant hardware advancements. Nevertheless, Grover's algorithm holds significant potential across diverse fields, including enhancing brute-force attacks on cryptographic systems, accelerating solutions for optimization problems, and speeding up search processes in machine learning and unstructured database queries.

•Aug 2, 2025•2 citations

Practical Guide to Quantum Computing: Grover's Algorithm # 4

Mikhail Pavlov

Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.

•Mar 4, 2026•0 citations

Quantum Error Correction-like Noise Mitigation for Wave-like Dark Matter Searches with Quantum Sensors

Hajime Fukuda, Takeo Moroi, Thanaporn Sichanugrist

We propose a quantum error correction-like noise mitigation protocol for enhancing the sensitivity of wave-like dark matter searches with quantum sensors. Our protocol uses multiple sensors to mitigate the noise affecting each sensor individually, allowing for the suppression of excitation noise that is parallel to the dark matter signal. We demonstrate that our protocol can improve the sensitivity to dark matter signals by a factor of $\sqrt{N}$, where $N$ is the number of sensors used, for small $N$. Furthermore, for sufficiently large $N$, we find that our protocol achieves the same performance as the standard quantum limit by the ideal measurement, which non-entangled sensors with parallel noise cannot reach due to the unknown phase of the dark matter field. Our work can be widely applied to various types of signals with unknown phases, and has the potential to enhance the sensitivity of quantum sensors such as arrays of resonant cavities.

hep-phCross-listedarXiv:2511.03253•Physical Review Letters•Nov 6, 2025•6 citations

Directional Searching for Light Dark Matter with Quantum Sensors

Hajime Fukuda, Yuichiro Matsuzaki, Thanaporn Sichanugrist

The presence of dark matter (DM) stands as one of the most compelling indications of new physics in particle physics. Typically, the detection of wavelike DM involves quantum sensors, such as qubits or cavities. The phase of the sensors is usually discarded as the value of the phase itself is not physically meaningful. However, the difference of the phase between the sensors contains the information of the velocity and direction of the DM wind. We propose a measurement protocol to extract this information from the sensors using quantum states. Our method does not require specific experimental setups and can be applied to any type of DM detector as long as the data from the detectors can be taken quantum mechanically. We also show that our method does not spoil the sensitivity of the DM detectors and is superior to the classical method based on the correlations of the DM signals between the detectors.

arXiv:2506.19614•Physical Review Letters•Oct 21, 2025•12 citations
We show that Grover's algorithm can be used to parametrically accelerate wave-like dark matter searches. Despite having a finite coherence time τττ, wavelike dark matter can imprint a coherent O(1)O(1)O(1) phase onto a sensor through a dispersive coupling over an integration time which significantly exceeds τττ. As such, we show that dark matter can be used as a repeatable quantum phase gate in a quantum device. If the sensor is prepared in a superposition of frequencies, we show that this phase can be transferred to a qubit register and digitized. The qubits are thus available for quantum computational processing in which dark matter can take part as a coherent gate. We show that Grover's algorithm can be used to speed up a search for dark matter in NbinsN_{\rm bins}Nbins​ frequency bins by a factor of Nbins\sqrt{N_{\rm bins}}Nbins​​. Although the technological challenges to implementing such a search remain substantial, this demonstrates that there is no fundamental obstruction to accelerating wave-like dark matter searches with quantum computational techniques over many coherence times.
Identifying a weak, stochastic signal hidden within a broad frequency band is a central challenge in the search for wavelike dark matter. We explore quantum computing enhanced sensing based on the Grover search algorithm to address this problem and find that a long integration time stabilizes the accumulated sensing phase, reducing quantum signal processing (QSP) errors induced by dark matter fluctuations. We further propose alternating the signs of the QSP angles between oracle calls to suppress the coherent accumulation of the intrinsic QSP approximation errors during the search. Combining these strategies in a transmon-based benchmark, we obtain a projected sensitivity to axion dark matter beyond existing astrophysical limits. This opens access to substantial unexplored parameter space across the 101010-100 μeV100\,μ\mathrm{eV}100μeV mass range and offers an accelerated discovery channel for wavelike dark matter. With 10610^6106 entangled sensing qubits, the projected sensitivity reaches the QCD axion band. Although illustrated with transmons, the protocol can be adapted to other experimental platforms for wavelike dark matter detection.
We propose a novel method to significantly enhance the signal rate in qubit-based dark matter detection experiments with the help of quantum interference. Various quantum sensors possess ideal properties for detecting wavelike dark matter, and qubits, commonly employed in quantum computers, are excellent candidates for dark matter detectors. We demonstrate that, by designing an appropriate quantum circuit to manipulate the qubits, the signal rate scales proportionally to n_{q}^{2}, with n_{q} being the number of sensor qubits, rather than linearly with n_{q}. Consequently, in the dark matter detection with a substantial number of sensor qubits, a significant increase in the signal rate can be expected. We provide a specific example of a quantum circuit that achieves this enhancement by coherently combining the phase evolution in each individual qubit due to its interaction with dark matter. We also demonstrate that the circuit is fault tolerant to dephasing noises, a critical quantum noise source in quantum computers. The enhancement mechanism proposed here is applicable to various modalities for quantum computers, provided that the quantum operations relevant to enhancing the dark matter signal can be applied to these devices.
Grover's algorithm stands as a cornerstone of quantum computing, offering a theoretical quadratic speedup for unstructured search problems. This allows for finding a target item in an unsorted database of N entries in approximately the square root of N steps, a significant improvement over classical algorithms which require a number of operations on the order of N in the worst case. This speedup becomes particularly compelling for very large datasets, where classical exhaustive search becomes computationally intractable. The algorithm achieves this by leveraging fundamental quantum mechanical principles, primarily superposition and interference. It operates by preparing qubits in a uniform superposition of all possible states, then iteratively applying a quantum oracle to mark the desired state by flipping its phase, followed by a diffusion operator that amplifies the probability of the marked state. Despite its theoretical promise, real-world implementation faces substantial challenges stemming from Noisy Intermediate-Scale Quantum (NISQ) hardware, which is characterized by high error rates and short coherence times. Consequently, achieving a true, scalable quantum advantage remains a future endeavor, contingent on significant hardware advancements. Nevertheless, Grover's algorithm holds significant potential across diverse fields, including enhancing brute-force attacks on cryptographic systems, accelerating solutions for optimization problems, and speeding up search processes in machine learning and unstructured database queries.
Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.
We propose a quantum error correction-like noise mitigation protocol for enhancing the sensitivity of wave-like dark matter searches with quantum sensors. Our protocol uses multiple sensors to mitigate the noise affecting each sensor individually, allowing for the suppression of excitation noise that is parallel to the dark matter signal. We demonstrate that our protocol can improve the sensitivity to dark matter signals by a factor of N\sqrt{N}N​, where NNN is the number of sensors used, for small NNN. Furthermore, for sufficiently large NNN, we find that our protocol achieves the same performance as the standard quantum limit by the ideal measurement, which non-entangled sensors with parallel noise cannot reach due to the unknown phase of the dark matter field. Our work can be widely applied to various types of signals with unknown phases, and has the potential to enhance the sensitivity of quantum sensors such as arrays of resonant cavities.
The presence of dark matter (DM) stands as one of the most compelling indications of new physics in particle physics. Typically, the detection of wavelike DM involves quantum sensors, such as qubits or cavities. The phase of the sensors is usually discarded as the value of the phase itself is not physically meaningful. However, the difference of the phase between the sensors contains the information of the velocity and direction of the DM wind. We propose a measurement protocol to extract this information from the sensors using quantum states. Our method does not require specific experimental setups and can be applied to any type of DM detector as long as the data from the detectors can be taken quantum mechanically. We also show that our method does not spoil the sensitivity of the DM detectors and is superior to the classical method based on the correlations of the DM signals between the detectors.