论文标题
统一大门的最佳通用编程
Optimal universal programming of unitary gates
论文作者
论文摘要
通用量子处理器是一种设备，该设备将输入A（量子）程序（包含任意单位门编码）和（量子）数据寄存器进行编码，并应用了编码门的（量子）数据寄存器。尽管不存在完美的通用量子处理器，但在过去的二十年中，已经提出了近似处理器。一个基本的开放问题是最小量子程序的大小如何具有近似误差。在这里，我们通过证明对程序的大小进行界限并设计了达到渐近限制界限的具体协议来回答这个问题。我们的结果是基于最佳编程与海森堡量子计量限制之间的联系，并在编程，学习和估算单一门的任务之间建立了渐近等效性。
A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Our result is based on a connection between optimal programming and the Heisenberg limit of quantum metrology, and establishes an asymptotic equivalence between the tasks of programming, learning, and estimating unitary gates.
