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.15057

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

Boyang Chen, Andrea Coladangelo, Jerry Li, Haocheng Zhang

Published Nov 11, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.15057

Related papers

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 Enhanced Sensing

Richard R. Allen, Francisco Machado, Isaac L. Chuang +2 more

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.

arXiv:2501.07625•Jan 13, 2025•54 citations

Simple broadband signal detection at the fundamental limit

Anthony M. Polloreno, Graeme Smith

Broadband detection of a weak oscillatory field with unknown carrier frequency underlies magnetometry, axion searches and gravitational-wave sensing. We show that the Grover-like integration-time lower bound for this task is a geometric corollary of an upper bound on the integrated quantum Fisher information and present an all-analog protocol with near-optimal scaling.

quant-pharXiv:2601.19816•Jan 28, 2026•3 citations

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

Heisenberg-limited Hamiltonian learning without short-time control

Myeongjin Shin, Junseo Lee, Changhun Oh

Characterizing quantum systems by learning their underlying Hamiltonians is a central task in quantum information science. While recent algorithmic advances have achieved near-optimal efficiency in this task, they critically rely on accessing arbitrarily short-time dynamics. This reliance poses severe experimental challenges due to finite control bandwidth and transient pulse errors. In this work, we demonstrate that Heisenberg-limited Hamiltonian learning can be achieved without short-time control. We introduce a framework in which every query to the unknown dynamics has duration at least a prescribed minimum time $T$, and show that this restriction does not preclude Heisenberg-limited scaling. The key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms using only such lower-bounded evolution times. This reduces the learning task to sparse pure-state tomography. Notably, for logarithmically sparse Hamiltonians, our algorithm achieves the information-theoretically optimal $1/\varepsilon$ scaling in total evolution time for any arbitrary constant minimum evolution time $T$. For many-body (polynomially sparse) systems, we uncover a rigorous quantitative tradeoff, showing that the minimum required evolution time can be significantly relaxed from the standard limit at a polynomial cost in total evolution time. Our results affirmatively resolve a prominent open problem in the field and reveal that high-bandwidth, ultra-short pulses are not fundamentally necessary for optimal quantum learning.

quant-pharXiv:2604.27838•PRX Quantum•May 1, 2026•12 citations

Opportunities and Limitations in Broadband Sensing

Anthony Polloreno, Jacob L. Beckey, Joshua Levin +5 more

Detecting a signal at an unknown frequency is a common task, arising in settings from dark-matter detection to magnetometry. For any detection protocol, the precision achieved depends on the frequency of the signal and can be quantified by the quantum Fisher information (QFI). To study limitations in broadband sensing, we introduce the integrated quantum Fisher information and derive inequality bounds that embody fundamental trade-offs in any sensing protocol. Our inequalities show that sensitivity in one frequency range must come at the cost of reduced sensitivity elsewhere. For many protocols, including those with small phase accumulation and those consisting of $\ensuremath{\pi}$ pulses, we find that the integrated quantum Fisher information scales linearly with $T$. We also find protocols with substantial phase accumulation that can have integrated QFI that grows quadratically with $T$ and prove that this scaling is asymptotically optimal. These protocols may allow the very rapid detection of a signal with unknown frequency over a very wide bandwidth. We discuss the implications of these results for a wide variety of contexts, including dark-matter searches and dynamical decoupling. Thus we establish fundamental limitations on the broadband detection of signals and highlight their consequences.

arXiv:2203.05520•Physical Review Applied•Jan 10, 2023•4 citations
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.
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.
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.
Characterizing quantum systems by learning their underlying Hamiltonians is a central task in quantum information science. While recent algorithmic advances have achieved near-optimal efficiency in this task, they critically rely on accessing arbitrarily short-time dynamics. This reliance poses severe experimental challenges due to finite control bandwidth and transient pulse errors. In this work, we demonstrate that Heisenberg-limited Hamiltonian learning can be achieved without short-time control. We introduce a framework in which every query to the unknown dynamics has duration at least a prescribed minimum time TTT, and show that this restriction does not preclude Heisenberg-limited scaling. The key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms using only such lower-bounded evolution times. This reduces the learning task to sparse pure-state tomography. Notably, for logarithmically sparse Hamiltonians, our algorithm achieves the information-theoretically optimal 1/ε1/\varepsilon1/ε scaling in total evolution time for any arbitrary constant minimum evolution time TTT. For many-body (polynomially sparse) systems, we uncover a rigorous quantitative tradeoff, showing that the minimum required evolution time can be significantly relaxed from the standard limit at a polynomial cost in total evolution time. Our results affirmatively resolve a prominent open problem in the field and reveal that high-bandwidth, ultra-short pulses are not fundamentally necessary for optimal quantum learning.
Detecting a signal at an unknown frequency is a common task, arising in settings from dark-matter detection to magnetometry. For any detection protocol, the precision achieved depends on the frequency of the signal and can be quantified by the quantum Fisher information (QFI). To study limitations in broadband sensing, we introduce the integrated quantum Fisher information and derive inequality bounds that embody fundamental trade-offs in any sensing protocol. Our inequalities show that sensitivity in one frequency range must come at the cost of reduced sensitivity elsewhere. For many protocols, including those with small phase accumulation and those consisting of $\ensuremath{\pi}$ pulses, we find that the integrated quantum Fisher information scales linearly with TTT. We also find protocols with substantial phase accumulation that can have integrated QFI that grows quadratically with TTT and prove that this scaling is asymptotically optimal. These protocols may allow the very rapid detection of a signal with unknown frequency over a very wide bandwidth. We discuss the implications of these results for a wide variety of contexts, including dark-matter searches and dynamical decoupling. Thus we establish fundamental limitations on the broadband detection of signals and highlight their consequences.