AI 中文总结
该研究针对从全局经典阴影估计迹多项式的问题，对比批处理与完全U统计量的方差特性，推导相关恒等式与风险界，经蒙特卡洛实验验证了二阶公式。
AI 中文摘要
我们研究从全局经典阴影估计迹多项式$\boldsymbol{\text{tr}}\boldsymbol{\text{tr}} p(P\rho P)$，其中$\rho$是未知量子态，$P$是固定投影算子。不相交批处理与完全U统计量会得到相同迹矩的无偏估计量，但它们在Hoeffding分解中对退化项赋予不同的样本量因子。在全局Clifford协议下，精确的二阶方差公式表明，在秩为$s$的零投影块上，批处理下二次退化项的阶为$s^2/N$，完全对称化下则为$s^2/N^2$。对于熵近似所用的对数阶多项式，在经典熵截止处，二次系数使批处理方差至少提升至$s^2N\boldsymbol{\text{log}}^2N$阶。对于完全U统计量，我们推导了跨阶协方差恒等式和多项式估计量的精确方差分解，还在固定阶下对每个Hoeffding阶进行了界约束，得到了小谱熵泛函的增长维数风险界。高阶界保留了对环境维数的多项式依赖，因此不覆盖对数增长的阶。蒙特卡洛实验验证了二阶公式，精确计算阐明了熵风险。
英文摘要
We study estimation of the trace polynomial $\operatorname{tr} p(PρP)$ from global classical shadows, where $ρ$ is an unknown quantum state and $P$ is a fixed projector. Disjoint batching and complete U-statistics yield unbiased estimators of the same trace moments, but assign different sample-size factors to the degenerate terms in their Hoeffding decompositions. Under the global Clifford protocol, exact degree-two variance formulas show that, on a null projected block of rank $s$, the quadratic degenerate term has order $s^2/N$ under batching and $s^2/N^2$ under complete symmetrization. For a logarithmic-degree polynomial used in entropy approximation, the quadratic coefficient raises the batched variance to at least order $s^2N\log^2N$ at the classical entropy cutoff. For complete U-statistics, we derive a cross-degree covariance identity and an exact variance decomposition for polynomial estimators. We also bound every Hoeffding order at a fixed degree and obtain a growing-dimensional risk bound for a small-spectrum entropy functional. The higher-order bounds retain a polynomial dependence on the ambient dimension and therefore do not cover logarithmically increasing degrees. Monte Carlo experiments confirm the degree-two formulas, and exact calculations illustrate the entropy risks.
CommentsMain paper: 13 pages, 3 tables, no figures; supplementary material: 10 pages
