The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims

Abstract

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.

33 pages 2 Figures. To appear in: The Intercontinental Academia, Laws: 'Rigidity and Dynamics,' (M. J. Hannon and E. Z. Rabinovici (ed.)) Proceedings of the ICA Workshops 2018\&2019, Singapore and Birmingham, World Scientific. version 2: Added section on recent developments and some minor changes

References in corpus (9)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Classical Simulation of Quantum Supremacy Circuits
• Physics in 100 Years
• Simulating the Sycamore quantum supremacy circuits
• Gaussian Noise Sensitivity and BosonSampling
• On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking
• The Quantum Computer Puzzle (Expanded Version)
• Marginal probabilities in boson samplers with arbitrary input states