Oracle问题作为通信任务与量子算法的优化
Oracle problems as communication tasks and optimization of quantum algorithms
AI总结:
本文提出用互信息衡量量子算法性能,将Oracle问题转化为通信协议,并推导出非自适应算法的最优下界,为混合量子-经典方案提供理论优化基础。
摘要:
量子查询复杂度研究学习黑盒某些属性所需的查询次数。一个密切相关的问题是,算法仅使用固定数量的查询能多好地完成这一学习任务。在这项工作中,我们提出使用输出与实际值之间的互信息来衡量算法的性能。使用单个查询优化此互信息的任务类似于量子通信的基本任务,即试图最大化发送者和接收者的互信息。我们通过将算法分为两个代理,获得一个通信协议,使这一类比精确化。Oracle的目标属性扮演了Alice编码成量子态的消息的角色,随后该量子态被发送给Bob。算法的第一部分执行此编码,第二部分测量状态并旨在从结果中推断消息。此外,我们正式将Oracle视为一个独立的子系统,其状态记录未知的Oracle身份。在此构造中,Bob的最优测量基最小化了两个子系统之间的量子关联。我们还找到了互信息的一个下界,该下界与量子相干性相关。这些结果扩展到多查询非自适应算法。因此,对于任何Oracle分类问题,我们描述了使用最多固定数量查询的最优非自适应算法。关键的是,这种互信息视角对算法设计具有直接的实际效用,为优化混合量子-经典方案中的迭代子程序提供了理论基础。在本文中,我们应用这一框架来分析几个标准量子算法中的逐阶段信息流并跟踪部分进展。
英文摘要:
Quantum query complexity studies the number of queries needed to learn some property of a black box. A closely related question is how well an algorithm can succeed with this learning task using only a fixed number of queries. In this work, we propose measuring an algorithm's performance using the mutual information between the output and the actual value. The task of optimizing this mutual information using a single query, is similar to a basic task of quantum communication, where one attempts to maximize the mutual information of the sender and receiver. We make this analogy precise by splitting the algorithm between two agents, obtaining a communication protocol. The oracle's target property plays the role of a message that Alice encodes into a quantum state, which is subsequently sent over to Bob. The first part of the algorithm performs this encoding, and the second part measures the state and aims to deduce the message from the outcome. Moreover, we formally consider the oracle as a separate subsystem, whose state records the unknown oracle identity. Within this construction, Bob's optimal measurement basis minimizes the quantum correlations between the two subsystems. We also find a lower bound on the mutual information, which is related to quantum coherence. These results extend to multiple-query non-adaptive algorithms. As a result, we describe the optimal non-adaptive algorithm that uses at most a fixed number of queries, for any oracle classification problem. Crucially, this mutual-information perspective carries direct practical utility for algorithmic design, providing the theoretical foundation to optimize iterative subroutines in hybrid quantum--classical schemes. Within the present work, we apply this framework to analyze the stage-by-stage information flow and track partial progress in several standard quantum algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。