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

Quantum Computing Enhanced Sensing

Richard R. Allen, Francisco Machado, Isaac L. Chuang, Hsin-Yuan Huang, Soonwon Choi

Published Jan 13, 2025• 54 citations
arXivHTMLPDF

Abstract

Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak oscillating fields with unknown strength and frequency. We present a quantum computing enhanced sensing protocol that outperforms all existing approaches. Furthermore, we prove our approach is optimal by establishing the Grover-Heisenberg limit -- a fundamental lower bound on the minimum sensing time. The key idea is to robustly digitize the continuous, analog signal into a discrete operation, which is then integrated into a quantum algorithm. Our metrological gain originates from quantum computation, distinguishing our protocol from conventional sensing approaches. Indeed, we prove that broad classes of protocols based on quantum Fisher information, finite-lifetime quantum memory, or classical signal processing are strictly less powerful. Our protocol is compatible with multiple experimental platforms. We propose and analyze a proof-of-principle experiment using nitrogen-vacancy centers, where meaningful improvements are achievable using current technology. This work establishes quantum computation as a powerful new resource for advancing sensing capabilities.

DOI
10.48550/arxiv.2501.07625

Related papers

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

Mathieu Ouellet, Purnendu Sen, Xiangqin Wang +6 more

The combination of quantum sensing with quantum computing to provide an enhancement over conventional quantum sensing has recently emerged as a promising potential application of quantum computing that could give advantages without needing large-scale or fault-tolerant hardware. In this work, we report an experimental demonstration of a recent theoretical proposal to repurpose Grover's search algorithm to improve the ability to detect signals with unknown frequency within a large detection bandwidth. Our experiments were based on a system comprising a single superconducting qubit coupled to a single superconducting cavity, highlighting the modest hardware requirements for realizing the protocol. We found that Grover-based sensing was able to outperform the natural non-Grover baseline for our experimental platform for detection bandwidths $>$10~MHz, with an advantage that empirically grew superlinearly with the bandwidth beyond that break-even point. The use of the Grover-based protocol reduced the amount of signal that needed to be sensed to make an accurate detection decision by more than 10$\times$ for choices of larger detection bandwidth and higher desired detection accuracy. Our results provide a proof-of-principle validation that Grover-based quantum computational sensing can be realized in near-term hardware and provide a metrological advantage well beyond break-even in spite of the additional protocol complexity.

quant-pharXiv:2609.35016•Sep 29, 2026•0 citations

Experimental realization of quantum-computing-enhanced sensing

Yifang Xu, Hongwei Huang, Yilong Zhou +14 more

Quantum algorithms offer computational advantages, yet incorporating them into quantum sensing and converting these advantages into enhanced information acquisition remains challenging. Here, we realize quantum-computing-enhanced sensing in a spin-oscillator architecture, where a microwave cavity provides a high-dimensional quantum register and a coupled superconducting qubit serves as the sensor. The unknown signal directly generates the phase oracle operation, establishing a natural physical interface between quantum computation and sensing. We experimentally demonstrate the first Grover search in a bosonic mode and observe quantum amplitude amplification in a Hilbert space spanning more than 128 photons. For the same number of sensing iterations, our protocol extracts more information and resolves more frequency candidates than classical sequential search. Our results establish signal-driven oracles as a route for harnessing oracle-based quantum algorithms and realizing quantum-computing-enhanced sensing.

quant-pharXiv:2609.07613•Sep 8, 2026•1 citation

Sensing frequencies at the discrete Grover-Heisenberg limit using a single qubit

Boyang Chen, Andrea Coladangelo, Jerry Li +1 more

We consider a fundamental quantum sensing task: detecting weak oscillating fields with unknown strength and frequency. Recent work by Allen et al. established a fundamental lower bound on the required sensing time, which they named the "Grover-Heisenberg limit", and gave a protocol attaining this limit. The protocol relies on auxiliary qubits, which are used to run Grover's algorithm as a subroutine, leaving open the question of whether a single sensing qubit can achieve the same scaling. We show that a single qubit suffices for a discrete version of this problem, in which the signal strength is known and the frequency belongs to an arbitrary, but known, finite set of candidate frequencies. Our protocol's sensing time grows only as the square root of the number of candidate frequencies. We prove that this square-root dependence, which we refer to as the "discrete Grover-Heisenberg limit", is optimal in the worst case.

