Quantum computational advantage implies contextuality
Quantum Physics
2021-12-16 v2
Abstract
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum algorithms. Our result subsumes versions of Gottesman-Knill theorem as special cases.
Cite
@article{arxiv.2112.00024,
title = {Quantum computational advantage implies contextuality},
author = {Farid Shahandeh},
journal= {arXiv preprint arXiv:2112.00024},
year = {2021}
}
Comments
6 pages, minor changes incl. a brief comment on the single-qubit contextuality, references added, further comments are encouraged