在线学习多种量子对象
Online learning of a panoply of quantum objects
AI总结:
本文提出了一种在线学习多种量子对象的方法,通过正则化跟随领导者算法证明了子线性遗憾界,适用于学习量子态、效应、通道等多种量子对象。
摘要:
在许多量子任务中,存在一个未知的量子对象,人们希望对其进行学习。为此任务的一种在线策略涉及自适应地改进假设以重现此类对象或其测量统计。此类策略的常见评估指标是其遗憾值,或大致假设统计中的累积误差。我们证明了通过正则化跟随领导者算法,在一般的正定矩阵子集上学习的子线性遗憾界,并将其应用于各种希望学习量子对象的场景。对于具体应用,我们为学习量子态、效应、通道、交互测量、策略、共策略以及纯态内积的集合给出了子线性遗憾界。我们的界适用于许多具有紧致、凸表示的其他量子对象。在证明我们的遗憾界时,我们建立了若干有用的矩阵分析结果,用于量子信息理论。这包括对任意正定算子(可能具有不同迹)的皮纳克不等式一般化,这可能对独立兴趣并适用于更一般的发散类别的应用。
英文摘要:
In many quantum tasks, there is an unknown quantum object that one wishes to learn. An online strategy for this task involves adaptively refining a hypothesis to reproduce such an object or its measurement statistics. A common evaluation metric for such a strategy is its regret, or roughly the accumulated errors in hypothesis statistics. We prove a sublinear regret bound for learning over general subsets of positive semidefinite matrices via the regularized-follow-the-leader algorithm and apply it to various settings where one wishes to learn quantum objects. For concrete applications, we present a sublinear regret bound for learning quantum states, effects, channels, interactive measurements, strategies, co-strategies, and the collection of inner products of pure states. Our bound applies to many other quantum objects with compact, convex representations. In proving our regret bound, we establish various matrix analysis results useful in quantum information theory. This includes a generalization of Pinsker's inequality for arbitrary positive semidefinite operators with possibly different traces, which may be of independent interest and applicable to more general classes of divergences.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。