Skip to content
Preprint

Local and Global Risk Bounds for Quantum Entropy Estimation under Projective-Design Measurements

Aug 2026 · 0 citations · 31 references
Physics Mathematics

Abstract

We establish a lower bound for estimating the von Neumann entropy from independent outcomes of any fixed rank-one POVM. A rotation-averaged van Trees argument gives a global minimax risk of at least $(d/n)\log^2\{n/(4d)\}$ when $d\ge C$ and $n\ge Cd$, without a projective-design assumption. We also characterize risk on an operator-norm ball of radius $r$ around the maximally mixed state. We allow an approximate second moment: on the trace-zero Hermitian subspace, the measurement frame may differ by $\varepsilon<1$ from the tight projective frame. A clipped estimator based on canonical dual shadows and the complete U-statistic for purity has risk at most $d^3r^2/n+d^4/n^2+d^6r^6$. Lower bounds under the same frame control yield the local minimax rate $d^3r^2/n+d^4/n^2$ when $n\ge Cd^2$ and $r$ lies in an explicit matching range. For every fixed upper bound on $\varepsilon$, approximation changes only the constants, not the powers of $d,n,r$. At the critical radius $r=n^{-1/2}$, the local risk is asymptotically negligible relative to the global risk when $n\log^2(n/d)\gg d^3$. This separation holds for projective 2-designs, including global Clifford measurements in qubit dimensions, and for their uniformly well-conditioned frame approximations. Finite-sample experiments in dimension four illustrate the critical-radius benchmark and the effect of a nonexact frame.

View source

Similar papers

Open access Aug 2026

A frame-spread lower bound for quantum entropy estimation under fixed rank-one measurements

We study estimation of the von Neumann entropy of a $d$-dimensional quantum state from independent outcomes of a fixed rank-one measurement. Let $\kappa_\nu\in[1,d+1]$ denote the normalized trace-zero frame spread; $\kappa_\nu=1$ for exact complex projective $2$-designs. For any fixed rank-one measurement and $n\le c_2...

Xin-Yu Song · 0 citations
#machine learning Preprint Sep 2026

Tight Lower Bounds for State Tomography with Limited Entanglement

We study state tomography when each measurement acts on at most $k$ fresh copies and no quantum memory is retained between blocks. We prove a lower bound matching the upper bound in [arXiv:2510.07788]. Thus the copy complexity of estimating an arbitrary $d$-dimensional state to trace distance $\epsilon$ is, up to absol...

U. Keskin, Jason Luo, Mahbod Majid et al. · 3 citations · ⚡2
Preprint Aug 2026

Benign Projective Landscapes for Measured Quantum Divergences

We study nonconvex optimization of measured quantum $f$-divergences over rank-one projective measurements. For smoothly operator-Fenchel liftable generators and faithful states, every projective local maximum and every second-order stationary point is globally optimal over all POVMs. The criterion is blockwise: a criti...

Domingos S. P. Salazar · 0 citations
Preprint Aug 2026

Optimal von Neumann Entropy Estimation

We show that the von Neumann entropy of an unknown $d$-dimensional quantum state $\rho$ can be estimated to within additive error $\varepsilon$ using \[ \Theta\!\left(\frac{d^2}{\varepsilon\log^2(d)(1+\varepsilon\log^2(d))} + \frac{\log^2(d)}{\varepsilon^2}\right) \] samples of $\rho$, matching the lower bound due to W...

Zi-Yun Chen, Minbo Gao, Qisheng Wang · 4 citations · ⚡1
Preprint Sep 2026

Quantum de Finetti theorems for states and channels in any distance measure

Standard finite quantum de Finetti theorems approximate the $k$-system marginals of permutation-invariant states of $n$-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of oper...

Liu Ye, Bjarne Bergh, Nilanjana Datta · 1 citation
Preprint Sep 2026

Sharp pairwise reduction for quantum hypothesis testing

We determine the optimal universal coefficient in a reduction of multiple to binary quantum hypothesis testing. Specifically, for every finite ensemble in any Hilbert space dimension (finite or infinite), we prove that the error probability of the global pretty good measurement (PGM) is at most four times the sum of th...

Kuan-Yi Lee, Ludovico Lami · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.