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:2604.21323 · Journal of Mathematical Physics

Sufficient support size of measurements for quantum estimation

Koichi Yamagata

quant-phSubmitted Apr 23, 2026• Announced Apr 24, 2026• 2 citations• Revised Aug 12, 2026 (v2)
v1 · Apr 23, 2026v2 · Aug 12, 2026v3 · Nov 3, 2026
arXivHTMLPDF

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θ\right)$, where $M$ is a POVM with a finite outcome set $Ω$ and $\hatθ:Ω\to\mathbb{R}^{d}$ is a classical estimator map. Since the number of outcomes $\left|Ω\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(\dim\mathcal{H}\right)^{2}+d(d+1)/2-1$ outcomes, and that the optimization can be restricted to rank-one measurements. For Bayesian estimation with a general loss function, we show that rank-one POVMs with at most $(\dim\mathcal{H})^{2}$ outcomes are sufficient for the infimum value of the Bayes risk. Furthermore, when the model admits a real sufficient subalgebra, we show that the $\left(\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.

Comments
Revised version: generalized Bayesian results, clarified the use of infima and their attainment, added appendices on local regularity and nonattainment, and updated the discussion of related work

Related papers

Pure-State Quantum Tomography with Minimal Rank-One POVMs

Dan Edidin, Ivan Gonzalez, Itzhak Tamo

Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete) if the outcome probabilities determine any pure state up to a global phase. We study \emph{rank-one} POVMs that are minimally sufficient for this task. We call such a POVM \emph{vital} if it is PSI-Complete but every proper subcollection is not PSI-Complete. We prove sharp upper bounds on the size of vital rank-one POVMs in dimension \(n\): the size is at most \(\binom{n+1}{2}\) over \(\mathbb{R}\) and at most \(n^{2}\) over \(\mathbb{C}\), and we give constructions that attain these bounds. In the real case, we further exhibit a connection to block designs: whenever \(w \mid n(n-1)\), an \((n,w,w-1)\) design produces a vital rank-one POVM with \(n + n(n-1)/w\) outcomes. We provide explicit constructions for \(w=2,n-1\), and \(n\).

quant-pharXiv:2511.09505•Nov 13, 2025•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

Fast quantum measurement tomography with optimal error bounds

Leonardo Zambrano, Sergi Ramos-Calderer, Richard Kueng

We present a two-step protocol for quantum measurement tomography that is light on classical co-processing cost and still achieves optimal sample complexity. Given measurement data from a known probe state ensemble, we first apply least-squares estimation to produce an unconstrained approximation of the POVM, and then project this estimate onto the set of valid quantum measurements. For a POVM with L outcomes acting on a d -dimensional system, we show that the protocol requires O ( ( d 3 + d 2 L ) / ϵ 2 ) samples to achieve error ϵ in worst-case distance, and O ( d 2 L / ϵ 2 ) samples in average-case distance. We further establish two matching sample complexity lower bounds of Ω ( ( d 3 + d 2 L ) / ϵ 2 ) and Ω ( d 2 L / ϵ 2 ) for any non-adaptive, single-copy POVM tomography protocol. Hence, our projected least squares POVM tomography is sample-optimal in both the dimension and the number of outcomes for both distances. Our method admits an analytic form when using global or local 2-designs as probe ensembles and enables rigorous non-asymptotic error guarantees. Finally, we also complement our findings with empirical performance studies carried out on a noisy superconducting quantum computer with flux-tunable transmon qubits.

arXiv:2507.04500•Quantum•Jul 15, 2026•18 citations

Enhanced observable estimation through classical optimization of informationally overcomplete measurement data: Beyond classical shadows

Joonas Malmi, Keijo Korhonen, Daniel Cavalcanti +1 more

In recent years, informationally complete measurements have attracted considerable attention, especially in the context of classical shadows. In the particular case of informationally overcomplete measurements, for which the number of possible outcomes exceeds the dimension of the space of linear operators in Hilbert space, the dual positive operator-valued measure operators used to interpret the measurement outcomes are not uniquely defined. In this paper, we propose a method to optimize the dual operators after the measurements have been carried out in order to produce sharper, unbiased estimations of observables of interest. We discuss how this procedure can produce zero-variance estimations in cases where the classical shadows formalism, which relies on so-called canonical duals, incurs exponentially large measurement overheads. We also analyze the algorithm in the context of quantum simulation with randomized Pauli measurements, and show that it can significantly reduce statistical errors with respect to canonical duals on multiple observable estimations.

arXiv:2401.18049•Physical Review A•Jun 10, 2024•27 citations

