arXiv Analytics

Sign in

arXiv:1802.07744 [quant-ph]AbstractReferencesReviewsResources

Contextuality bounds the efficiency of classical simulation of quantum processes

Angela Karanjai, Joel J. Wallman, Stephen D. Bartlett

Published 2018-02-21Version 1

Contextuality has been conjectured to be a super-classical resource for quantum computation, analogous to the role of non-locality as a super-classical resource for communication. We show that the presence of contextuality places a lower bound on the amount of classical memory required to simulate any quantum sub-theory, thereby establishing a quantitative connection between contextuality and classical simulability. We apply our result to the qubit stabilizer sub-theory, where the presence of state-independent contextuality has been an obstacle in establishing contextuality as a quantum computational resource. We find that the presence of contextuality in this sub-theory demands that the minimum number of classical bits of memory required to simulate a multi-qubit system must scale quadratically in the number of qubits; notably, this is the same scaling as the Gottesman-Knill algorithm. We contrast this result with the (non-contextual) qudit case, where linear scaling is possible.

Comments: 6 pages, comments welcome
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2008.12250 [quant-ph] (Published 2020-08-27)
Efficient benchmarking and classical simulation of quantum processes in the Weyl basis
arXiv:1108.3853 [quant-ph] (Published 2011-08-18)
Beating the efficiency of both quantum and classical simulations with semiclassics
arXiv:quant-ph/0611277 (Published 2006-11-28, updated 2007-03-21)
Efficiency in Quantum Key Distribution Protocols with Entangled Gaussian States