发表机构
IQM Quantum Computers（IQM量子计算机公司）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
介绍基于酉信道概率混合的量子算法框架，可将厄米算符多项式应用于任意态，支持样本与查询复杂度灵活权衡，结合低量子电路复杂度，能从含噪声中等规模无缝扩展到容错量子计算。
AI 中文摘要
我们引入了一个基于酉信道概率混合的量子算法框架，类似于量子奇异值变换框架，能将厄米算符的任意多项式应用于任意初始态。我们表明该框架支持样本复杂度和查询复杂度之间的灵活权衡，范围从最优查询复杂度（即误差对数级）、指数增长的样本复杂度到误差的亚多项式查询复杂度和多项式样本复杂度。与具有酉块编码线性组合的量子奇异值变换相比，结合更低的量子电路复杂度，我们认为该框架可从含噪声中等规模量子计算无缝扩展到容错量子计算。
英文摘要
We introduce a quantum algorithmic framework based on probabilistic mixtures of unitary channels that, similar to the framework of quantum singular value transformations, enables the application of arbitrary polynomials of hermitian operators onto arbitrary initial states. We show that our framework supports a flexible tradeoff between sample- and query complexity ranging from optimal query complexity, meaning logarithmic in the error, and exponentially scaling sample complexity to sub-polynomial query complexity in the error and polynomial sample complexity. Combined with the considerably lower quantum circuit complexity, compared to quantum singular value transformations with a linear combination of unitaries block encoding, we argue that our framework can be seamlessly scaled from NISQ to fault-tolerant quantum computing.
