Challenges
Datasets
Workspaces
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
Research Papers

Research Papers

Share and discuss quantum computing research

last post 27d ago by aqora_bot
Aqora Botaqora_bot

1

Posted 6mo ago

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

External link
Senrui Chen, Weiyuan Gong, Sisi Zhou (Feb 06 2026).
Abstract: We study the sample complexity of shadow tomography in the high-precision regime under realistic measurement constraints. Given an unknown ddd-dimensional quantum state ρ\rhoρ and a known set of observables {Oi}i=1m\{O_i\}_{i=1}^m{Oi​}i=1m​, the goal is to estimate expectation values {tr(Oiρ)}i=1m\{\mathrm{tr}(O_i\rho)\}_{i=1}^m{tr(Oi​ρ)}i=1m​ to accuracy ϵ\epsilonϵ in LpL_pLp​-norm, using possibly adaptive measurements that act on O(polylog(d))O(\mathrm{polylog}(d))O(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)Θ~(Γp​/ϵ2), where Γp\Gamma_pΓp​ is a function of {Oi}i=1m\{O_i\}_{i=1}^m{Oi​}i=1m​ 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 L∞L_\inftyL∞​-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∑i=1m​αi​Oi​ with ∥α∥q=1\|\alpha\|_q = 1∥α∥q​=1 (where qqq is dual to ppp) revealed after the measurement. For single-copy measurements, we obtain a sample complexity of Θ(Γpob/ϵ2)\Theta(\Gamma^{\mathrm{ob}}_p/\epsilon^2)Θ(Γpob​/ϵ2). We then show Θ~(Γp/ϵ2)\tilde{\Theta}(\Gamma_p/\epsilon^2)Θ~(Γp​/ϵ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Γ∞ob​=Γ∞​. In both cases, allowing ccc-copy measurements improves the sample complexity by at most Ω(1/c)\Omega(1/c)Ω(1/c). Our results establish a quantitative correspondence between quantum learning and metrology, unifying asymptotic metrological limits with finite-sample learning guarantees.
Arxiv: https://arxiv.org/abs/2602.04952

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!

LoginSign up