论文标题
反对量子计算机，自然量子法和Google的至高无上主张的论点
The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims
论文作者
论文摘要
我在新加坡ICA研讨会上的2018年演讲将量子计算作为计算定律和量子力学定律的汇合点。我们描述了针对量子计算机的可行性的计算复杂性参数：我们确定了由嘈杂的中等规模量子计算机描述的非常低的概率分布类别，并解释了为什么它既不能允许Quical量子误差纠正或量子级别的量子级别”的证明，而“量子至高无上”的能力，而对于量子计算机来说，计算机的能力是不可能的。我们继续描述了源于论证和提出的一般定律产生的一般预测，以表现出量子计算机的失败。 2019年10月，“自然”发表了一篇论文，描述了在Google上进行的实验性工作。本文声称，在53 Quitib的量子计算机上证明了量子（计算）至上的性能，因此显然挑战了我的理论。在本文中，我将从Google的至高无上主张的角度来解释和讨论我的工作。
My 2018 lecture at the ICA workshop in Singapore dealt with quantum computation as a meeting point of the laws of computation and the laws of quantum mechanics. We described a computational complexity argument against the feasibility of quantum computers: we identified a very low-level complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explained why it would allow neither good-quality quantum error-correction nor a demonstration of "quantum supremacy," namely, the ability of quantum computers to make computations that are impossible or extremely hard for classical computers. We went on to describe general predictions arising from the argument and proposed general laws that manifest the failure of quantum computers. In October 2019, "Nature" published a paper describing an experimental work that took place at Google. The paper claims to demonstrate quantum (computational) supremacy on a 53-qubit quantum computer, thus clearly challenging my theory. In this paper, I will explain and discuss my work in the perspective of Google's supremacy claims.
