Open AccessPosted Content
The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims.
Reads0
Chats0
TLDR
A computational complexity argument against the feasibility of quantum computers was described, which 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".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.read more
Citations
More filters
Journal ArticleDOI
Don't Reject This: Key-Recovery Timing Attacks Due to Rejection-Sampling in HQC and BIKE
TL;DR: This paper reveals that rejection sampling routines that are seeded with secret-dependent information and leak timing information result in practical key recovery attacks in the code-based key encapsulation mechanisms HQC and BIKE, and shows novel timing vulnerabilities in both schemes.
Posted Content
Statistical Aspects of the Quantum Supremacy Demonstration
TL;DR: The relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy are explained in terms that are accessible to statisticians, computer scientists, and mathematicians.
Proceedings ArticleDOI
A Post-Quantum Secure Subscription Concealed Identifier for 6G
TL;DR: A post-quantum secure scheme for the SUCI calculation scheme, \textttKEMSUCI, which exhibits faster execution speed and only little communication overhead, and evaluation of all of the NIST PQC finalists under these aspects and identifies Kyber and Saber as the best fit.
Journal ArticleDOI
Google's 2019 "Quantum Supremacy" Claims: Data, Documentation, and Discussion
TL;DR: In this article , the authors have been involved in a long-term project to study various statistical aspects of the Google experiment, and have been trying to gather the relevant data and information, to reconstruct and verify those parts of Google 2019 supremacy experiments that are based on classical computations (unless they require too heavy computation).
References
More filters
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
Journal ArticleDOI
Simulating physics with computers
TL;DR: In this paper, the authors describe the possibility of simulating physics in the classical approximation, a thing which is usually described by local differential equations, and the possibility that there is to be an exact simulation, that the computer will do exactly the same as nature.
Journal ArticleDOI
Supplementary information for "Quantum supremacy using a programmable superconducting processor"
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Alan Ho,Markus R. Hoffmann,Trent Huang,Travis S. Humble,Sergei V. Isakov,Evan Jeffrey,Zhang Jiang,Dvir Kafri,Kostyantyn Kechedzhi,Julian Kelly,Paul V. Klimov,Sergey Knysh,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,Erik Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt McEwen,Anthony Megrant,Xiao Mi,Kristel Michielsen,Masoud Mohseni,Josh Mutus,Ofer Naaman,Matthew Neeley,Charles Neill,Murphy Yuezhen Niu,Eric Ostby,Andre Petukhov,John Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis +76 more
TL;DR: In this paper, an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature, is presented.
Journal ArticleDOI
Scheme for reducing decoherence in quantum computer memory
TL;DR: In the mid-1990s, theorists devised methods to preserve the integrity of quantum bits\char22{}techniques that may become the key to practical quantum computing on a large scale.
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.