The Argument against Quantum Computers

@article{Kalai2019TheAA,
  title={The Argument against Quantum Computers},
  author={Gil Kalai},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.02499}
}
  • G. Kalai
  • Published 7 August 2019
  • Physics
  • ArXiv
We give a computational complexity argument against the feasibility of quantum computers. We identify a very low complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explain why it will allow neither good-quality quantum error-correction nor a demonstration of “quantum supremacy.” Some general principles governing the behavior of noisy quantum systems are derived. Our work supports the “physical Church thesis” studied by Pitowsky (lyuun… 
View PDF on arXiv
17 Citations
Highly Influential Citations
1
Background Citations
12
Methods Citations
1

17 Citations

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

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".

Quantum Computers, Predictability, and Free Will

: This article focuses on the connection between the possibility of quantum computers, the predictability of complex quantum systems in nature, and the issue of free will. The author’s theory, that…

Are quantum cryptographic security claims vacuous

A central claim in quantum cryptography is that secrecy can be proved rigorously, based on the assumption that the relevant information-processing systems obey the laws of quantum physics. This claim…

Concerns About Recent Claims of a Huge Quantum Computational Advantage via Gaussian Boson Sampling ∗

A polynomial-time algorithm from the 2014 paper [15] that may achieve similar or better sampling quality for the statistical methods of [28] is pointed out, based on taking a truncated Fourier–Hermite expansion on the Boson Sampling distribution.

Conjecture C Still Stands

More than ten years ago the author described a parameter K ( ρ ) for the complexity of n -qubit quantum state ρ and raised the conjecture (referred to as “Conjecture C”) that when this parameter is…

Quantum Stabilizer Channel for Thermalization

We study the problem of quantum thermalization from a very recent perspective: via discrete interactions with thermalized systems. We thus extend the previously introduced scattering thermalization…

Google's Quantum Supremacy Claim: Data, Documentation, and Discussion

This document describes the available data and information for the Google experiment, some main questions in the evaluation of the experiment, and some of the results and plans.

Learning classical readout quantum PUFs based on single-qubit gates

This work formalizes the class of classical readout quantum PUFs (CR-QPUFs) using the statistical query (SQ) model and explicitly shows insufficient security for CR-Q PUFs based on single-qubit rotation gates, when the adversary has SQ access to the CR-ZPUF.

Quantum Error Correction

  • T. Brun
  • Computer Science, Physics
    Oxford Research Encyclopedia of Physics
  • 2020
In quantum computation, error correction is just one component of fault-tolerant design; other approaches to error mitigation in quantum systems include decoherence-free subspaces, noiseless subsystems, and dynamical decoupling.

Synergies Between Operations Research and Quantum Information Science

This article highlights synergies between quantum information science (QIS) and operations research for QIS-curious operations researchers (and vice versa), and the author challenges the community to…

References

SHOWING 1-10 OF 33 REFERENCES

The Quantum Computer Puzzle

: Quantum computers are hypothetical devices, based on quantum physics, which would enable us to perform certain computations (among them some that Chaim Leib Pekeris pioneered) hundreds of orders of…

The Quantum Computer Puzzle (Expanded Version)

Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature…

Quantum computing: pro and con

  • J. Preskill
  • Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
The potential of quantum computation is assessed, some of the known quantum algorithms and the prospects for finding new ones are reviewed, and the specifications that should be met by future hardware are commented on.

Resilient quantum computation: error models and thresholds

  • E. KnillR. LaflammeW. Zurek
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and…

Efficient classical simulation of noisy quantum computation

It is proved that under general conditions most of the quantum circuits at any constant level of noise per gate can be efficiently simulated classically with the cost increasing only polynomially with the size of the circuits.

Quantum theory, the Church–Turing principle and the universal quantum computer

  • D. Deutsch
  • Physics, Philosophy
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible…

Sufficient condition on noise correlations for scalable quantum computing

It is shown that Arbitrarily long quantum computations can be executed reliably provided that noise terms acting collectively on k system qubits are sufficiently weak and decay sufficiently rapidly with increasing k and with increasing spatial separation of the qubits.

Achieving quantum supremacy with sparse and noisy commuting quantum computations

It is shown that purely classical error-correction techniques can be used to design IQP circuits which remain hard to simulate classically, even in the presence of arbitrary amounts of noise of this form.

The computational complexity of linear optics

A model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to count the number of photons in each mode is defined, giving new evidence that quantum computers cannot be efficiently simulated by classical computers.

Realization of Shor's Algorithm at Room Temperature

A realization of Shor's algorithm, that does not need any of the simplifications presently needed in current experiments and also gives smaller systematic errors than any former experimental implementation, which gives further insight to the resources needed for quantum computation.