CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 24, 2026

Sufficient support size of measurements for quantum estimation

arXiv Quantum Archived Apr 24, 2026 ✓ Full text saved

arXiv:2604.21323v1 Announce Type: new Abstract: In quantum estimation for a $d$-parameter family of density operators on a finite-dimensional Hilbert space $\mathcal{H}$, an estimator is specified by a pair $\left(M,\hat{\theta}\right)$, where $M$ is a POVM with a finite outcome set $\Omega$ and $\hat{\theta}:\Omega\to\mathbb{R}^{d}$ is a classical estimator map. Since the number of outcomes $\left|\Omega\right|$ is a priori unbounded, the space of admissible POVMs is vast, which makes the searc

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 23 Apr 2026] Sufficient support size of measurements for quantum estimation Koichi Yamagata In quantum estimation for a d-parameter family of density operators on a finite-dimensional Hilbert space \mathcal{H}, an estimator is specified by a pair \left(M,\hat{\theta}\right), where M is a POVM with a finite outcome set \Omega and \hat{\theta}:\Omega\to\mathbb{R}^{d} is a classical estimator map. Since the number of outcomes \left|\Omega\right| is a priori unbounded, the space of admissible POVMs is vast, which makes the search for optimal estimators difficult. In this paper, for the minimization of the weighted trace of the mean squared error among locally unbiased estimators, we prove that it suffices to consider POVMs with at most \left({\rm dim}\,\mathcal{H}\right)^{2}+d(d+1)/2-1 outcomes, and that an optimal measurement can be chosen to be rank-one. For the minimization of the average weighted trace of the mean squared error in Bayesian estimation, we show that it suffices to consider POVMs with at most \left( {\rm dim}\, \mathcal{H}\right)^{2}outcomes, and again an optimal POVM can be taken to be rank-one. Furthermore, when the model admits a real sufficient subalgebra, we show that the \left( {\rm dim}\, \mathcal{H} \right)^{2} term in the above support-size bounds can be reduced in both the locally unbiased and Bayesian settings. These bounds substantially reduce the search space for optimal measurements and justify restricting numerical optimization to rank-one POVMs with finitely many outcomes. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.21323 [quant-ph]   (or arXiv:2604.21323v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2604.21323 Focus to learn more Submission history From: Koichi Yamagata [view email] [v1] Thu, 23 Apr 2026 06:26:07 UTC (11 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Apr 24, 2026
    Archived
    Apr 24, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