Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

What Makes Quantum Computing So Hard to Explain?

Scott Aaronson

Published Jan 1, 2023• 5 citations
Publisher
DOI
10.1007/978-3-662-67495-6_42

Related papers

Making Hard Problems for Quantum Computers

Anonymous

Physics•Jul 14, 2016•0 citations

Why is it hard to build quantum computers?

Salini Karuvade

Futurum Careers•Jan 1, 2024•0 citations

Quantum computing: promises, achievements and challenges

Thomas Ayral

Quantum computers regularly make the headlines, with optimistic claims (often issued by companies large and small) alternating with pessimistic rebuttals (often by academic labs): sometimes they supposedly solve outstanding hard computational problems, sometimes their performances are dwarfed by classical machines. The goal of this article is to shed light on this back-and-forth, and explain what quantum computing could really be useful for.

Photoniques•Jan 1, 2025•1 citation

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

Gil Kalai

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.

arXiv:2008.05188•Aug 12, 2020•19 citations

Essentials for Deeper Understanding of Quantum Computing

Ryo Maezono

Springer eBooks•Jan 1, 2025•0 citations

BASICS OF QUANTUM COMPUTING

Dr. Anand Kumar Pandey, Mrs. Rashmi Pandey

•Apr 27, 2023•1 citation
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.