⚛️ quantum physics

Experimental quantum-computing-enhanced sensing using Grover's algorithm

This paper presents an experimental proof-of-principle demonstration that repurposing Grover's search algorithm on a modest superconducting qubit-cavity system enables quantum-enhanced sensing, achieving a significant metrological advantage over conventional methods for detecting unknown-frequency signals in bandwidths exceeding 10 MHz without requiring large-scale fault-tolerant hardware.

Original authors: Mathieu Ouellet, Purnendu Sen, Xiangqin Wang, Saswata Roy, Xingrui Song, Vladimir Kremenetski, Sridhar Prabhu, Valla Fatemi, Peter L. McMahon

Published 2026-09-29

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Mathieu Ouellet, Purnendu Sen, Xiangqin Wang, Saswata Roy, Xingrui Song, Vladimir Kremenetski, Sridhar Prabhu, Valla Fatemi, Peter L. McMahon

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a world where the most delicate instruments for measuring the universe are not just passive listeners, but active thinkers. This is the emerging field of quantum computational sensing, a discipline that merges the ability to detect faint physical signals with the power of quantum computers to process information. For decades, scientists have used quantum systems, like atoms or superconducting circuits, to measure things with incredible precision. However, a new idea suggests that by adding a layer of quantum computing logic to these sensors, we can do more than just measure; we can make decisions faster and with less energy. The goal is not to reconstruct a complex signal in full detail, but simply to answer a specific question: is a signal present within a certain range of frequencies, or is it not? This approach promises to solve problems that would otherwise require massive, error-free quantum computers, making it a potential breakthrough for the technology available today.

Researchers at Cornell University have now taken a significant step toward proving this concept works in the real world. They built an experiment using a single superconducting qubit, a tiny circuit that behaves like an artificial atom, coupled to a superconducting cavity, which acts as a container for microwave signals. Their task was to determine if an incoming signal with an unknown frequency fell inside a specific, wide window of frequencies. To do this, they repurposed a famous quantum algorithm known as Grover's search algorithm. Originally designed to find a specific item in an unsorted list much faster than a classical computer could, this algorithm was adapted here to amplify the presence of a signal. Instead of searching through a database of names, the system searched through a range of frequencies. When a signal matched the target frequency, the algorithm amplified the system's response, making the "yes" answer much louder and easier to detect than it would be with a standard sensor.

The team found that this method worked exceptionally well, but only when the range of frequencies they were searching was wide enough. For narrow ranges, less than ten megahertz, the traditional method of sensing was actually more efficient. However, once the search window grew beyond ten megahertz, the Grover-based approach began to outperform the standard method. The advantage grew rapidly as the bandwidth increased. In the widest tests, the new protocol required more than ten times less signal energy to make an accurate decision compared to the conventional approach. This means that for broad searches, the quantum-enhanced sensor could find the needle in the haystack with far fewer attempts, saving time and resources. The researchers observed that the benefit was not just a small improvement; it scaled superlinearly, meaning the larger the search area, the more dramatic the advantage became.

A crucial part of this success was how the researchers handled the physical limitations of their hardware. The quantum system they used naturally responds to discrete, specific frequencies, like the notes on a piano. To detect a continuous range of frequencies, they used short pulses of signals that were broad enough to cover the gaps between these notes. This created a smooth, continuous window for detection rather than a series of isolated points. They also discovered that they could achieve the same wide detection range with a much weaker initial signal by using the Grover algorithm. Normally, to sense a wider range, one would need to increase the energy of the probe signal, which can eventually damage the delicate quantum system or cause it to behave unpredictably. By using the algorithm, they could keep the signal energy low while still covering a broad spectrum, effectively extending the useful range of the sensor without pushing the hardware to its breaking point.

The experiment was a proof of principle, demonstrating that these advantages can be realized with modest hardware that does not yet require the extreme error-correction capabilities of future, large-scale quantum computers. The researchers acknowledged several limitations, noting that their system currently relies on signals arriving at known times and that the signals used were generated at room temperature before being cooled down, which affects the absolute sensitivity of the measurement. They also noted that they were limited to just two rounds of the algorithm because their qubit could only hold its quantum state for a short time. Despite these constraints, the results provide strong evidence that quantum computing can enhance sensing tasks in the near term. By showing that a complex algorithm can be repurposed to make a simple sensor smarter, the work opens a path toward practical applications where detecting a signal quickly and efficiently is more important than having a perfect, fault-tolerant machine.

Technical Summary: Experimental Quantum-Computing-Enhanced Sensing Using Grover's Algorithm

