当前位置:
X-MOL 学术
›
Phys. Rev. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal universal programming of unitary gates
Physical Review Letters ( IF 8.6 ) Pub Date : Yuxiang Yang, Renato Renner, Giulio Chiribella
Physical Review Letters ( IF 8.6 ) Pub Date : Yuxiang Yang, Renato Renner, Giulio Chiribella
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, proving a fundamental 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.
中文翻译:
unit门的最佳通用编程
通用量子处理器是一种装置,其将包含任意unit门的编码的(量子)程序和应用了编码门的(量子)数据寄存器作为输入。尽管没有完美的通用量子处理器,但在过去的二十年中已经提出了近似的处理器。一个基本的开放性问题是最小量子程序的大小如何随近似误差缩放。在这里,我们回答这个问题,证明程序大小的基本界限,并设计一个具体的协议以达到渐近极限。我们的结果基于最优编程和量子计量的海森堡极限之间的联系,并在编程,学习和估计unit门之间建立了渐近等价关系。
更新日期:2020-09-18
中文翻译:
unit门的最佳通用编程
通用量子处理器是一种装置,其将包含任意unit门的编码的(量子)程序和应用了编码门的(量子)数据寄存器作为输入。尽管没有完美的通用量子处理器,但在过去的二十年中已经提出了近似的处理器。一个基本的开放性问题是最小量子程序的大小如何随近似误差缩放。在这里,我们回答这个问题,证明程序大小的基本界限,并设计一个具体的协议以达到渐近极限。我们的结果基于最优编程和量子计量的海森堡极限之间的联系,并在编程,学习和估计unit门之间建立了渐近等价关系。