在没有独立同分布(I.I.D.)假设的情况下学习量子态的性质
Learning Properties of Quantum States Without the I.I.D. Assumption
AI总结:
提出超越 i.i.d. 假设的量子态性质学习框架,证明 i.i.d. 算法可改造以处理任意输入态,且非自适应单副本测量可将样本复杂度增加降至多对数级,并推广了经典阴影框架。
摘要:
我们开发了一个超越独立同分布(i.i.d.)输入态假设的量子态性质学习框架。我们证明,给定任何学习问题(在合理假设下),为 i.i.d. 输入态设计的算法都可以被改造以处理任意性质的输入态,代价是训练数据规模(即样本复杂度)呈多项式级增加。重要的是,如果所讨论的学习算法仅需要非自适应的单副本测量,这种样本复杂度的多项式级增加可以大幅改善为多对数级。在其他应用中,这使我们能够将经典阴影框架推广到非 i.i.d. 设置,同时仅在样本效率上产生相对较小的损失。我们使用严格的量子信息理论来证明我们的主要结果。具体而言,我们利用置换不变性和随机单副本测量推导出一个新的量子德菲内蒂定理,该定理主要处理测量结果统计,反过来在希尔伯特空间维度上具有更有利的扩展性。
英文摘要:
We develop a framework for learning properties of quantum states beyond the assumption of independent and identically distributed (i.i.d.) input states. We prove that, given any learning problem (under reasonable assumptions), an algorithm designed for i.i.d. input states can be adapted to handle input states of any nature, albeit at the expense of a polynomial increase in training data size (aka sample complexity). Importantly, this polynomial increase in sample complexity can be substantially improved to polylogarithmic if the learning algorithm in question only requires non-adaptive, single-copy measurements. Among other applications, this allows us to generalize the classical shadow framework to the non-i.i.d. setting while only incurring a comparatively small loss in sample efficiency. We use rigorous quantum information theory to prove our main results. In particular, we leverage permutation invariance and randomized single-copy measurements to derive a new quantum de Finetti theorem that mainly addresses measurement outcome statistics and, in turn, scales much more favorably in Hilbert space dimension.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。