The Argument Against Quantum Computers

DOI10.1007/978-3-030-34316-3_18zbMath1499.81032arXiv1908.02499OpenAlexW2965556692MaRDI QIDQ5119671

Gil Kalai

Publication date: 31 August 2020

Published in: Jerusalem Studies in Philosophy and History of Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.02499

zbMATH Keywords

quantum computationquantum error-correctionphysical Church-Turing thesisnoise sensitivity and stability

Mathematics Subject Classification ID

General and philosophical questions in quantum theory (81P05) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4

Cites Work

• Unnamed Item
• Unnamed Item
• Correlation polytopes: Their geometry and complexity
• Symplectic geometry of quantum noise
• The Quantum Computer Puzzle
• A counterexample to Borsuk’s conjecture
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Resilient quantum computation: error models and thresholds
• Quantum computing: pro and con
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Error Correcting Codes in Quantum Theory
• THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES
• Mathematics and Computation
• R(4, 5) = 25
• Noise sensitivity of Boolean functions and applications to percolation

This page was built for publication: The Argument Against Quantum Computers