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

Moving quantum sensors

Evan Zhang, Erfan Abbasgholinejad, Yu-Xin Wang, Ali Fahimniya, Daniel J. Spencer, Sean R. Muleady, Mohammad Hafezi, Andrew M. Childs, Alexey V. Gorshkov

quant-phSubmitted Oct 12, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength $B$ occupying an unknown contiguous region making up a fraction $1/N$ of the total search space, with a qubit sensor controlled for a total time $T$ to maximize the probability of detecting the field. We study the regime in which the characteristic timescale of the field is slow compared to the time to move the sensor between any two regions, and we distinguish classical motion, where the sensor follows a definite trajectory, from quantum motion, where the sensor can be in a coherent superposition of locations. For a single classically moving sensor, we derive an optimal multi-stop protocol and obtain the exact maximum detection probability. Allowing coherent spatial superposition maps the single-sensor problem onto Hamiltonian search and reduces the interrogation time for successfully detecting the field from $Θ(N/B)$ to $Θ(\sqrt{N}/B)$. We then extend the problem to $M$ sensors and identify a hierarchy of optimal time scalings for constant success probability determined by the available spatial and inter-sensor quantum resources. Unentangled coherently moving sensors achieve $T=Θ(\sqrt{N/M}/B)$ by searching disjoint regions in parallel, while entanglement among the sensors can further enhance the effective field coupling and achieve $T=Θ(\sqrt{N}/(MB))$. Matching lower bounds establish the optimality of these scalings in the presence of arbitrary controls and ancilla systems. Our results separate the roles of classical motion, spatial coherence, and entanglement in spatial field detection.

AI Summary

Can controlled sensor motion accelerate detection of a localized field at an unknown position? The paper studies a known-strength field $B$ occupying a fraction $1/N$ of a search space, with uniformly distributed location. Detection is one-sided: a positive outcome certifies field presence, with no false positives. Controls, ancillary operations, and transport are assumed arbitrarily fast. For one classically moving qubit, without ancillas or adaptive measurements, an optimal protocol visits $k$ field-width-separated sites for equal dwell times. For $0\le T\le\pi N/(2B)$, its exact optimum is $P_{\mathrm{cl}}^\star(T)=\max_{1\le k\le N}(k/N)\sin^2(BT/k)$; perfect detection first becomes possible at $T=\pi N/(2B)$. The proof optimizes discrete occupation times and extends the result to a continuous ring. Coherent spatial motion implements a Hamiltonian-search oracle, giving constant-success detection in $\Theta(\sqrt{N}/B)$ rather than $\Theta(N/B)$. For $M\le N$ sensors, optimal constant-success times are $\Theta(N/(MB))$ without spatial coherence, irrespective of inter-sensor entanglement; $\Theta(\sqrt{N/M}/B)$ with coherent motion but no inter-sensor entanglement; and $\Theta(\sqrt{N}/(MB))$ with both resources. Protocols combine parallel search or collectively enhanced coupling with amplitude amplification. Matching hybrid-method lower bounds constrain averaged generator variances and allow arbitrary controls and ancillas, provided resource restrictions apply to joint sensor–ancilla states. The model excludes transport costs, spatial locality constraints, decoherence, and control errors. Noise robustness, bounded motion, unknown field strength, and multiple field regions are left for future study.

Little sign of AI-generated textIncrementalStrong assumptions

Error found: The unqualified exact classical optimum in the abstract is proved only under Section III’s explicit restriction to a single-shot protocol without ancillas or adaptivity. The lower-bound appendix incorrectly replaces the real part of a unitary expectation value by its modulus in a norm identity, although the correct small-time expansion preserves the asymptotic bound.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

A Framework for Spatial Quantum Sensing

Luís Bugalho, Yasser Omar, Damian Markham

Quantum sensor networks promise precision advantages over classical and single-sensor strategies, in particular when the estimator is non-local. We address the problem of finding such estimators through a framework we connote spatial quantum sensing: given an underlying field interrogated by a network of quantum sensors at fixed positions, construct an estimator for a property of the field, for example, distinguishing a source of signal, or evaluating the field or its derivatives at an arbitrary point. We first treat polynomial fields, casting the task as an interpolation problem, and then generalize to fields modeled by analytic functions, which yields general least-squares estimators. A central and largely unaddressed question is under what conditions on sensor placement these estimators are well-defined and error-free. For $m$-dimensional arrays we give explicit constructions and proofs in the interpolation setting using algebraic geometry, and establish necessary and sufficient conditions in the general case. Comparing a non-local entangled protocol with the best local strategy, we show that entanglement yields maximal precision in distributed sensing under global resource constraints. Finally, we introduce error-free subspaces, a technique that translates prior knowledge of the field into a reduction in the number of required sensors. We expect these techniques to be broadly useful in sensing problems across scales, ranging from earth-scale experiments to local applications such as biological imaging.