arXiv:2611.15057•Nov 11, 2026•0 citations

Quantum sensors that compute: quantum computational magnetic-field sensing using a superconducting qubit

Purnendu Sen, Mathieu Ouellet, Saeed A. Khan +6 more

A measurement of a single-qubit quantum sensor reveals at most 1 bit of information about the signal that was sensed. To perform a classification task on the signal, the conventional approach is to repeat a sensing protocol many times, averaging the measurement results to obtain a high-precision estimate of the sensed signal, and then to apply classical postprocessing. Quantum computational sensing (QCS) is an alternative approach that breaks with the paradigm of first obtaining a classical estimate of the signal and then computing a function of the estimated signal in postprocessing. QCS instead combines quantum sensing with quantum computing to concentrate information about the signal relevant to the task into the solitary bit revealed by each measurement. Here, we report on the experimental demonstration of QCS where sensing and computing were both performed by the same single superconducting transmon qubit. We consider various binary classification tasks based on static and oscillating magnetic fields induced by current through a flux line. The fields were sensed through a double-junction superconducting quantum interference device (SQUID) loop that was part of the qubit. We used a protocol based on quantum signal processing to preprocess the sensed signals in the quantum domain prior to measurement. For tasks on static magnetic fields, our protocol outperformed the conventional baseline of Ramsey-based phase estimation by as much as 15 percentage points. For tasks on oscillating magnetic fields, we classified signal amplitude and frequency with up to 20 and 15 percentage points higher accuracy, respectively, compared to the conventional baseline of optimized dynamical-decoupling protocols. Our results illustrate how quantum computing can enhance quantum sensing even with a minimally sized quantum system subject to the practical limitations of decoherence and error-prone operations.

quant-pharXiv:2608.17400•Aug 19, 2026•7 citations

Noise-Resilient Quantum Metrology with Quantum Computing

Xiangyu Wang, Chenrong Liu, Xue Lin +8 more

Quantum computing has made remarkable strides in recent years, as demonstrated by quantum supremacy experiments and the realization of high-fidelity, fault-tolerant gates. However, a major obstacle persists: practical real-world applications remain scarce, largely due to the inefficiency of loading classical data into quantum processors. Here, we propose an alternative strategy that shifts the focus from classical data encoding to directly processing quantum data. We target quantum metrology, a practical quantum technology whose precision is often constrained by realistic noise. We develop an experimentally feasible scheme in which a quantum computer optimizes information acquired from quantum metrology, thereby enhancing performance in noisy quantum metrology tasks and overcoming the classical-data-loading bottleneck. We demonstrate this approach through experimental implementation with nitrogen-vacancy centers in diamond and numerical simulations using models of distributed superconducting quantum processors. Our results show that this method improves the accuracy of sensing estimates and significantly boosts sensitivity, as quantified by the quantum Fisher information, thus offering a new pathway to harness near-term quantum computers for realistic quantum metrology.

arXiv:2509.00771•Aug 31, 2025•2 citations

Learning Hamiltonians in the Heisenberg limit with static single-qubit fields

Shrigyan Brahmachari, Shuchen Zhu, Iman Marvian +1 more

Learning the Hamiltonian governing a quantum system is a central task in quantum metrology, sensing, and device characterization. Existing Heisenberg-limited Hamiltonian learning protocols either require multi-qubit operations that are prone to noise, or single-qubit operations whose frequency or strength increases with the desired precision. These two requirements limit the applicability of Hamiltonian learning on near-term quantum platforms. We present a protocol that learns a quantum Hamiltonian with the optimal Heisenberg-limited scaling using only single-qubit control in the form of static fields with strengths that are independent of the target precision. Our protocol is robust against the state preparation and measurement (SPAM) error. By overcoming these limitations, our protocol provides new tools for device characterization and quantum sensing. We demonstrate that our method achieves the Heisenberg-limited scaling through rigorous mathematical proof and numerical experiments. We also prove an information-theoretic lower bound showing that a non-vanishing static field strength is necessary for achieving the Heisenberg limit unless one employs an extensive number of discrete control operations.

