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:quant-ph/0611182 · Journal of Physics A Mathematical and Theoretical

Bhattacharyya inequality for quantum state estimation

Yoshiyuki Tsuda

Published Jan 9, 2007• 5 citations
arXivHTMLPDF

Abstract

Using a higher order derivative with respect to the parameter, we will give lower bounds for variance of unbiased estimators in quantum estimation problems. This is a quantum version of the Bhattacharyya inequality in the classical statistical estimation. Because of the non-commutativity of operator multiplication, we obtain three different types of lower bounds: Type S, Type R and Type L. If the parameter is a real number, the Type S bound is useful. If the parameter is complex, the Type R and L bounds are useful. As an application, we will consider estimation of polynomials of the complex amplitude of the quantum Gaussian state. For the case where the amplitude lies in the real axis, a uniformly optimum estimator for the square of the amplitude will be derived using the Type S bound. It will be shown that there is no unbiased estimator uniformly optimum as a polynomial of annihilation and/or creation operators for the cube of the amplitude. For the case where the amplitude does not necessarily lie in the real axis, uniformly optimum estimators for holomorphic, antiholomorphic and real-valued polynomials of the amplitude will be derived. Those estimators for the holomorphic and real-valued cases attain the Type R bound, and those for the antiholomorphic and real-valued cases attain the Type L bound. This paper clarifies what is the best method to measure the energy of a laser.

DOI
10.1088/1751-8113/40/4/015

Related papers

On the Parameter Estimation Problem for Quantum Statistical Models

Hiroshi Nagaoka

The parameter estimation problem for a quantum statistical model , where {S θ } are quantum states (i.e. density operators) and Θ is an open set in R n , is considered. The problem is to estimate the true state which is unknown but is assumed to lie in . The quantum analogues of various notions developed in the classical statistical estimation theory are studied; e.g., unbiased estimator, lower bound of Craméer-Rao type, efficient estimator, asymptotic efficiency, differential geometrical structures, etc. It is shown that the quantum theory for the one-parameter case (n = 1) is constructed almost in parallel with the classical theory, while several difficulties lie ahead of us to construct the general theory of quantum estimation for the multi-parameter case.

WORLD SCIENTIFIC eBooks•Feb 1, 2005•38 citations

Attaining the Ultimate Precision Limit in Quantum State Estimation

Yuxiang Yang, Giulio Chiribella, Masahito Hayashi

We derive a bound on the precision of state estimation for finite dimensional quantum systems and prove its attainability in the generic case where the spectrum is non-degenerate. Our results hold under an assumption called local asymptotic covariance, which is weaker than unbiasedness or local unbiasedness. The derivation is based on an analysis of the limiting distribution of the estimator’s deviation from the true value of the parameter, and takes advantage of quantum local asymptotic normality, a useful asymptotic characterization of identically prepared states in terms of Gaussian states. We first prove our results for the mean square error of a special class of models, called D -invariant, and then extend the results to arbitrary models, generic cost functions, and global state estimation, where the unknown parameter is not restricted to a local neighbourhood of the true value. The extension includes a treatment of nuisance parameters, i.e. parameters that are not of interest to the experimenter but nevertheless affect the precision of the estimation. As an illustration of the general approach, we provide the optimal estimation strategies for the joint measurement of two qubit observables, for the estimation of qubit states in the presence of amplitude damping noise, and for noisy multiphase estimation.

arXiv:1802.07587•Communications in Mathematical Physics•Apr 26, 2019•123 citations

Quantum estimates for classical polynomial optimization

Oleg Evnin

The problem of finding lower and upper bounds on multivariate homogeneous polynomials is both difficult and important given its applications to questions ranging from dynamical stability in complex potential landscapes to data analysis. From the standpoint of tensor eigenvalue theory, the question is equivalent to finding the smallest and the largest eigenvalues of the coefficient tensor corresponding to the given polynomial. Standard approaches outlined in the literature amount to running nonlinear iterations in search for the optimal rays along which the growth of the polynomial is fastest or slowest. Unlike the case of matrices (or their corresponding multivariate quadratic forms) convergence of such algorithms for higher-rank tensors is capricious due to the complex topography of polynomial objective functions. In this essay, a very different strategy, inspired by quantum-mechanical variational methods, is introduced for finding bounds on polynomials. The original polynomial is replaced by an operator acting in a suitably chosen (large) space of states, such that in an appropriate "classical" limit this operator approaches the original polynomial expression made of commutative variables. As a result, approximating the smallest and largest eigenvalues of the coefficient tensor, and thus finding bounds on polynomials, amounts to diagonalizing the resulting quantum operator, represented as a large matrix, and then inspecting the smallest and largest eigenvalues of this matrix. This approach is then successfully applied to standard test examples from tensor eigenvalue literature and other problems of interest in mathematical physics including Strichartz-type inequalities.

math-phCross-listedarXiv:2607.25445•Journal of Physics A Mathematical and Theoretical•Jul 29, 2026•0 citations

Comparison of estimation limits for quantum two-parameter estimation