Bayesian Weak Commutativity Does Not Guarantee Attainability of the Nagaoka–Hayashi Bound

Qihang Wang

Bayesian weak commutativity is not sufficient for attaining the Bayesian Nagaoka–Hayashi bound. We construct an explicit two-parameter, finite-prior ensemble of four full-rank states in a four-dimensional Hilbert space and determine its exact minimum quadratic Bayes risk over all positive operator-valued measurements and estimators. The minimum lies strictly above the bound, and seven outcomes are necessary and sufficient to attain it. We also determine the exact optimum over all projective measurements on the original four-dimensional space. A population-normalization witness explains the obstruction and yields a risk gap of at least eta^2/16416 throughout a ladder family with shape parameter 0 <= u <= 1/3, population ratio 1 <= k <= 2, and contrast 0 < eta <= 1/6. On the oscillator slice u = 0, we obtain exact optimal risks and an attaining eight-outcome measurement throughout the stated k and eta ranges. Complete proofs, algebraic certificates, and exact-arithmetic verification code accompany the manuscript.

•Aug 24, 2026•0 citations

Haar-Bayesian Pure-State Prediction under Relative-Entropy Loss: Arbitrary-Effect Reduction and Global Optimality

Masahito Hayashi, Ayanava Dasgupta, Naqueeb Ahmad Warsi

We study Haar-Bayesian prediction of one unmeasured copy of an unknown finite-dimensional pure quantum state after an arbitrary collective measurement on $n$ observed copies. Performance is evaluated by quantum relative entropy. For a fixed measurement, the Bayes predictive state is the posterior mean and the optimized conditional loss is its entropy. We then optimize the measurement over all POVMs on the symmetric subspace. For every nonzero positive effect $E$, the corresponding posterior predictive state is $μ_E=(I+nρ_E)/(n+d)$, where $ρ_E$ is the normalized one-particle marginal of $E$. Since a pure spectrum majorizes every density-operator spectrum, this identity gives an outcome-wise entropy lower bound. Coherent rank-one effects attain the bound, and their Haar orbit yields the highest-weight covariant POVM. Hence this POVM is globally Bayes optimal over all collective measurements and, by covariance, globally minimax. Its exact risk is $h_d((n+1)/(n+d))$, where $h_d(r)=-r\log r-(1-r)\log((1-r)/(d-1))$. The same arbitrary-effect reduction shows that the highest-weight POVM also maximizes the joint overlap between the latent pure state and its posterior predictive state, equivalently the mean posterior purity, with optimum $((n+1)^2+d-1)/(n+d)^2$.

