Shadow Tomography Against Adversaries

We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of M observables O₁, ldots, O_M with varepsilon accuracy, but γ-fraction of the outcomes can be arbitrarily corrupted by an adversary. We show that all non-adaptive shadow tomography algorithms must incur an error of varepsilon=Ω\(γmin\{sqrt{M}, sqrt{d}\}\) for some choice of observables, even with unlimited copies. Unfortunately, the classical shadows algorithm by [HKP20] and naive algorithms that directly measure each observable suffer even more. We design an algorithm that achieves an error of varepsilon={O}\(γmax_iin[M]\|O_i\|_HS\), which nearly matches our worst-case error lower bound for Mge d and guarantees better accuracy when the observables have stronger structure. Remarkably, the algorithm only needs n=frac{1}{γ²}log(M/δ) copies to achieve that error with probability at least 1-δ, matching the sample complexity of the classical shadows algorithm that achieves the same error without corrupted measurement outcomes. Our algorithm is conceptually simple and easy to implement. Classical simulation for fidelity estimation shows that our algorithm enjoys much stronger robustness than [HKP20] under adversarial noise. Finally, based on a reduction from full-state tomography to shadow tomography, we prove that for rank r states, both the near-optimal asymptotic error of varepsilon={O}\(γsqrt{r}\) and copy complexity {O}\(dr²/varepsilon²\)={O}\(dr/γ²\) can be achieved for adversarially robust state tomography, closing the large gap in [ABCL25] where optimal error can only be achieved using pseudo-polynomial number of copies in d.