Asymptotic Efficiency and Finite Sample Performance of Frequentist Quantum State Estimation
Raj Chakrabarti, Anisha Ghosh

TL;DR
This paper evaluates the finite sample and asymptotic performance of maximum likelihood estimators in quantum state estimation, highlighting limitations of frequentist methods and advocating for Bayesian approaches for improved accuracy.
Contribution
It provides a detailed comparison of finite sample and asymptotic properties of ML estimators in quantum state estimation, revealing limitations and proposing Bayesian methods as a better alternative.
Findings
ML estimators sometimes exclude the true parameter value in finite samples
Asymptotic properties may not hold for realistic sample sizes
Bayesian methods achieve lower estimation errors by incorporating prior knowledge
Abstract
We undertake a detailed study of the performance of maximum likelihood (ML) estimators of the density matrix of finite-dimensional quantum systems, in order to interrogate generic properties of frequentist quantum state estimation. Existing literature on frequentist quantum estimation has not rigorously examined the finite sample performance of the estimators and associated methods of hypothesis testing. While ML is usually preferred on the basis of its asymptotic properties - it achieves the Cramer-Rao (CR) lower bound - the finite sample properties are often less than optimal. We compare the asymptotic and finite-sample properties of the ML estimators and test statistics for two different choices of measurement bases: the average case optimal or mutually unbiased bases (MUB) and a representative set of suboptimal bases, for spin-1/2 and spin-1 systems. We show that, in both cases, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Spectroscopy and Quantum Chemical Studies
