On the Significance of the Gottesman–Knill Theorem

DOI10.1093/bjps/axv016zbMath1400.81069arXiv1310.0938OpenAlexW2102473962MaRDI QIDQ4554980

Michael E. Cuffaro

Publication date: 19 November 2018

Published in: The British Journal for the Philosophy of Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.0938

Mathematics Subject Classification ID

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

Related Items

What is quantum information? ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer