REVIEW 3 cited by
Quantum computational advantage implies contextuality
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 3 Pith papers
-
Decoupling local classicality from classical explainability: A noncontextual model for bilocal classical theory and a locally-classical but contextual theory
Bilocal classical theory has a classical ontological model, but some locally-classical latent theories do not, so local classicality and classical explainability are logically independent.
-
Complexity of Contextuality
Deciding whether a COPE matrix has a noncontextual ontological model of dimension k is shown to lie between (nm)^Ω(r) and poly(b,m,n)^O(k^2), and a 5x5 example separates the minimal noncontextual ontic size (5) from t...
-
Linear Algebra of Generalized Contextuality in All Prepare-Transform-Measure Scenarios
A rank-based linear-algebra criterion and decision algorithm certify generalized (non)contextuality in prepare-transform-measure scenarios with any number of sequential transformations.
Discussion (0). Continue with ORCID to comment.