19

Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach

Senrui Chen
Weiyuan Gong
Sisi Zhou
Main:1 Pages
1 Figures
1 Tables
Appendix:66 Pages
Abstract

We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown dd-dimensional quantum state ρ\rho and a known set of observables {Oi}i=1m\{O_i\}_{i=1}^m, the goal is to estimate expectation values {tr(Oiρ)}i=1m\{\mathrm{tr}(O_i\rho)\}_{i=1}^m to accuracy ϵ\epsilon in LpL_p-norm, using possibly adaptive measurements that act on O(polylog(d))O(\mathrm{polylog}(d)) number of copies of ρ\rho at a time. We focus on the regime where ϵ\epsilon is below an instance-dependent threshold.Our main contribution is an instance-optimal characterization of the sample complexity as Θ~(Γp/ϵ2)\tilde{\Theta}(\Gamma_p/\epsilon^2), where Γp\Gamma_p is a function of {Oi}i=1m\{O_i\}_{i=1}^m defined via an optimization formula involving the inverse Fisher information matrix. Previously, tight bounds were known only in special cases, e.g. Pauli shadow tomography with LL_\infty-norm error. Concretely, we first analyze a simpler oblivious variant where the goal is to estimate an observable of the form i=1mαiOi\sum_{i=1}^m \alpha_i O_i with αq=1\|\alpha\|_q = 1 (where qq is dual to pp) revealed after the measurement. For single-copy measurements, we obtain a sample complexity of Θ(Γpob/ϵ2)\Theta(\Gamma^{\mathrm{ob}}_p/\epsilon^2). We then show Θ~(Γp/ϵ2)\tilde{\Theta}(\Gamma_p/\epsilon^2) is necessary and sufficient for the original problem, with the lower bound applying to unbiased, bounded estimators. Our upper bounds rely on a two-step algorithm combining coarse tomography with local estimation. Notably, Γob=Γ\Gamma^{\mathrm{ob}}_\infty = \Gamma_\infty. In both cases, allowing cc-copy measurements improves the sample complexity by at most Ω(1/c)\Omega(1/c).Our results establish a quantitative correspondence between quantum learning and metrology, unifying asymptotic metrological limits with finite-sample learning guarantees.

View on arXiv
Comments on this paper