On the Significance of the Gottesman–Knill Theorem
@article{Cuffaro2017OnTS,
title={On the Significance of the Gottesman–Knill Theorem},
author={Michael Cuffaro},
journal={The British Journal for the Philosophy of Science},
year={2017},
volume={68},
pages={91 - 121}
}According to the Gottesman–Knill theorem, quantum algorithms that utilize only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this article that this conclusion is misleading. First, the statement of the theorem (that the particular set of quantum… CONTINUE READING
Topics from this paper
6 Citations
Reconsidering No-Go Theorems from a Practical Perspective
- Mathematics, Computer Science
- The British Journal for the Philosophy of Science
- 2018
- 5
- PDF
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer
- Mathematics
- 2018
- 3
- PDF
Information Causality, the Tsirelson Bound, and the 'Being-Thus' of Things.
- Mathematics, Physics
- 2017
- 6
- PDF
References
SHOWING 1-10 OF 60 REFERENCES
On the role of entanglement in quantum-computational speed-up
- Mathematics, Physics
- Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
- 2003
- 455
- PDF
Speakable and Unspeakable in Quantum Mechanics: Bertlmann's socks and the nature of reality
- Physics
- 2004
- 18
- PDF
On the Physical Explanation for Quantum Computational Speedup (Thesis format: Monograph)
- Physics, Computer Science
- 2013
- 4
- PDF
The Deutsch–Jozsa problem: de-quantisation and entanglement
- Mathematics, Computer Science
- Natural Computing
- 2011
- 16
- PDF