Cargando…
The Argument Against Quantum Computers
<!--HTML--><p>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...
Autor principal: | Kalai, Gil |
---|---|
Lenguaje: | eng |
Publicado: |
2019
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2687556 |
Ejemplares similares
-
Quantum Computing and the Limits of the Efficiently Computable
por: Aaronson, Scott
Publicado: (2015) -
Current Challenges for Quantum Computing
por: DiVincenzo, David
Publicado: (2021) -
Quantum Computational Supremacy and Its Applications
por: Aaronson , Scott
Publicado: (2020) -
D-Wave's Approach to Quantum Computing: 1000-qubits and Counting!
por: Williams, Colin
Publicado: (2017) -
Quantum Information and the Foundations of Quantum Physics
por: Renner, Renato
Publicado: (2019)