Using the convex structure of positive operator value measurements and several quantities used in quantum metrology, such as quantum Fisher information or the quantum Van Trees information, we present an efficient numerical method to find the best strategy allowed by quantum mechanics to estimate a parameter. This method explores extremal measurements thus providing a significant advantage over previously used methods. We exemplify the method for different cost functions in a qubit and in a harmonic oscillator and find a strong numerical advantage when the desired target error is sufficiently small.
Using the convex structure of positive operator value measurements and several quantities used in quantum metrology, such as quantum Fisher information or the quantum Van Trees information, we present an efficient numerical method to find the best strategy allowed by quantum mechanics to estimate a parameter. This method explores extremal measurements thus providing a significant advantage over previously used methods. We exemplify the method for different cost functions in a qubit and in a harmonic oscillator and find a strong numerical advantage when the desired target error is sufficiently small.
We discuss the problem of finding the best measurement strategy for estimating the value of a quantum system parameter. In general the optimum quantum measurement, in the sense that it maximizes the quantum Fisher information and hence allows one to minimize the estimation error, can only be determined if the value of the parameter is already known. A modification of the quantum Van Trees inequality, which gives a lower bound on the error in the estimation of a random parameter, is proposed. The suggested inequality allows us to assert if a particular quantum measurement, together with an appropriate estimator, is optimal. An adaptive strategy to estimate the value of a parameter, based on our modified inequality, is proposed.
We design an efficient and constructive algorithm to decompose any generalized quantum measurement into a convex combination of extremal measurements. We show that if one allows for a classical post-processing step only extremal rank-1 positive operator valued measures are needed. For a measurement with N elements on a d -dimensional space, our algorithm will decompose it into at most ( N − 1) d + 1 extremals, whereas the best previously known upper bound scaled as d 2 . Since the decomposition is not unique, we show how to tailor our algorithm to provide particular types of decompositions that exhibit some desired property.
Quantum parameter estimation holds significant promise for achieving high precision through the utilization of the most informative measurements. While various lower bounds have been developed to assess the best accuracy for estimates, they are not tight, nor provide a construction of the optimal measurement in general. Thus, determining the explicit forms of optimal measurements has been challenging due to the non-trivial optimization. In this study, we introduce an algorithm, termed QestOptPOVM, designed to directly identify optimal positive operator-valued measure (POVM) using the steepest descent method. Through rigorous testing on several examples for multiple copies of qubit states (up to six copies), we demonstrate the efficiency and accuracy of our proposed algorithm. Moreover, a comparative analysis between numerical results and established lower bounds serves to validate the tightness of the Nagaoka-Hayashi bound in finite-sample quantum metrology for our examples. Concurrently, our algorithm functions as a tool for elucidating the explicit forms of optimal POVMs, thereby enhancing our understanding of quantum parameter estimation methodologies.
Similarly to quantum states, also quantum measurements can be 'mixed', corresponding to a random choice within an ensemble of measuring apparatuses. Such mixing is equivalent to a sort of hidden variable, which produces a noise of purely classical nature. It is then natural to ask which apparatuses are indecomposable , i.e. do not correspond to any random choice of apparatuses. This problem is interesting not only for foundations, but also for applications, since most optimization strategies give optimal apparatuses that are indecomposable. Mathematically the problem is posed describing each measuring apparatus by a positive operator-valued measure (POVM), which gives the statistics of the outcomes for any input state. The POVMs form a convex set, and in this language the indecomposable apparatuses are represented by extremal points—the analogous of 'pure states' in the convex set of states. Differently from the case of states, however, indecomposable POVMs are not necessarily rank-one, e.g. von Neumann measurements. In this paper we give a complete classification of indecomposable apparatuses (for discrete spectrum), by providing different necessary and sufficient conditions for extremality of POVMs, along with a simple general algorithm for the decomposition of a POVM into extremals. As an interesting application, 'informationally complete' measurements are analysed in this respect. The convex set of POVMs is fully characterized by determining its border in terms of simple algebraic properties of the corresponding POVMs.
In this technical note, we study the problem of parameter estimation for quantum channels, which are (completely positive) maps acting on quantum states. We focus on an important subclass of channels called Pauli channels which are characterized by a certain set of vectors (directions) and a number of scalar parameters. For the case where the directions are known, a special parametrization turns the parameter estimation problem into a convex optimization problem. For the case of unknown directions we give a simple algorithm to estimate the directions for qubit Pauli channels. These results assume that the identification experiment configuration is given, namely, a set of quantum states are given on which the channel acts, and a set of positive measurement (operator)s are fixed from which information is gathered. In the second part of the technical note we consider the problem of determining the experiment design, namely, determining states and measurements for optimal parameter identification of the channels. We formalize this problem as a maximization problem for Fisher information and, assuming known channel directions, prove that this problem is convex. We also prove that the optimal states to be used in experiments are pure and the optimal measurements are extremal. For qubit Pauli channels we prove that both the optimal pure input states and projective measurements should be directed towards the channel directions. We illustrate the results of the technical note with numerical examples and simulations.
We study optimal quantum sensing of multiple physical parameters using repeated measurements. In this scenario, the Fisher information framework sets the fundamental limits on sensing performance, yet the optimal states and corresponding measurements that attain these limits remain to be discovered. To address this, we extend the Fisher information approach with a second optimality requirement for a sensor to provide unambiguous estimation of unknown parameters. We propose a systematic method integrating Fisher information and Bayesian approaches to quantum metrology to identify the combination of input states and measurements that satisfies both optimality criteria. Specifically, we frame the optimal sensing problem as an optimization of an asymptotic Bayesian cost function that can be efficiently solved numerically and, in many cases, analytically. We refer to the resulting optimal sensor as a `quantum compass' solution, which serves as a direct multiparameter counterpart to the Greenberger-Horne-Zeilinger state-based interferometer, renowned for achieving the Heisenberg limit in single-parameter metrology. We provide exact quantum compass solutions for paradigmatic multiparameter problem of sensing two and three parameters using an SU(2) sensor. Our metrological cost function opens avenues for quantum variational techniques to design low-depth quantum circuits approaching the optimal sensing performance in the many-repetition scenario. We demonstrate this by constructing simple quantum circuits that achieve the Heisenberg limit for vector field and 3D rotations estimation using a limited set of gates available on a trapped-ion platform. Our work introduces and optimizes sensors for a practical notion of optimality, keeping in mind the ultimate goal of quantum sensors to precisely estimate unknown parameters.