发表机构
Seoul National University; Korea Advanced Institute of Science and Technology（首尔大学; 韩国科学技术院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本研究证明近似酉设计即使误差指数小也无法保证量子态学习性能，提出从电路结构直接推导保证，并证明对数深度Clifford电路可匹配全局Clifford方差，揭示浅层学习的局限。
AI 中文摘要
近似酉设计以给定的阶数和精度再现Haar随机酉算子的统计特性。最近的构造利用对数深度电路实现了此类设计，从而在保持性能的同时，为各种量子态学习任务提供了浅层测量协议。这些结果提出了一个问题：近似设计能否更普遍地替代精确设计。我们证明，即使指数级小的设计误差也未必能保留精确设计的学习保证。这促使我们直接从测量电路结构推导学习保证。对于经典阴影的观测量估计，我们证明对数深度的两层Clifford电路能够产生一个无偏估计器，其对每个量子态和Hermitian观测量均匹配全局Clifford方差缩放。超越观测量估计，这一界限使得浅层测量能够为其他任务保留全局Clifford保证，包括节省设置的层析成像、混合态计量学和稳定子结构学习。我们用逆阴影通道的紧凑、精确张量网络表示来补充这些统计保证。当测量基被复用时，任意高阶的近似酉设计在多次测量极限下未必能均匀匹配Haar方差。对于所考虑的全对全随机双局域电路，要做到这一点需要接近线性的深度。总之，我们的结果揭示了浅层量子态学习的能力和局限性，强调了近似Haar随机性与再现其学习保证之间的区别。
英文摘要
Approximate unitary designs reproduce the statistics of Haar-random unitaries to a given order and accuracy. Recent constructions realize such designs with logarithmic-depth circuits, enabling shallow measurement protocols for various quantum state-learning tasks while preserving performance. These results raise the question of whether approximate designs can replace exact designs more generally. We show that even exponentially small design error need not preserve the learning guarantees of exact designs. This motivates deriving learning guarantees directly from the measurement circuit structure. For observable estimation with classical shadows, we prove that logarithmic-depth two-layer Clifford circuits yield an unbiased estimator matching the global Clifford variance scaling for every state and Hermitian observable. Beyond observable estimation, this bound allows shallow measurements to retain global Clifford guarantees for other tasks, including setting-efficient tomography, mixed-state metrology, and stabilizer structure learning. We complement these statistical guarantees with a compact, exact tensor-network representation of the inverse shadow channel. When measurement bases are reused, approximate unitary designs of arbitrarily high order need not uniformly match the Haar variance in the many-shot limit. For the all-to-all random two-local circuits considered, doing so requires nearly linear depth. Together, our results reveal the capabilities and limitations of shallow quantum state learning, highlighting the distinction between approximating Haar randomness and reproducing its learning guarantees.
