The quantum computer puzzle

DOI10.1090/NOTI1380MaRDI QIDQ2952011zbMATH OpenOpenAlexFDO

Authors Gil Kalai

Publication date 29 December 2016

Published in Notices of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/noti1380

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General and philosophical questions in quantum theory (81P05) Open systems, reduced dynamics, master equations, decoherence (81S22)

Recommendations

• The argument against quantum computers
• The Limits of Quantum Computers
• Quantum computing: pro and con
• The road to quantum computational supremacy
• Quantum computing

Cited in

(7)

• Boolean functions: influence, threshold and noise
• Symplectic rigidity and quantum mechanics
• Rank of a tensor and quantum entanglement
• Global estimates of errors in quantum computation by the Feynman-Vernon formalism
• The argument against quantum computers
• Approximating permanents and hafnians
• On the classical complexity of sampling from quantum interference of indistinguishable bosons

This page was built for publication: The quantum computer puzzle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2952011)