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$.
Demonstrating and Benchmarking Classical Shadows for Lindblad Tomography
Center for Quantum Devices, Niels Bohr Institute, University of Copenhagen(哥本哈根大学尼尔斯·玻尔研究所量子设备中心);Center for the Mathematics of Quantum Theory, MATH Department, University of Copenhagen(哥本哈根大学数学系量子理论数学中心);NNF Quantum Computing Programme, Niels Bohr Institute, University of Copenhagen(哥本哈根大学尼尔斯·玻尔研究所NNF量子计算项目);Department of Microtechnology and Nanoscience, Chalmers University of Technology(查尔姆斯理工大学微技术和纳米科学系)
Fermionic-Adapted Shadow Tomography for dynamical correlation functions
School of Computational Sciences, Korea Institute for Advanced Study(韩国高等科学研究院计算科学学院);Materials Science Division, Argonne National Laboratory(阿贡国家实验室材料科学部);Department of Physics, University of Illinois at Chicago(伊利诺伊大学芝加哥分校物理系)
Classical Shadow Tomography with Locally Scrambled Quantum Dynamics
University of California San Diego(加州大学圣迭戈分校);Harvard University(哈佛大学);University of California, Berkeley(加州大学伯克利分校);Massachusetts Institute of Technology(麻省理工学院)
Continuous-variable designs and design-based shadow tomography from random lattices
École Polytechnique Fédérale de Lausanne (EPFL)(洛桑联邦理工学院);Joint Quantum Institute, NIST/University of Maryland(美国国家标准与技术研究院/马里兰大学联合量子研究所);Joint Center for Quantum Information and Computer Science, NIST/University of Maryland(美国国家标准与技术研究院/马里兰大学联合量子信息与计算科学中心);Freie Universität Berlin(柏林自由大学)
Designing Shadow Tomography Protocols by Natural Language Processing
College of Physics, Sichuan University(四川大学物理学院);Fudan University(复旦大学);Hefei National Laboratory(合肥国家实验室);Tongji University(同济大学);International Quantum Academy(国际量子科学院);University of California at San Diego(加州大学圣地亚哥分校)
Classical optimisation of reduced density matrix estimations with classical shadows using N-representability conditions under shot noise considerations
Shadow tomography for classical tensor network simulations
Marcus Center for Theoretical Chemistry, California Institute of Technology(加州理工学院马库斯理论化学中心);Division of Chemistry and Chemical Engineering, California Institute of Technology(加州理工学院化学与化学工程系)
Fermionic partial tomography via classical shadows
我们提出了一个层析协议,用于估计任何$ k $体约化密度矩阵($ k $ -RDM)的$ n $模式的费米子态,一个普遍存在的步骤,在近期的量子算法模拟多体物理,化学和材料。我们的方法扩展了经典阴影的框架,一种学习量子态性质集合的随机方法,到费米子环境。我们的采样协议使用随机测量设置所产生的离散组的费米子高斯幺正,实现与线性深度电路。我们证明,估计所有的$ k $ -RDM元素添加剂精度$ \varepsilon $需要的顺序上的$ \binom{n}{k} k^{3/2} \log(n) / \varepsilon^2 $重复状态的准备,这是最佳的对数因子。此外,数值计算表明,我们的协议提供了一个实质性的改进,在恒定的开销为$ k \geq 2 $,相比以前的确定性策略。我们还调整我们的方法,粒子数对称,其中额外的电路深度可以减半的成本大约2-5倍多的重复。