quant-pharXiv:2601.10380•Jan 16, 2026•11 citations
Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak oscillating fields with unknown strength and frequency. We present a quantum computing enhanced sensing protocol that outperforms all existing approaches. Furthermore, we prove our approach is optimal by establishing the Grover-Heisenberg limit -- a fundamental lower bound on the minimum sensing time. The key idea is to robustly digitize the continuous, analog signal into a discrete operation, which is then integrated into a quantum algorithm. Our metrological gain originates from quantum computation, distinguishing our protocol from conventional sensing approaches. Indeed, we prove that broad classes of protocols based on quantum Fisher information, finite-lifetime quantum memory, or classical signal processing are strictly less powerful. Our protocol is compatible with multiple experimental platforms. We propose and analyze a proof-of-principle experiment using nitrogen-vacancy centers, where meaningful improvements are achievable using current technology. This work establishes quantum computation as a powerful new resource for advancing sensing capabilities.
The combination of quantum sensing with quantum computing to provide an enhancement over conventional quantum sensing has recently emerged as a promising potential application of quantum computing that could give advantages without needing large-scale or fault-tolerant hardware. In this work, we report an experimental demonstration of a recent theoretical proposal to repurpose Grover's search algorithm to improve the ability to detect signals with unknown frequency within a large detection bandwidth. Our experiments were based on a system comprising a single superconducting qubit coupled to a single superconducting cavity, highlighting the modest hardware requirements for realizing the protocol. We found that Grover-based sensing was able to outperform the natural non-Grover baseline for our experimental platform for detection bandwidths $>10 MHz,withanadvantagethatempiricallygrewsuperlinearlywiththebandwidthbeyondthatbreak−evenpoint.TheuseoftheGrover−basedprotocolreducedtheamountofsignalthatneededtobesensedtomakeanaccuratedetectiondecisionbymorethan1010~MHz, with an advantage that empirically grew superlinearly with the bandwidth beyond that break-even point. The use of the Grover-based protocol reduced the amount of signal that needed to be sensed to make an accurate detection decision by more than 1010 MHz,withanadvantagethatempiricallygrewsuperlinearlywiththebandwidthbeyondthatbreak−evenpoint.TheuseoftheGrover−basedprotocolreducedtheamountofsignalthatneededtobesensedtomakeanaccuratedetectiondecisionbymorethan10\times$ for choices of larger detection bandwidth and higher desired detection accuracy. Our results provide a proof-of-principle validation that Grover-based quantum computational sensing can be realized in near-term hardware and provide a metrological advantage well beyond break-even in spite of the additional protocol complexity.
Quantum algorithms offer computational advantages, yet incorporating them into quantum sensing and converting these advantages into enhanced information acquisition remains challenging. Here, we realize quantum-computing-enhanced sensing in a spin-oscillator architecture, where a microwave cavity provides a high-dimensional quantum register and a coupled superconducting qubit serves as the sensor. The unknown signal directly generates the phase oracle operation, establishing a natural physical interface between quantum computation and sensing. We experimentally demonstrate the first Grover search in a bosonic mode and observe quantum amplitude amplification in a Hilbert space spanning more than 128 photons. For the same number of sensing iterations, our protocol extracts more information and resolves more frequency candidates than classical sequential search. Our results establish signal-driven oracles as a route for harnessing oracle-based quantum algorithms and realizing quantum-computing-enhanced sensing.
We consider a fundamental quantum sensing task: detecting weak oscillating fields with unknown strength and frequency. Recent work by Allen et al. established a fundamental lower bound on the required sensing time, which they named the "Grover-Heisenberg limit", and gave a protocol attaining this limit. The protocol relies on auxiliary qubits, which are used to run Grover's algorithm as a subroutine, leaving open the question of whether a single sensing qubit can achieve the same scaling. We show that a single qubit suffices for a discrete version of this problem, in which the signal strength is known and the frequency belongs to an arbitrary, but known, finite set of candidate frequencies. Our protocol's sensing time grows only as the square root of the number of candidate frequencies. We prove that this square-root dependence, which we refer to as the "discrete Grover-Heisenberg limit", is optimal in the worst case.
A measurement of a single-qubit quantum sensor reveals at most 1 bit of information about the signal that was sensed. To perform a classification task on the signal, the conventional approach is to repeat a sensing protocol many times, averaging the measurement results to obtain a high-precision estimate of the sensed signal, and then to apply classical postprocessing. Quantum computational sensing (QCS) is an alternative approach that breaks with the paradigm of first obtaining a classical estimate of the signal and then computing a function of the estimated signal in postprocessing. QCS instead combines quantum sensing with quantum computing to concentrate information about the signal relevant to the task into the solitary bit revealed by each measurement. Here, we report on the experimental demonstration of QCS where sensing and computing were both performed by the same single superconducting transmon qubit. We consider various binary classification tasks based on static and oscillating magnetic fields induced by current through a flux line. The fields were sensed through a double-junction superconducting quantum interference device (SQUID) loop that was part of the qubit. We used a protocol based on quantum signal processing to preprocess the sensed signals in the quantum domain prior to measurement. For tasks on static magnetic fields, our protocol outperformed the conventional baseline of Ramsey-based phase estimation by as much as 15 percentage points. For tasks on oscillating magnetic fields, we classified signal amplitude and frequency with up to 20 and 15 percentage points higher accuracy, respectively, compared to the conventional baseline of optimized dynamical-decoupling protocols. Our results illustrate how quantum computing can enhance quantum sensing even with a minimally sized quantum system subject to the practical limitations of decoherence and error-prone operations.
Quantum computing has made remarkable strides in recent years, as demonstrated by quantum supremacy experiments and the realization of high-fidelity, fault-tolerant gates. However, a major obstacle persists: practical real-world applications remain scarce, largely due to the inefficiency of loading classical data into quantum processors. Here, we propose an alternative strategy that shifts the focus from classical data encoding to directly processing quantum data. We target quantum metrology, a practical quantum technology whose precision is often constrained by realistic noise. We develop an experimentally feasible scheme in which a quantum computer optimizes information acquired from quantum metrology, thereby enhancing performance in noisy quantum metrology tasks and overcoming the classical-data-loading bottleneck. We demonstrate this approach through experimental implementation with nitrogen-vacancy centers in diamond and numerical simulations using models of distributed superconducting quantum processors. Our results show that this method improves the accuracy of sensing estimates and significantly boosts sensitivity, as quantified by the quantum Fisher information, thus offering a new pathway to harness near-term quantum computers for realistic quantum metrology.
Learning the Hamiltonian governing a quantum system is a central task in quantum metrology, sensing, and device characterization. Existing Heisenberg-limited Hamiltonian learning protocols either require multi-qubit operations that are prone to noise, or single-qubit operations whose frequency or strength increases with the desired precision. These two requirements limit the applicability of Hamiltonian learning on near-term quantum platforms. We present a protocol that learns a quantum Hamiltonian with the optimal Heisenberg-limited scaling using only single-qubit control in the form of static fields with strengths that are independent of the target precision. Our protocol is robust against the state preparation and measurement (SPAM) error. By overcoming these limitations, our protocol provides new tools for device characterization and quantum sensing. We demonstrate that our method achieves the Heisenberg-limited scaling through rigorous mathematical proof and numerical experiments. We also prove an information-theoretic lower bound showing that a non-vanishing static field strength is necessary for achieving the Heisenberg limit unless one employs an extensive number of discrete control operations.