quant-pharXiv:2602.12193•Feb 13, 2026•1 citation

Quantum metrology with partially accessible chaotic sensors

Harshita Sharma, Sayan Choudhury, Jayendra N. Bandyopadhyay

Most quantum metrology protocols harness highly entangled probe states and globally accessible measurements to surpass the standard quantum limit. However, it is challenging to satisfy these requirements in realistic many-body sensors. We demonstrate that both of these constraints can be overcome in quantum chaotic sensors. Crucially, we establish that even in the presence of partial measurement accessibility, chaotic dynamics enables initial unentangled states to exhibit Heisenberg scaling of the quantum Fisher information, $I_α$ with time. In the weakly chaotic regime, we identify spin-coherent states placed at the edge of the regular islands in the mixed classical phase space as optimal initial states for enhanced sensitivity. On the other hand, in the strongly chaotic regime, $I_α$ is insensitive to the choice of the initial state. Notably, quantum-enhanced sensitivity is achieved even when a very low fraction ($\sim 5\%$) of the qubits are accessible. These results establish quantum chaos as a robust resource for quantum-enhanced sensing under realistic accessibility constraints on accessibility.

quant-pharXiv:2602.12914•Feb 16, 2026•2 citations

On the power of moving quantum sensors: fully flexible and noise-resilient sensing

Paul Aigner, Wolfgang Dür

We show that a single moving quantum sensor provides complete access to spatially correlated scalar fields. We demonstrate that with either trajectory or internal state control, one can selectively measure any linear functional, e.g. a gradient or a spatial Fourier series coefficient, while successfully eliminating {\it all} noise signals with orthogonal spatial correlation. This even exceeds the capabilities of a sensor network consisting of multiple entangled, yet spatially fixed, quantum sensors, where the number of suppressed noise signals is limited by the number of sensor positions. We show that one can achieve an improved scaling of the quantum Fisher information for moving sensors beyond the static fundamental limit of $T^2$.

quant-pharXiv:2512.15876•Dec 19, 2025•1 citation

Learning Arbitrary Lindbladians from Time Evolution

Zhili Chen, Zhan Yu

We study the problem of learning arbitrary $n$-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an $n$-qubit Lindbladian of dynamical strength at most $Λ$, the algorithm estimates every coefficient to error $\varepsilon$ using $\widetilde O(Λ^2/\varepsilon^2)$ experiments and $\widetilde O(Λ/\varepsilon^2)$ total evolution time, with classical running time polynomial in $n$ and $Λ/\varepsilon$. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant $k$, our algorithm learns generic $k$-local Lindbladians of local dynamical strength at most $Λ_{\mathrm{loc}}$ using $\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)$ experiments and $\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)$ total evolution time, improving the upper bounds of prior works in terms of the dependence on $n$. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of $3$-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed $k \geq 3$.

quant-pharXiv:2607.28610•Jul 31, 2026•5 citations

Limited-control metrology approaching the Heisenberg limit without entanglement preparation

Benedikt Tratzmiller, Qiong Chen, Ilai Schwartz +2 more

Current metrological bounds typically assume full control over all particles that are involved in the protocol. Relaxing this assumption, we study metrological performance when only limited control is available. As an example, we measure a static magnetic field when a fully controlled quantum sensor is supplemented by particles over which only global control is possible. We show that even for a noisy quantum sensor, a protocol that maps the magnetic field to a precession frequency can achieve transient super-Heisenberg scaling in measurement time and Heisenberg scaling in the particle number. This leads to an estimation uncertainty that approaches that achievable under full control to within a factor independent of the particle number for a given total time. Applications to hybrid sensing devices and the crucial role of the quantum character of the sensor are discussed.

arXiv:1905.12582•Physical Review A•Mar 30, 2020•9 citations

Optimal control of a quantum sensor: A fast algorithm based on an analytic solution

Antonello Scardicchio, Santiago Hernández-Gómez, Giovanni Fasiolo +3 more

Quantum sensors can show unprecedented sensitivities, provided they are controlled in a very specific, optimal way. Here, we consider a spin sensor of time-varying fields in the presence of dephasing noise, and we show that the problem of finding the pulsed control field that optimizes the sensitivity (i.e., the smallest detectable signal) can be mapped to the determination of the ground state of a spin chain. We find an approximate but analytic solution of this problem, which provides a lower bound for the sensitivity and a pulsed control very close to optimal, which we further use as initial guess for realizing a fast simulated annealing algorithm. We experimentally demonstrate the sensitivity improvement for a spin-qubit magnetometer based on a nitrogen-vacancy center in diamond.

