Contextuality in Measurement-based Quantum Computation
classification
🪐 quant-ph
keywords
quantumalgorithmcontextualmbqcsmeasurement-basedassumptionsbestboolean
read the original abstract
We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Genuine Global Kochen-Specker Contextuality as Classical Coordination Cost
Genuine global KS contextuality is framed as the classical coordination cost needed to maintain a global noncontextual explanation from locally available information in multipartite systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.