quant-pharXiv:2609.10072•Sep 10, 2026•0 citations
In quantum estimation for a ddd-parameter family of density operators on a finite-dimensional Hilbert space H\mathcal{H}H, an estimator is specified by a pair (M,θ^)\left(M,\hatθ\right)(M,θ^), where MMM is a POVM with a finite outcome set ΩΩΩ and θ^:Ω→Rd\hatθ:Ω\to\mathbb{R}^{d}θ^:Ω→Rd is a classical estimator map. Since the number of outcomes ∣Ω∣\left|Ω\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 (dim⁡H)2+d(d+1)/2−1\left(\dim\mathcal{H}\right)^{2}+d(d+1)/2-1(dimH)2+d(d+1)/2−1 outcomes, and that the optimization can be restricted to rank-one measurements. For Bayesian estimation with a general loss function, we show that rank-one POVMs with at most (dim⁡H)2(\dim\mathcal{H})^{2}(dimH)2 outcomes are sufficient for the infimum value of the Bayes risk. Furthermore, when the model admits a real sufficient subalgebra, we show that the (dim⁡H)2\left(\dim\mathcal{H}\right)^{2}(dimH)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.
Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete) if the outcome probabilities determine any pure state up to a global phase. We study \emph{rank-one} POVMs that are minimally sufficient for this task. We call such a POVM \emph{vital} if it is PSI-Complete but every proper subcollection is not PSI-Complete. We prove sharp upper bounds on the size of vital rank-one POVMs in dimension nnn: the size is at most (n+12)\binom{n+1}{2}(2n+1​) over R\mathbb{R}R and at most n2n^{2}n2 over C\mathbb{C}C, and we give constructions that attain these bounds. In the real case, we further exhibit a connection to block designs: whenever w∣n(n−1)w \mid n(n-1)w∣n(n−1), an (n,w,w−1)(n,w,w-1)(n,w,w−1) design produces a vital rank-one POVM with n+n(n−1)/wn + n(n-1)/wn+n(n−1)/w outcomes. We provide explicit constructions for w=2,n−1w=2,n-1w=2,n−1, and nnn.
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.
We present a two-step protocol for quantum measurement tomography that is light on classical co-processing cost and still achieves optimal sample complexity. Given measurement data from a known probe state ensemble, we first apply least-squares estimation to produce an unconstrained approximation of the POVM, and then project this estimate onto the set of valid quantum measurements. For a POVM with L outcomes acting on a d -dimensional system, we show that the protocol requires O ( ( d 3 + d 2 L ) / ϵ 2 ) samples to achieve error ϵ in worst-case distance, and O ( d 2 L / ϵ 2 ) samples in average-case distance. We further establish two matching sample complexity lower bounds of Ω ( ( d 3 + d 2 L ) / ϵ 2 ) and Ω ( d 2 L / ϵ 2 ) for any non-adaptive, single-copy POVM tomography protocol. Hence, our projected least squares POVM tomography is sample-optimal in both the dimension and the number of outcomes for both distances. Our method admits an analytic form when using global or local 2-designs as probe ensembles and enables rigorous non-asymptotic error guarantees. Finally, we also complement our findings with empirical performance studies carried out on a noisy superconducting quantum computer with flux-tunable transmon qubits.
In recent years, informationally complete measurements have attracted considerable attention, especially in the context of classical shadows. In the particular case of informationally overcomplete measurements, for which the number of possible outcomes exceeds the dimension of the space of linear operators in Hilbert space, the dual positive operator-valued measure operators used to interpret the measurement outcomes are not uniquely defined. In this paper, we propose a method to optimize the dual operators after the measurements have been carried out in order to produce sharper, unbiased estimations of observables of interest. We discuss how this procedure can produce zero-variance estimations in cases where the classical shadows formalism, which relies on so-called canonical duals, incurs exponentially large measurement overheads. We also analyze the algorithm in the context of quantum simulation with randomized Pauli measurements, and show that it can significantly reduce statistical errors with respect to canonical duals on multiple observable estimations.
Bayesian weak commutativity is not sufficient for attaining the Bayesian Nagaoka–Hayashi bound. We construct an explicit two-parameter, finite-prior ensemble of four full-rank states in a four-dimensional Hilbert space and determine its exact minimum quadratic Bayes risk over all positive operator-valued measurements and estimators. The minimum lies strictly above the bound, and seven outcomes are necessary and sufficient to attain it. We also determine the exact optimum over all projective measurements on the original four-dimensional space. A population-normalization witness explains the obstruction and yields a risk gap of at least eta^2/16416 throughout a ladder family with shape parameter 0 <= u <= 1/3, population ratio 1 <= k <= 2, and contrast 0 < eta <= 1/6. On the oscillator slice u = 0, we obtain exact optimal risks and an attaining eight-outcome measurement throughout the stated k and eta ranges. Complete proofs, algebraic certificates, and exact-arithmetic verification code accompany the manuscript.
We study Haar-Bayesian prediction of one unmeasured copy of an unknown finite-dimensional pure quantum state after an arbitrary collective measurement on nnn observed copies. Performance is evaluated by quantum relative entropy. For a fixed measurement, the Bayes predictive state is the posterior mean and the optimized conditional loss is its entropy. We then optimize the measurement over all POVMs on the symmetric subspace. For every nonzero positive effect EEE, the corresponding posterior predictive state is μE=(I+nρE)/(n+d)μ_E=(I+nρ_E)/(n+d)μE​=(I+nρE​)/(n+d), where ρEρ_EρE​ is the normalized one-particle marginal of EEE. Since a pure spectrum majorizes every density-operator spectrum, this identity gives an outcome-wise entropy lower bound. Coherent rank-one effects attain the bound, and their Haar orbit yields the highest-weight covariant POVM. Hence this POVM is globally Bayes optimal over all collective measurements and, by covariance, globally minimax. Its exact risk is hd((n+1)/(n+d))h_d((n+1)/(n+d))hd​((n+1)/(n+d)), where hd(r)=−rlog⁡r−(1−r)log⁡((1−r)/(d−1))h_d(r)=-r\log r-(1-r)\log((1-r)/(d-1))hd​(r)=−rlogr−(1−r)log((1−r)/(d−1)). The same arbitrary-effect reduction shows that the highest-weight POVM also maximizes the joint overlap between the latent pure state and its posterior predictive state, equivalently the mean posterior purity, with optimum ((n+1)2+d−1)/(n+d)2((n+1)^2+d-1)/(n+d)^2((n+1)2+d−1)/(n+d)2.