Skepticism of quantum computing
DOI10.1017/CBO9780511979309.016zbMATH Open1353.68003OpenAlexW2278391851MaRDI QIDQ4897689FDOQ4897689
Authors: 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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Randomized algorithms (68W20) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) History of computer science (68-03) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) General and philosophical questions in quantum theory (81P05) Philosophy of mathematics (00A30) History of quantum theory (81-03) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cited In (31)
- Quantum computing: survey and analysis
- Statistical quality assessment of Ising-based annealer outputs
- The information geometry of two-field functional integrals
- Rank-1 approximation for entangled multipartite real systems
- Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
- Decoherence and the ultraviolet cutoff: non-Markovian dissipative dynamics of a charged particle in a magnetic field
- Coming of age with quantum information. Notes on a Paulian idea. With a foreword of N. David Mermin
- The dependence of computability on numerical notations
- Signal-based classical emulation of a universal quantum computer
- Quantum Mathematics in Artificial Intelligence
- Transformations of probability distributions
- Quantum error-correcting codes and their geometries
- Introduction to multiplicative group on 2-qubits in quantum color image processing
- An introduction to quantum computing for statisticians and data scientists
- Universality, invariance, and the foundations of computational complexity in the light of the quantum computer
- Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
- Quantum machine learning: a classical perspective
- Quantum-like influence diagrams for decision-making
- Interference as a computational resource: a tutorial
- Cryptographic group actions and applications
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Low-rank approximation to entangled multipartite quantum systems
- Event-based quantum mechanics: a context for the emergence of classical information
- Why and whence the Hilbert space in quantum theory?
- Computational complexity of the landscape. II: Cosmological considerations
- Mathematics of topological quantum computing
- A structured view on weighted counting with relations to counting, quantum computation and applications
- Spooky predictions at a distance: reality, complementarity and contextuality in quantum theory
- Theory of quantum computation and philosophy of mathematics. II
- A complex-valued gradient flow for the entangled bipartite low rank approximation
- Quantum interactive proofs and the complexity of separability testing
This page was built for publication: Skepticism of quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897689)