arXiv:2112.14998•SciPost Physics•Jul 4, 2024•13 citations
We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength BBB occupying an unknown contiguous region making up a fraction 1/N1/N1/N of the total search space, with a qubit sensor controlled for a total time TTT to maximize the probability of detecting the field. We study the regime in which the characteristic timescale of the field is slow compared to the time to move the sensor between any two regions, and we distinguish classical motion, where the sensor follows a definite trajectory, from quantum motion, where the sensor can be in a coherent superposition of locations. For a single classically moving sensor, we derive an optimal multi-stop protocol and obtain the exact maximum detection probability. Allowing coherent spatial superposition maps the single-sensor problem onto Hamiltonian search and reduces the interrogation time for successfully detecting the field from Θ(N/B)Θ(N/B)Θ(N/B) to Θ(N/B)Θ(\sqrt{N}/B)Θ(N​/B). We then extend the problem to MMM sensors and identify a hierarchy of optimal time scalings for constant success probability determined by the available spatial and inter-sensor quantum resources. Unentangled coherently moving sensors achieve T=Θ(N/M/B)T=Θ(\sqrt{N/M}/B)T=Θ(N/M​/B) by searching disjoint regions in parallel, while entanglement among the sensors can further enhance the effective field coupling and achieve T=Θ(N/(MB))T=Θ(\sqrt{N}/(MB))T=Θ(N​/(MB)). Matching lower bounds establish the optimality of these scalings in the presence of arbitrary controls and ancilla systems. Our results separate the roles of classical motion, spatial coherence, and entanglement in spatial field detection.
Can controlled sensor motion accelerate detection of a localized field at an unknown position? The paper studies a known-strength field BBB occupying a fraction 1/N1/N1/N of a search space, with uniformly distributed location. Detection is one-sided: a positive outcome certifies field presence, with no false positives. Controls, ancillary operations, and transport are assumed arbitrarily fast.
For one classically moving qubit, without ancillas or adaptive measurements, an optimal protocol visits kkk field-width-separated sites for equal dwell times. For 0≤T≤πN/(2B)0\le T\le\pi N/(2B)0≤T≤πN/(2B), its exact optimum is Pcl⋆(T)=max⁡1≤k≤N(k/N)sin⁡2(BT/k)P_{\mathrm{cl}}^\star(T)=\max_{1\le k\le N}(k/N)\sin^2(BT/k)Pcl⋆​(T)=max1≤k≤N​(k/N)sin2(BT/k); perfect detection first becomes possible at T=πN/(2B)T=\pi N/(2B)T=πN/(2B). The proof optimizes discrete occupation times and extends the result to a continuous ring. Coherent spatial motion implements a Hamiltonian-search oracle, giving constant-success detection in Θ(N/B)\Theta(\sqrt{N}/B)Θ(N​/B) rather than Θ(N/B)\Theta(N/B)Θ(N/B).
For M≤NM\le NM≤N sensors, optimal constant-success times are Θ(N/(MB))\Theta(N/(MB))Θ(N/(MB)) without spatial coherence, irrespective of inter-sensor entanglement; Θ(N/M/B)\Theta(\sqrt{N/M}/B)Θ(N/M​/B) with coherent motion but no inter-sensor entanglement; and Θ(N/(MB))\Theta(\sqrt{N}/(MB))Θ(N​/(MB)) with both resources. Protocols combine parallel search or collectively enhanced coupling with amplitude amplification. Matching hybrid-method lower bounds constrain averaged generator variances and allow arbitrary controls and ancillas, provided resource restrictions apply to joint sensor–ancilla states.
The model excludes transport costs, spatial locality constraints, decoherence, and control errors. Noise robustness, bounded motion, unknown field strength, and multiple field regions are left for future study.
Quantum sensor networks promise precision advantages over classical and single-sensor strategies, in particular when the estimator is non-local. We address the problem of finding such estimators through a framework we connote spatial quantum sensing: given an underlying field interrogated by a network of quantum sensors at fixed positions, construct an estimator for a property of the field, for example, distinguishing a source of signal, or evaluating the field or its derivatives at an arbitrary point. We first treat polynomial fields, casting the task as an interpolation problem, and then generalize to fields modeled by analytic functions, which yields general least-squares estimators. A central and largely unaddressed question is under what conditions on sensor placement these estimators are well-defined and error-free. For mmm-dimensional arrays we give explicit constructions and proofs in the interpolation setting using algebraic geometry, and establish necessary and sufficient conditions in the general case. Comparing a non-local entangled protocol with the best local strategy, we show that entanglement yields maximal precision in distributed sensing under global resource constraints. Finally, we introduce error-free subspaces, a technique that translates prior knowledge of the field into a reduction in the number of required sensors. We expect these techniques to be broadly useful in sensing problems across scales, ranging from earth-scale experiments to local applications such as biological imaging.
Most quantum metrology protocols harness highly entangled probe states and globally accessible measurements to surpass the standard quantum limit. However, it is challenging to satisfy these requirements in realistic many-body sensors. We demonstrate that both of these constraints can be overcome in quantum chaotic sensors. Crucially, we establish that even in the presence of partial measurement accessibility, chaotic dynamics enables initial unentangled states to exhibit Heisenberg scaling of the quantum Fisher information, IαI_αIα​ with time. In the weakly chaotic regime, we identify spin-coherent states placed at the edge of the regular islands in the mixed classical phase space as optimal initial states for enhanced sensitivity. On the other hand, in the strongly chaotic regime, IαI_αIα​ is insensitive to the choice of the initial state. Notably, quantum-enhanced sensitivity is achieved even when a very low fraction (∼5%\sim 5\%∼5%) of the qubits are accessible. These results establish quantum chaos as a robust resource for quantum-enhanced sensing under realistic accessibility constraints on accessibility.
We show that a single moving quantum sensor provides complete access to spatially correlated scalar fields. We demonstrate that with either trajectory or internal state control, one can selectively measure any linear functional, e.g. a gradient or a spatial Fourier series coefficient, while successfully eliminating {\it all} noise signals with orthogonal spatial correlation. This even exceeds the capabilities of a sensor network consisting of multiple entangled, yet spatially fixed, quantum sensors, where the number of suppressed noise signals is limited by the number of sensor positions. We show that one can achieve an improved scaling of the quantum Fisher information for moving sensors beyond the static fundamental limit of T2T^2T2.
We study the problem of learning arbitrary nnn-qubit Lindbladians, the generators of Markovian open-system dynamics, from their time evolution. We give the first known efficient algorithm that learns arbitrary Lindbladians without any structural assumptions. For an nnn-qubit Lindbladian of dynamical strength at most ΛΛΛ, the algorithm estimates every coefficient to error ε\varepsilonε using O~(Λ2/ε2)\widetilde O(Λ^2/\varepsilon^2)O(Λ2/ε2) experiments and O~(Λ/ε2)\widetilde O(Λ/\varepsilon^2)O(Λ/ε2) total evolution time, with classical running time polynomial in nnn and Λ/εΛ/\varepsilonΛ/ε. Both experimental costs match known lower bounds up to polylogarithmic factors. The algorithm identifies candidate labels through product Pauli experiments and estimates their coefficients using random stabilizer preparations and Clifford measurements. It requires no ancillas or control during the unknown evolution. For constant kkk, our algorithm learns generic kkk-local Lindbladians of local dynamical strength at most ΛlocΛ_{\mathrm{loc}}Λloc​ using O~(n2Λloc2/ε2)\widetilde O(n^2Λ_{\mathrm{loc}}^2/\varepsilon^2)O(n2Λloc2​/ε2) experiments and O~(nΛloc/ε2)\widetilde O(nΛ_{\mathrm{loc}}/\varepsilon^2)O(nΛloc​/ε2) total evolution time, improving the upper bounds of prior works in terms of the dependence on nnn. We further improve the lower bounds of Arad, Chen, Guo, Rebentrost, and Yu (SODA 2027) using a family of 333-local Lindbladians. They already hold when the support is known, and only one Hamiltonian coefficient is requested, even for adaptive protocols with arbitrary ancillas and quantum memory. These lower bounds establish that our algorithm is optimal up to polylogarithmic factors in both experiment count and total evolution time for every fixed k≥3k \geq 3k≥3.
Current metrological bounds typically assume full control over all particles that are involved in the protocol. Relaxing this assumption, we study metrological performance when only limited control is available. As an example, we measure a static magnetic field when a fully controlled quantum sensor is supplemented by particles over which only global control is possible. We show that even for a noisy quantum sensor, a protocol that maps the magnetic field to a precession frequency can achieve transient super-Heisenberg scaling in measurement time and Heisenberg scaling in the particle number. This leads to an estimation uncertainty that approaches that achievable under full control to within a factor independent of the particle number for a given total time. Applications to hybrid sensing devices and the crucial role of the quantum character of the sensor are discussed.
Quantum sensors can show unprecedented sensitivities, provided they are controlled in a very specific, optimal way. Here, we consider a spin sensor of time-varying fields in the presence of dephasing noise, and we show that the problem of finding the pulsed control field that optimizes the sensitivity (i.e., the smallest detectable signal) can be mapped to the determination of the ground state of a spin chain. We find an approximate but analytic solution of this problem, which provides a lower bound for the sensitivity and a pulsed control very close to optimal, which we further use as initial guess for realizing a fast simulated annealing algorithm. We experimentally demonstrate the sensitivity improvement for a spin-qubit magnetometer based on a nitrogen-vacancy center in diamond.