Simon K. Yung, Lorcán O. Conlon, Jie Zhao +2 more

Measurement estimation bounds for local quantum multiparameter estimation, which provide lower bounds on possible measurement uncertainties, have so far been formulated in two ways: by extending the classical Cramér-Rao bound (e.g., the quantum Cramér-Rao bound and the Nagaoka Cramér-Rao bound) and by incorporating the parameter estimation framework with the uncertainty principle, as in the Lu-Wang uncertainty relation. In this work, we present a general framework that allows a direct comparison between these different types of estimation limits. Specifically, we compare the attainability of the Nagaoka Cramér-Rao bound and the Lu-Wang uncertainty relation, using analytical and numerical techniques. We show that these two limits can provide different information about the physically attainable precision. We present an example where both limits provide the same attainable precision and an example where the Lu-Wang uncertainty relation is not attainable even for pure states. We further demonstrate that the unattainability in the latter case arises because the figure of merit underpinning the Lu-Wang uncertainty relation (the difference between the quantum and classical Fisher information matrices) does not necessarily agree with the conventionally used figure of merit (mean-squared error). The results offer insights into the general attainability and applicability of the Lu-Wang uncertainty relation. Furthermore, our proposed framework for comparing bounds of different types may prove useful in other settings. Published by the American Physical Society 2024

arXiv:2407.12466•Physical Review Research•Sep 18, 2024•9 citations

Quantum Barankin bounds beyond local unbiasedness: Analytic results for Gaussian states via a right-division framework

Maximilian Reichert, Javier Navarro, Gerardo Adesso +2 more

We propose a quantum version of the Barankin bound as an alternative to the quantum Cramér-Rao bound for quantum parameter estimation. The quantum Barankin bound provides a lower bound on the mean squared error of estimators satisfying arbitrarily chosen bias constraints at arbitrarily chosen parameter points. In particular, unbiasedness over the entire parameter space can be imposed, yielding precision limits for globally unbiased quantum parameter estimation. In contrast to the recently derived quantum Barankin bound, which is based on a symmetric division superoperator, our bound is based on a nonsymmetric right-division superoperator. This formulation enables us to find analytic expressions for the Barankin matrix for Gaussian states, which allows for an efficient calculation of the bound. We demonstrate the usefulness of our results by applying them to various examples that exhibit the threshold effect in the few-shot regime, which is invisible to the standard quantum Cramér-Rao bound approach.

quant-pharXiv:2609.10157•Sep 10, 2026•1 citation

Existence of unbiased estimators in discrete quantum systems

J. Navarro, Ricard Ravell Rodríguez, Mikel Sanz

The Cramér-Rao bound serves as a crucial lower limit for the mean square error of an estimator in frequentist parameter estimation. Paradoxically, it requires highly accurate prior knowledge of the estimated parameter for constructing the optimal unbiased estimator. In contrast, Bhattacharyya bounds offer a more robust estimation framework with respect to prior accuracy by introducing additional constraints on the estimator. In this work, we examine divergences that arise in the computation of these bounds and establish the conditions under which they remain valid. Notably, we show that when the number of constraints exceeds the number of measurement outcomes, an estimator with finite variance typically does not exist. Furthermore, we systematically investigate the properties of these bounds using paradigmatic examples, comparing them to the Cramér-Rao and Bayesian approaches.

