Abstract Global quantum sensing enables parameter estimation across arbitrary ranges with a finite number of measurements. Among the various existing formulations, the Bayesian paradigm stands as a flexible approach for optimal protocol design under minimal assumptions. Within this paradigm, however, there are two fundamentally different ways to capture prior ignorance and uninformed estimation; namely, requiring invariance of the prior distribution under specific parameter transformations, or adhering to the geometry of a state space. In this paper we carefully examine the practical consequences of both the invariance-based and the geometry-based approaches, and show how to apply them in relevant examples of rate and coherence estimation in noisy settings. We find that, while the invariance-based approach often leads to simpler priors and estimators and is more broadly applicable in adaptive scenarios, the geometry-based one can lead to faster posterior convergence in a well-defined measurement setting. Crucially, by employing the notion of location-isomorphic parameters, we are able to unify the two formulations into a single practical and versatile framework for optimal global quantum sensing, detailing when and how each set of assumptions should be employed to tackle any given estimation task. We thus provide a blueprint for the design of novel high-precision quantum sensors.
Abstract Global quantum sensing enables parameter estimation across arbitrary ranges with a finite number of measurements. Among the various existing formulations, the Bayesian paradigm stands as a flexible approach for optimal protocol design under minimal assumptions. Within this paradigm, however, there are two fundamentally different ways to capture prior ignorance and uninformed estimation; namely, requiring invariance of the prior distribution under specific parameter transformations, or adhering to the geometry of a state space. In this paper we carefully examine the practical consequences of both the invariance-based and the geometry-based approaches, and show how to apply them in relevant examples of rate and coherence estimation in noisy settings. We find that, while the invariance-based approach often leads to simpler priors and estimators and is more broadly applicable in adaptive scenarios, the geometry-based one can lead to faster posterior convergence in a well-defined measurement setting. Crucially, by employing the notion of location-isomorphic parameters, we are able to unify the two formulations into a single practical and versatile framework for optimal global quantum sensing, detailing when and how each set of assumptions should be employed to tackle any given estimation task. We thus provide a blueprint for the design of novel high-precision quantum sensors.
Abstract Quantum sensors are now universally acknowledged as one of the most promising near-term quantum technologies. The traditional formulation of quantum sensing introduces a concrete bound on ultimate precision through the so-called local sensing framework, in which a significant knowledge of prior information about the unknown parameter value is implicitly assumed. Moreover, the framework provides a systematic approach for optimizing the sensing protocol. In contrast, the paradigm of global sensing aims to find a precision bound for parameter estimation in the absence of such prior information. In recent years, vigorous research has been pursued to describe the contours of global quantum estimation. Here, we review some of these emerging developments. These developments are both in the realm of finding ultimate precision bounds with respect to appropriate figures of merit in the global sensing paradigm, as well as in the search for algorithms that achieve these bounds. We categorize these developments into two largely mutually exclusive camps; one employing Bayesian updating and the other seeking to generalize the frequentist picture of local sensing towards the global paradigm. In the first approach, in order to achieve the best performance, one has to optimize the measurement settings adaptively. In the second approach, the measurement setting is fixed, however the challenge is to identify this fixed measurement optimally.
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.
Combining quantum and Bayesian principles leads to optimality in metrology, but the optimization equations involved are often hard to solve. This Letter mitigates this problem with a class of measurement strategies for quantities isomorphic to location parameters, which are shown to admit a closed-form optimization. The resulting framework admits any parameter range, prior information, or state, and the associated estimators apply to finite samples. As an example, the metrology of relative weights is formulated from first principles and shown to require hyperbolic errors. The primary advantage of this approach lies in its simplifying power: it reduces the search for good strategies to identifying which symmetry leaves a state of maximum ignorance invariant. This will facilitate the application of quantum metrology to fundamental physics, where symmetries play a key role. Published by the American Physical Society 2024
Conventional formulation of quantum sensing has been mostly developed in the context of local estimation, where the unknown parameter is roughly known. In contrast, global sensing, where the prior information is incomplete and the unknown parameter is only known to lie within a broad interval, is practically more engaging but has received far less theoretical attention. Available formulations of global sensing rely on adaptive Bayesian strategies requiring on-the-fly change in measurement settings, or minimizing average uncertainty yielding unsaturable bounds. Here, we provide an operationally motivated approach to global sensing for fixed but optimized settings. Our scheme yields a saturable precision bound optimizing the measurement as well as the probe preparation simultaneously. The formalism is general and computationally scalable for generic bosonic multimode Gaussian or many-particle free-fermionic quantum sensors. We illustrate the implications for Gaussian thermometry and Gaussian phase estimation by showing that the optimal measurement changes, either gradually or abruptly, from homodyne for local sensing, towards heterodyne for global sensing. In contrast, for fermionic transverse XY probes, the optimal measurement basis stays fixed independent of width.
Using quantum systems as sensors or probes has been shown to greatly improve the precision of parameter estimation by exploiting unique quantum features such as entanglement. A major task in quantum sensing is to design the optimal protocol, i.e., the most precise one. It has been solved for some specific instances of the problem, but in general even numerical methods are not known. Here, we focus on the single-shot Bayesian setting, where the goal is to find the optimal initial state of the probe (which can be entangled with an auxiliary system), the optimal measurement, and the optimal estimator function. We leverage the formalism of higher-order operations to develop a method based on semidefinite programming that finds a protocol that is close to the optimal one with arbitrary precision. Crucially, our method is not restricted to any specific quantum evolution, cost function, or prior distribution, and thus can be applied to any estimation problem. Moreover, it can be applied to both single-parameter or multiparameter estimation tasks. We demonstrate our method with three examples, consisting of unitary phase estimation, thermometry in a bosonic bath, and multiparameter estimation of an SU(2) transformation. Exploiting our methods, we extend several results from the literature. For example, in the thermometry case, we find the optimal protocol at any finite time and quantify the usefulness of entanglement. Published by the American Physical Society 2024
Bayesian quantum estimation provides a robust formalism for quantum technologies, particularly in scenarios with limited data and minimal prior information. Yet, its application to continuous-variable systems has remained limited and largely numerical due to the difficulty of the underlying parameter integrals. Here, we introduce a variational framework that restricts the optimisation over all measurements and estimators to a finite-dimensional subspace, reducing the problem to a linear system of equations with closed-form solutions. These solutions have a geometric interpretation as orthogonal projections of the global optimum onto the chosen subspace. For Gaussian states, a natural subspace is spanned by operators polynomial in the canonical quadratures, whose moments are computable from the first and second moments of the state. We further derive a necessary and sufficient condition for global optimality, and show that post-processing with the posterior mean, rather than using the estimator obtained from the subspace, improves performance towards the global optimum. Through single-shot examples, we show that the framework yields experimentally feasible strategies based on Gaussian operations and quadrature measurements that are either optimal or near-optimal.