AI 中文总结
本研究针对在线影子断层成像问题，提出匹配经典最优率的算法，改进了相关参数界限，关键在于基于量子Efron–Stein分解的测量后损伤量化框架。
AI 中文摘要
在线影子断层成像中，我们获得未知d维量子态ρ的副本，对手（自适应地）提出一系列有界可观测量A⁽¹⁾,…,A⁽ᵐ⁾，在给出每个A⁽ᵗ⁾后，我们必须估计Tr(A⁽ᵗ⁾ρ)，误差在±ε范围内。这是经典自适应数据分析问题的直接量子推广，离线情况（A⁽¹⁾,…,A⁽ᵐ⁾预先给出）也是研究充分的问题，核心目标是最小化所需副本数n。在线影子断层成像的先前结果在m、d、ε三个参数上均非最优，落后于已知的经典最优率。本研究最终缩小了这一差距，给出一对匹配经典率的算法：左侧界限首次实现o(log²m)依赖与poly(log(d)/ε)结合，甚至在离线影子断层成像设置中也改进了所有三个指数；右侧界限在与d无关的界限中被证明最优，比先前最佳结果提升了√m log m倍。证明的关键是基于量子Efron–Stein分解的新框架，用于量化测量后损伤。
英文摘要
In Online Shadow Tomography, we are given copies of an unknown $d$-dimensional quantum state $ρ$, an adversary (adaptively) proposes a sequence of bounded observables $A^{(1)},\ldots,A^{(m)}$, and after each $A^{(t)}$ is given we must estimate $\mathrm{Tr}(A^{(t)}ρ)$ to within $\pm ε$. This is the direct quantum generalization of the classical problem of Adaptive Data Analysis. Prior results for online Shadow Tomography were suboptimal in all three parameters $m, d, ε$, lagging behind the best known and classical rates, for which there is some evidence of optimality. In this work, we finally close this gap, giving a pair of algorithms matching the classical rates. Our first algorithm is the first to achieve $o(\log^2 m)$-dependence together with $\mathrm{poly}(\log(d)/ε)$; moreover, it improves all three exponents even in the Offline Shadow Tomography setting. Our second algorithm is known to be optimal among bounds independent of $d$, and improves the best prior result by a $\sqrt{m} \log m$ factor. The key to our proof is a new framework for quantifying post-measurement damage, based on the quantum Efron-Stein decomposition.
Comments26 pages. v2: Updated abstract formatting on arxiv
