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/0608198 · Translations - American Mathematical Society/Translations

Quantum estimation and the quantum central limit theorem

Masahito Hayashi

Published Jul 7, 2009• 34 citations
arXivHTMLPDF

Abstract

This paper gives a survey about quantum estimation. We also describes the relation between the quantum central limit theorem and the asymptotic bound of mean square error in quantum state estimation.
DOI
10.1090/trans2/227/05

Related papers

Valid lower bound for all estimators in quantum parameter estimation

Jing Liu, Haidong Yuan

The widely used quantum Cramér–Rao bound (QCRB) sets a lower bound for the mean square error of unbiased estimators in quantum parameter estimation, however, in general QCRB is only tight in the asymptotical limit. With a limited number of measurements biased estimators can have a far better performance for which QCRB cannot calibrate. Here we introduce a valid lower bound for all estimators, either biased or unbiased, which can serve as standard of merit for all quantum parameter estimations.

arXiv:1609.01618•New Journal of Physics•Sep 6, 2016•26 citations

Quantum estimation for non-differentiable models

Yoshiyuki Tsuda, Keiji Matsumoto

State estimation is a classical problem in quantum information. In optimization of an estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use a derivative of the density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In this paper, lower bounds to a mean square error of an estimator are derived for a quantum estimation problem without smoothness assumptions. Our main idea is to replace the derivative by difference, as is done in classical estimation theory. We applied the inequalities to several examples, and derived an optimal estimator for some of them.

arXiv:quant-ph/0207150•Journal of Physics A Mathematical and General•Feb 3, 2005•14 citations

Asymptotic performance of optimal state estimation in qubit system

Masahito Hayashi, Keiji Matsumoto

We derive an asymptotic bound for the error of state estimation when we are allowed to use the quantum correlation in the measuring apparatus. It is also proven that this bound can be achieved in any statistical model in the qubit system. Moreover, we show that this bound cannot be attained by any quantum measurement with no quantum correlation in the measuring apparatus except for several specific statistical models. That is, in such a statistical model, the quantum correlation can improve the accuracy of the estimation in an asymptotic setting.

Journal of Mathematical Physics•Oct 1, 2008•105 citations

On the error distribution for randomly-shifted lattice rules

Pierre L’Ecuyer, Bruno Tuffin

Randomized quasi-Monte Carlo (RQMC) methods estimate the expectation of a random variable by the average of n dependent realizations of it. In general, due to the strong dependence, the estimation error may not obey a central limit theorem. Analysis of RQMC methods have so far focused mostly on the convergence rates of asymptotic worst-case error bounds and variance bounds, when n ¿ ¿, but little is known about the limiting distribution of the error. Here we examine this limiting distribution for the special case of a randomly-shifted lattice rule, when the integrand is smooth. We start with simple one-dimensional functions, where we show that the limiting distribution is uniform over a bounded interval if the integrand is non-periodic, and has a square root form over a bounded interval if the integrand is periodic. In higher dimensions, for linear functions, the distribution function of the properly standardized error converges to a spline of degree equal to the dimension.

Winter Simulation Conference•Dec 1, 2009•2 citations

Asymptotic Theory of Quantum Statistical Inference: Selected Papers

Masahito Hayashi

Hypothesis Testing Quantum Cramer-Rao Bound in Mixed States Model Quantum Cramer-Rao Bound in Pure States Model Group Symmetric Approach to Pure States Model Large Deviation Theory in Quantum Estimation Futher Topics on Quantum Statistical Inference.

WORLD SCIENTIFIC eBooks•Feb 1, 2005•163 citations

Two kinds of asymptotic bounds in quantum channel estimation

Masahito Hayashi

In order to treat the covariant approach and the Cramer-Rao approach in a unified viewpoint, we compare the Cramer-Rao bound and the local asymptotic mini-max bound, which coincides the limit of Bayesian bound in the group covariant case. it is shown that the local asymptotic mini-max bound is strictly larger than the Cramer-Rao bound in the phase estimation case while the both bounds coincide when the minimum mean square error decreases with the order O(1/n). We also derive a sufficient condition for that the minimum mean square error decreases with the order O(1/n).

•Mar 24, 2010•1 citation
The widely used quantum Cramér–Rao bound (QCRB) sets a lower bound for the mean square error of unbiased estimators in quantum parameter estimation, however, in general QCRB is only tight in the asymptotical limit. With a limited number of measurements biased estimators can have a far better performance for which QCRB cannot calibrate. Here we introduce a valid lower bound for all estimators, either biased or unbiased, which can serve as standard of merit for all quantum parameter estimations.
State estimation is a classical problem in quantum information. In optimization of an estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use a derivative of the density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In this paper, lower bounds to a mean square error of an estimator are derived for a quantum estimation problem without smoothness assumptions. Our main idea is to replace the derivative by difference, as is done in classical estimation theory. We applied the inequalities to several examples, and derived an optimal estimator for some of them.
We derive an asymptotic bound for the error of state estimation when we are allowed to use the quantum correlation in the measuring apparatus. It is also proven that this bound can be achieved in any statistical model in the qubit system. Moreover, we show that this bound cannot be attained by any quantum measurement with no quantum correlation in the measuring apparatus except for several specific statistical models. That is, in such a statistical model, the quantum correlation can improve the accuracy of the estimation in an asymptotic setting.
Randomized quasi-Monte Carlo (RQMC) methods estimate the expectation of a random variable by the average of n dependent realizations of it. In general, due to the strong dependence, the estimation error may not obey a central limit theorem. Analysis of RQMC methods have so far focused mostly on the convergence rates of asymptotic worst-case error bounds and variance bounds, when n ¿ ¿, but little is known about the limiting distribution of the error. Here we examine this limiting distribution for the special case of a randomly-shifted lattice rule, when the integrand is smooth. We start with simple one-dimensional functions, where we show that the limiting distribution is uniform over a bounded interval if the integrand is non-periodic, and has a square root form over a bounded interval if the integrand is periodic. In higher dimensions, for linear functions, the distribution function of the properly standardized error converges to a spline of degree equal to the dimension.
In order to treat the covariant approach and the Cramer-Rao approach in a unified viewpoint, we compare the Cramer-Rao bound and the local asymptotic mini-max bound, which coincides the limit of Bayesian bound in the group covariant case. it is shown that the local asymptotic mini-max bound is strictly larger than the Cramer-Rao bound in the phase estimation case while the both bounds coincide when the minimum mean square error decreases with the order O(1/n). We also derive a sufficient condition for that the minimum mean square error decreases with the order O(1/n).