A quantum shortcut for dark-matter searches has a memory problem
A theory proposal handles a changing signal. Its exact detector design remains impractical.
Reading tools for text size, copying, printing and your reading list

Looking for wave-like dark matter can mean scanning many frequencies without knowing which one might carry a signal. A November 10 theory preprint from Fermilab asks whether a quantum search algorithm could cut that repetition.[1]
Zachary Bogorad and Roni Harnik connect a model sensor to , the information-carrying units of a quantum computer. The qubits represent ranges where a dark-matter signal might oscillate. A signal could shift the phase of the quantum state representing a nearby frequency range, even as the signal’s own phase drifts. Grover’s algorithm uses that mark to make the candidate more likely to appear when the qubits are read.[1]
The readout would still need a follow-up measurement to check whether a real signal is present. The protocol also repeats the search with different settings to cover unknown signal strengths. Under demanding coherence and control assumptions, the search-time advantage over sequential scanning scales with the square root of the number of frequency intervals, apart from constants and logarithmic overheads.[1]
The catch is quantum memory: retaining the relationships between qubits throughout the search. At competitive weak-signal sensitivities, the required coherence can span weeks to years. In this coupling, correcting register phase errors would also erase the signal.[1]
The authors call this exact detector design nonviable. Their contribution is a theoretical route around a fluctuating signal, not a working dark-matter detector or a measured speedup.[1]