arXiv:2402.15242•Physical Review Research•Apr 16, 2025•5 citations
Using a higher order derivative with respect to the parameter, we will give lower bounds for variance of unbiased estimators in quantum estimation problems. This is a quantum version of the Bhattacharyya inequality in the classical statistical estimation. Because of the non-commutativity of operator multiplication, we obtain three different types of lower bounds: Type S, Type R and Type L. If the parameter is a real number, the Type S bound is useful. If the parameter is complex, the Type R and L bounds are useful. As an application, we will consider estimation of polynomials of the complex amplitude of the quantum Gaussian state. For the case where the amplitude lies in the real axis, a uniformly optimum estimator for the square of the amplitude will be derived using the Type S bound. It will be shown that there is no unbiased estimator uniformly optimum as a polynomial of annihilation and/or creation operators for the cube of the amplitude. For the case where the amplitude does not necessarily lie in the real axis, uniformly optimum estimators for holomorphic, antiholomorphic and real-valued polynomials of the amplitude will be derived. Those estimators for the holomorphic and real-valued cases attain the Type R bound, and those for the antiholomorphic and real-valued cases attain the Type L bound. This paper clarifies what is the best method to measure the energy of a laser.
The parameter estimation problem for a quantum statistical model , where {S θ } are quantum states (i.e. density operators) and Θ is an open set in R n , is considered. The problem is to estimate the true state which is unknown but is assumed to lie in . The quantum analogues of various notions developed in the classical statistical estimation theory are studied; e.g., unbiased estimator, lower bound of Craméer-Rao type, efficient estimator, asymptotic efficiency, differential geometrical structures, etc. It is shown that the quantum theory for the one-parameter case (n = 1) is constructed almost in parallel with the classical theory, while several difficulties lie ahead of us to construct the general theory of quantum estimation for the multi-parameter case.
We derive a bound on the precision of state estimation for finite dimensional quantum systems and prove its attainability in the generic case where the spectrum is non-degenerate. Our results hold under an assumption called local asymptotic covariance, which is weaker than unbiasedness or local unbiasedness. The derivation is based on an analysis of the limiting distribution of the estimator’s deviation from the true value of the parameter, and takes advantage of quantum local asymptotic normality, a useful asymptotic characterization of identically prepared states in terms of Gaussian states. We first prove our results for the mean square error of a special class of models, called D -invariant, and then extend the results to arbitrary models, generic cost functions, and global state estimation, where the unknown parameter is not restricted to a local neighbourhood of the true value. The extension includes a treatment of nuisance parameters, i.e. parameters that are not of interest to the experimenter but nevertheless affect the precision of the estimation. As an illustration of the general approach, we provide the optimal estimation strategies for the joint measurement of two qubit observables, for the estimation of qubit states in the presence of amplitude damping noise, and for noisy multiphase estimation.
The problem of finding lower and upper bounds on multivariate homogeneous polynomials is both difficult and important given its applications to questions ranging from dynamical stability in complex potential landscapes to data analysis. From the standpoint of tensor eigenvalue theory, the question is equivalent to finding the smallest and the largest eigenvalues of the coefficient tensor corresponding to the given polynomial. Standard approaches outlined in the literature amount to running nonlinear iterations in search for the optimal rays along which the growth of the polynomial is fastest or slowest. Unlike the case of matrices (or their corresponding multivariate quadratic forms) convergence of such algorithms for higher-rank tensors is capricious due to the complex topography of polynomial objective functions. In this essay, a very different strategy, inspired by quantum-mechanical variational methods, is introduced for finding bounds on polynomials. The original polynomial is replaced by an operator acting in a suitably chosen (large) space of states, such that in an appropriate "classical" limit this operator approaches the original polynomial expression made of commutative variables. As a result, approximating the smallest and largest eigenvalues of the coefficient tensor, and thus finding bounds on polynomials, amounts to diagonalizing the resulting quantum operator, represented as a large matrix, and then inspecting the smallest and largest eigenvalues of this matrix. This approach is then successfully applied to standard test examples from tensor eigenvalue literature and other problems of interest in mathematical physics including Strichartz-type inequalities.
Measurement estimation bounds for local quantum multiparameter estimation, which provide lower bounds on possible measurement uncertainties, have so far been formulated in two ways: by extending the classical Cramér-Rao bound (e.g., the quantum Cramér-Rao bound and the Nagaoka Cramér-Rao bound) and by incorporating the parameter estimation framework with the uncertainty principle, as in the Lu-Wang uncertainty relation. In this work, we present a general framework that allows a direct comparison between these different types of estimation limits. Specifically, we compare the attainability of the Nagaoka Cramér-Rao bound and the Lu-Wang uncertainty relation, using analytical and numerical techniques. We show that these two limits can provide different information about the physically attainable precision. We present an example where both limits provide the same attainable precision and an example where the Lu-Wang uncertainty relation is not attainable even for pure states. We further demonstrate that the unattainability in the latter case arises because the figure of merit underpinning the Lu-Wang uncertainty relation (the difference between the quantum and classical Fisher information matrices) does not necessarily agree with the conventionally used figure of merit (mean-squared error). The results offer insights into the general attainability and applicability of the Lu-Wang uncertainty relation. Furthermore, our proposed framework for comparing bounds of different types may prove useful in other settings. Published by the American Physical Society 2024
We propose a quantum version of the Barankin bound as an alternative to the quantum Cramér-Rao bound for quantum parameter estimation. The quantum Barankin bound provides a lower bound on the mean squared error of estimators satisfying arbitrarily chosen bias constraints at arbitrarily chosen parameter points. In particular, unbiasedness over the entire parameter space can be imposed, yielding precision limits for globally unbiased quantum parameter estimation. In contrast to the recently derived quantum Barankin bound, which is based on a symmetric division superoperator, our bound is based on a nonsymmetric right-division superoperator. This formulation enables us to find analytic expressions for the Barankin matrix for Gaussian states, which allows for an efficient calculation of the bound. We demonstrate the usefulness of our results by applying them to various examples that exhibit the threshold effect in the few-shot regime, which is invisible to the standard quantum Cramér-Rao bound approach.
The Cramér-Rao bound serves as a crucial lower limit for the mean square error of an estimator in frequentist parameter estimation. Paradoxically, it requires highly accurate prior knowledge of the estimated parameter for constructing the optimal unbiased estimator. In contrast, Bhattacharyya bounds offer a more robust estimation framework with respect to prior accuracy by introducing additional constraints on the estimator. In this work, we examine divergences that arise in the computation of these bounds and establish the conditions under which they remain valid. Notably, we show that when the number of constraints exceeds the number of measurement outcomes, an estimator with finite variance typically does not exist. Furthermore, we systematically investigate the properties of these bounds using paradigmatic examples, comparing them to the Cramér-Rao and Bayesian approaches.