Papers
Topics
Authors
Recent
Search
2000 character limit reached

Precision bounds for frequency estimation under collective dephasing and open-loop control

Published 25 Mar 2026 in quant-ph | (2603.23804v1)

Abstract: Dephasing noise is a ubiquitous source of decoherence in current atomic sensors. We address the problem of entanglement-assisted frequency estimation subject to classical dephasing noise with full spatial correlations (collective) and arbitrary temporal correlations. Our contributions are threefold. (i) We derive rigorous, state-independent bounds on the achievable estimation precision, showing how they are entirely determined by the short-time behavior of the decoherence function. For temporally uncorrelated (Markovian) dephasing, precision is limited by a probe-independent constant. For temporally correlated stationary noise, the bound approaches the noiseless limit for classical states, precluding any asymptotic quantum advantage. (ii) We show that these scaling bounds are tight, by constructing generalized Ramsey protocols that saturate them. These optimal protocols use squeezing at the input and before readout, both of which are available in state-of-the-art atomic interferometers. Implementing a perfect-echo protocol, which reaches Heisenberg scaling in the absence of noise, remains optimal in this noisy setting, irrespective of the noise temporal correlations. (iii) We prove that arbitrary collective open-loop control cannot lift the no-go for super-classical precision scaling under either Markovian or colored stationary noise, highlighting the detrimental nature of full spatial correlations. In the latter case, temporal correlations may nonetheless enable constant-factor improvements over the standard quantum limit, which may still be important in practical metrological scenarios.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.