Skepticism of quantum computing

DOI10.1017/CBO9780511979309.016zbMath1353.68003OpenAlexW2278391851MaRDI QIDQ4897689

Scott Aaronson

Publication date: 27 December 2012

Published in: Quantum Computing since Democritus (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9780511979309.016

zbMATH Keywords

quantum computingcomplexity theoryproofsphilosophy of mind

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Philosophy of mathematics (00A30) History of quantum theory (81-03) General and philosophical questions in quantum theory (81P05) Quantum computation (81P68) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) History of computer science (68-03) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Quantum interactive proofs and the complexity of separability testing ⋮ Computational complexity of the landscape. II: Cosmological considerations ⋮ Quantum machine learning: a classical perspective ⋮ Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device ⋮ Introduction to multiplicative group on 2-qubits in quantum color image processing ⋮ Interference as a computational resource: a tutorial ⋮ The dependence of computability on numerical notations ⋮ Quantum error-correcting codes and their geometries ⋮ A complex-valued gradient flow for the entangled bipartite low rank approximation ⋮ Decoherence and the ultraviolet cutoff: non-Markovian dissipative dynamics of a charged particle in a magnetic field ⋮ Cryptographic group actions and applications ⋮ Why and whence the Hilbert space in quantum theory? ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ Signal-based classical emulation of a universal quantum computer ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Theory of Quantum Computation and Philosophy of Mathematics. Part II ⋮ Mathematics of topological quantum computing ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer ⋮ Quantum-like influence diagrams for decision-making ⋮ Event-based quantum mechanics: a context for the emergence of classical information ⋮ Quantum computing: survey and analysis ⋮ Spooky predictions at a distance: reality, complementarity and contextuality in quantum theory ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Statistical quality assessment of Ising-based annealer outputs ⋮ The information geometry of two-field functional integrals ⋮ Low-rank approximation to entangled multipartite quantum systems ⋮ Rank-1 approximation for entangled multipartite real systems ⋮ Quantum Mathematics in Artificial Intelligence