论Gottesman-Knill定理的意义
On the Significance of the Gottesman-Knill Theorem
摘要:
根据Gottesman-Knill定理,只使用属于某个限制集的操作的量子算法是有效的经典模拟。由于这个集合中的一些操作会产生纠缠态,因此通常认为纠缠不足以使量子计算机超越经典计算机。在本文中,我认为这一结论是误导性的。首先,当我们在讨论计算机器的背景下考虑贝尔不等式和相关不等式时,经过反思,定理的陈述(所讨论的特定量子运算集可以用经典计算机模拟)已经很明显了。这反过来又帮助我们理解,从Gottesman-Knill定理得出的适当结论并不是纠缠不足以实现量子性能优势,而是如果我们将自己限制在Gottesman-Knill定理中提到的操作中,我们将无法充分利用纠缠量子系统提供的资源。
英文摘要:
According to the Gottesman-Knill theorem, quantum algorithms which utilise only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this paper that this conclusion is misleading. First, the statement of the theorem (that the particular set of quantum operations in question can be simulated using a classical computer) is, on reflection, already evident when we consider Bell's and related inequalities in the context of a discussion of computational machines. This, in turn, helps us to understand that the appropriate conclusion to draw from the Gottesman-Knill theorem is not that entanglement is insufficient to enable a quantum performance advantage, but rather that if we limit ourselves to the operations referred to in the Gottesman-Knill theorem, we will not have used the resources provided by an entangled quantum system to their full potential.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。