Computational complexity, step by step

DOI10.1126/SCIENCE.AAU9555MaRDI QIDQ5218669zbMATH OpenOpenAlexWikidataFDO

Authors Ashley Montanaro

Publication date 4 March 2020

Published in Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1126/science.aau9555

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 1497858
• One complexity theorist's view of quantum computing
• Classical simulation and complexity of quantum computations (invited talk)
• Theory and Applications of Models of Computation
• The road to quantum computational supremacy

Cited in

(3)

• The road to quantum computational supremacy
• Multilinear formulas and skepticism of quantum computing
• scientific article; zbMATH DE number 5064406 (Why is no real title available?)

This page was built for publication: Computational complexity, step by step

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