Skip to content
Open access

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

Aug 2026 · Statistics & Probability Letters · Vol 241, pp. 110977 · 0 citations · 17 references
Physics Mathematics

Abstract

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_2d^2/\kappa_\nu$, the minimax mean-squared error is at least $c_1\log^2\{d^2/(\kappa_\nu n)\}$. For bounded frame spread and every fixed $0<a<2$, the minimax risk is of order $\log^2 d$ throughout $n\lesssim d^{2-a}$; hence fixed uniform accuracy requires $\Omega(d^2)$ observations. Existing tomography bounds give bounded risk from $O(d^3\log^3 d)$ observations for finite equal-weight exact designs and the Haar covariant measurement, while the intermediate minimax regime remains open. The results concern a fixed measurement repeated independently across copies; adaptive and collective protocols, and protocols that reuse common randomness across copies, are not covered.

Read PDF

Similar papers

Preprint Oct 2026

Tight Bounds on the Randomized Communication Complexity of Vector-in-Subspace

We prove that the randomized communication complexity of Vector-in-Subspace in $\mathbb R^n$ with error at most $1/3$ is $\Theta(\sqrt n)$. Alice holds a unit vector $u$ and Bob holds an $n/2$-dimensional subspace $H$; they must distinguish $u\in H$ from $u\in H^\perp$. An exact one-way quantum protocol uses $O(\log n)...

Chen-Gu Wang · 1 citation
Preprint Sep 2026

Optimal learning of covariant quantum states and channels

The collective tomography protocols for quantum states and channels with known symmetries are given, using random purification and dilation to reduce learning to pure-state estimation and resolve an open problem in quantum tomography of constructing efficient quantum circuits.

Satoshi Yoshida, K. Okigami, P. M. Posta et al. · 0 citations
Preprint Oct 2026

Optimal Lower Bound on the Sample Complexity of Coherent Classical Shadows for Mixed States

We study coherent classical shadows protocols for an unknown $d$-dimensional quantum state of rank at most $r$, allowing an arbitrary joint measurement on all available copies. For observables with operator norm at most one and centered squared Frobenius norm at most $F$, we study the minumum number of copies $T$ neede...

P. Svetlichnyy · 0 citations
Preprint Oct 2026

Sparse Hamiltonian simulation with optimal dependence on the maximum column Euclidean norm

We give a quantum algorithm for simulating a $d$-sparse Hermitian Hamiltonian $H$, assuming a known upper bound $\Lambda$ on its maximum column Euclidean norm $\|H\|_{1\to2}$. For $t\Lambda\ge1/2$, simulation with operator-norm error $\epsilon$ uses \[ O\!\left(t\Lambda\sqrt d+\sqrt d\log(2/\epsilon)\right) \] sparse-o...

Ze-Cheng Li, Chun-Hao Wang · 0 citations
Preprint Oct 2026

Improved Quantum Algorithms for R\'enyi Entropies Estimation

Entropy estimation of discrete probability distributions is a fundamental problem in statistical inference and quantum property estimation. In this paper, we study the problem of estimating R\'enyi entropy $H_\alpha(\mathbf{p})$ for any distribution $\mathbf{p} = (p_i)_{i=1}^n$ given its purified quantum query-access....

Zong-Xing Xiong, Chen Gao, Lvzhou Li · 0 citations
Preprint Sep 2026

A threshold for maximal Schmidt number from spectrum

The Schmidt number quantifies the dimensionality of entanglement in bipartite quantum states. We investigate when the spectrum of a state on $\mathbb{C}^d \otimes \mathbb{C}^d$ alone guarantees that its Schmidt number is not maximal. By deriving spectral bounds for $(d-1)$-block positive operators, we prove that $\math...

Jun-Hong An, Soojoon Lee · 0 citations

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