The important problem of optimal waveform estimation for quantum sensing is solved using a time-symmetric approach. The theory generalizes prior work in classical and quantum estimation and can significantly out-perform previously proposed techniques.
Smoothing is an estimation technique that takes into account both past and future observations and can be more accurate than filtering alone. In this Letter, a quantum theory of smoothing is constructed using a time-symmetric formalism, thereby generalizing prior work on classical and quantum filtering, retrodiction, and smoothing. The proposed theory solves the important problem of optimally estimating classical Markov processes coupled to a quantum system under continuous measurements, and is thus expected to find major applications in future quantum sensing systems, such as gravitational wave detectors and atomic magnetometers.
Quantum parameter estimation has many applications, from gravitational wave detection to quantum key distribution. The most commonly used technique for this type of estimation is quantum filtering, using only past observations. We present the first experimental demonstration of quantum smoothing, a time-symmetric technique that uses past and future observations, for quantum parameter estimation. We consider both adaptive and nonadaptive quantum smoothing, and show that both are better than their filtered counterparts. For the problem of estimating a stochastically varying phase shift on a coherent beam, our theory predicts that adaptive quantum smoothing (the best scheme) gives an estimate with a mean-square error up to 2sqrt[2] times smaller than nonadaptive filtering (the standard quantum limit). The experimentally measured improvement is 2.24+/-0.14.
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.