arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2410.16635quant-phcond-mat.quant-gas
收藏

基于局域随机测量的纯态认证样本涨落界限

Bounding the Sample Fluctuation for Pure States Certification with Local Random Measurement

Langxuan Chen, Pengfei Zhang

AI总结:

本文研究基于随机局域Haar测量的纯态认证方案,推导出与具体估计器无关的样本涨落界限,揭示算符复杂度与量子算法效率的内在关系,并指出长程纠缠纯态局域认证的根本障碍。

摘要:

量子科学与技术的重大突破要求更高效地分析量子多体态。该领域的一个重大挑战是验证实验室中量子设备制备的量子态是否准确匹配所需的目标纯态。随机测量技术的最新进展为该领域提供了新的见解。具体而言,经典阴影层析和阴影重叠等协议已被提出。在这些进展的基础上,我们研究了通过随机局域 Haar 测量认证纯量子态方案的基本性质。我们推导出适用于任意特定估计器构造的样本涨落界限。这些界限依赖于用于估计保真度的可观测量的算符尺寸分布,或任意可观测量的约化密度矩阵的有效变化。我们的结果揭示了算符复杂性与量子算法效率之间的内在相互作用,这构成了对具有长程纠缠的纯态进行局域认证的障碍。

英文摘要:

Remarkable breakthroughs in quantum science and technology are demanding for more efficient methods in analyzing quantum many-body states. A significant challenge in this field is to verify whether a quantum state prepared by quantum devices in the lab accurately matches the desired target pure state. Recent advancements in randomized measurement techniques have provided fresh insights in this area. Specifically, protocols such as classical shadow tomography and shadow overlap have been proposed. Building on these developments, we investigate the fundamental properties of schemes that certify pure quantum states through random local Haar measurements. We derive bounds for sample fluctuations that are applicable regardless of the specific estimator construction. These bounds depend on the operator size distribution of either the observable used to estimate fidelity or the valid variation of the reduced density matrix for arbitrary observables. Our results unveil the intrinsic interplay between operator complexity and the efficiency of quantum algorithms, serving as an obstacle to local certification of pure states with long-range entanglement.

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

↑