arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2512.05451quant-phcs.CC
收藏

对抗性环境下的阴影成像

Shadow Tomography Against Adversaries

Rice University(莱斯大学);Johns Hopkins University(约翰斯·霍普金斯大学);University Mohammed VI Polytechnic(穆罕默德六世polytechnic大学)

Maryam Aliakbarpour, Vladimir Braverman, Nai-Hui Chia, Chia-Ying Lin, Yuhan Liu, Aadil Oufkir, Yu-Ching Shen

AI总结:

本文提出了一种对抗性鲁棒环境下单次拷贝的阴影成像算法,通过改进的误差界和样本复杂度,实现了更高效的态成像。

摘要:

我们研究了在对抗性鲁棒环境下单次拷贝的阴影成像,目标是学习 $M$ 个可观测量 $O_1, \ldots, O_M$ 的期望值,精度为 $\varepsilon$,但 $\gamma$-分数的结果可以被对手任意破坏。我们证明,所有非适应性阴影成像算法必须产生误差 $\varepsilon=\tilde\Omega(\gamma\min\{\sqrt{M}, \sqrt{d}\})$,即使有无限次拷贝。不幸的是,[HKP20] 中的经典阴影算法和直接测量每个可观测量的朴素算法甚至更糟。我们设计了一个算法,其误差为 $\varepsilon=\tilde{O}(\gamma\max_{i\in[M]}\\|O_i\\|_{HS})$,这几乎匹配了我们对 $M\ge d$ 的最坏情况误差下限,并且在可观测量具有更强结构时保证更好的准确性。值得注意的是,该算法只需要 $n=\frac{1}{\gamma^2}\log(M/\delta)$ 次拷贝即可在概率至少 $1-\delta$ 的情况下达到该误差,与经典阴影算法在无被破坏测量结果时的样本复杂度相同。我们的算法在概念上简单且易于实现。经典模拟对于保真度估计显示,我们的算法在对抗性噪声下比 [HKP20] 具有更强的鲁棒性。最后,基于从全态成像到阴影成像的约简,我们证明对于秩为 $r$ 的状态,对于对抗性鲁棒态成像,可以实现近最优的渐近误差 $\varepsilon=\tilde{O}(\gamma\sqrt{r})$ 和拷贝复杂度 $\tilde{O}(dr^2/\varepsilon^2)=\tilde{O}(dr/\gamma^2)$,从而在 [ABCL25] 中闭合了巨大的差距,其中最优误差只能通过伪多项式数量的拷贝实现。

英文摘要:

We study single-copy shadow tomography in the adversarial robust setting, where the goal is to learn the expectation values of $M$ observables $O_1, \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=\tildeΩ(γ\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=\tilde{O}(γ\max_{i\in[M]}\|O_i\|_{HS})$, which nearly matches our worst-case error lower bound for $M\ge d$ and guarantees better accuracy when the observables have stronger structure. Remarkably, the algorithm only needs $n=\frac{1}{γ^2}\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=\tilde{O}(γ\sqrt{r})$ and copy complexity $\tilde{O}(dr^2/\varepsilon^2)=\tilde{O}(dr/γ^2)$ 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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