Problem Statement
The paper addresses the challenge of detecting a signal with an unknown center frequency within a large detection bandwidth. While quantum sensing is well-established for precise signal reconstruction, the authors focus on "quantum computational sensing," where the goal is to make a binary decision (yes/no) regarding the presence of a signal in a specific frequency band rather than reconstructing the signal itself. The core problem is to determine if quantum computing algorithms, specifically Grover's search algorithm, can provide a metrological advantage over conventional sensing strategies without requiring large-scale, fault-tolerant hardware. Previous theoretical work suggested that repurposing Grover's algorithm for sensing could offer advantages by reframing signal detection as a search problem, but experimental validation in near-term hardware was lacking.

Methodology
The authors experimentally demonstrated a Grover-based sensing protocol using a system comprising a single superconducting transmon qubit dispersively coupled to a single superconducting cavity.

Encoding and Oracle: The system encodes different signal frequencies into distinct cavity Fock states. Due to the dispersive regime, photon-number splitting creates a set of frequency-selective qubit transitions. An incoming signal resonant with a specific Fock state $|i\rangle$ drives the qubit to perform a $2\pi$ rotation ( $R_i(2\pi)$ ), imparting a $\pi$ phase shift to that state. This interaction serves as the "oracle" in Grover's algorithm, marking the target Fock state.
Amplitude Amplification: Instead of starting with a uniform superposition of Fock states, the authors prepared a coherent probe state $|\alpha\rangle$ $∣ α ⟩$ (a Poissonian distribution of Fock states). The protocol alternates between two reflections:
1. Reflection about the marked state (signal-induced rotation).
2. Reflection about the initial probe state (implemented via cavity displacements $D(\alpha)$ and a vacuum-selective SNAP gate).
  This sequence amplifies the population of the Fock state corresponding to the signal frequency.
Readout: After $N$ Grover iterations, a final signal-dependent $\pi$ pulse maps the amplified Fock-state population onto the qubit's excitation probability. A high excitation probability indicates the signal is "in-band," while a low probability indicates it is "out-of-band."
Continuous Bandwidth: To achieve a continuous sensing window rather than discrete frequency bins, the authors used signal pulses with spectral widths comparable to the frequency spacing of the number-split transitions. This allows signals between transitions to drive imperfect rotations, which the Grover amplification process remains robust against.

Key Contributions and Results

Experimental Demonstration: The team successfully implemented the Grover-based protocol on a near-term superconducting platform, validating the theoretical proposal from Ref. [8] in a physical system.
Break-even Point and Scaling: The experiments revealed a "break-even" point at a detection bandwidth of approximately 10 MHz.
- For bandwidths $< 10$ MHz, the conventional coherent-probe baseline ( $N=0$ ) outperformed the Grover-based protocols.
- For bandwidths $> 10$ MHz, the Grover-based protocols ( $N=1$ and $N=2$ ) outperformed the baseline. The advantage grew superlinearly with the bandwidth.
Resource Efficiency: The authors quantified the enhancement by measuring the total number of signal interrogations required to reach a fixed classification accuracy (75% and 90%).
- For larger bandwidths and higher accuracy targets, the Grover-based protocol reduced the required signal by more than 10 $\times$ .
- At 90% accuracy, the protocol required up to 18 $\times$ less signal than the baseline.
Extended Bandwidth: The protocol allowed for the detection of signals over a wider bandwidth than the baseline could achieve with the same coherent-state amplitude. The maximum projected bandwidth increased from ~30 MHz (baseline) to ~35 MHz ( $N=1$ ) and ~68 MHz ( $N=2$ ), effectively delaying the breakdown of the dispersive approximation at high photon numbers.

Significance and Claims
The paper claims to provide a proof-of-principle validation that Grover-based quantum computational sensing can be realized in near-term hardware (NISQ devices) and offers a metrological advantage well beyond the break-even point.

Near-Term Applicability: Unlike purely computational tasks where Grover's algorithm requires fault-tolerant hardware to be practical, this work demonstrates that sensing tasks can yield advantages with very small quantum processors (a single qubit and cavity).
Modest Hardware Requirements: The protocol highlights that significant sensing enhancements can be achieved without the massive scale required for general-purpose quantum computing.
Limitations and Modesty: The authors explicitly acknowledge several limitations:
- The protocol assumes signals arrive at known, synchronized times.
- It assumes signal repetition, which may not apply to transient signals.
- The baseline used for comparison is a "natural" conventional approach but not proven to be the optimal non-Grover strategy.
- The use of coherent states (rather than uniform superpositions) limits the potential enhancement.
- The demonstrated bandwidths (tens of MHz) are modest compared to potential future applications.
- The signal was generated at room temperature and attenuated, limiting absolute sensitivity claims for cryogenic-origin signals (e.g., dark matter searches).

The work concludes that repurposing quantum computing algorithms for sensing tasks is a viable path to achieving practical advantages with current hardware, motivating further research to extend these benefits to real-world sensing scenarios.

Technical Summary: Experimental Quantum-Computing-Enhanced Sensing Using Grover's Algorithm

More like this