Contextuality bounds the efficiency of classical simulation of quantum processes

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.

[1]  T. Fritz,et al.  A Combinatorial Approach to Nonlocality and Contextuality , 2012, Communications in Mathematical Physics.

[2]  M. Kleinmann,et al.  Memory cost for simulating all quantum correlations from the Peres–Mermin scenario , 2016, 1611.07515.

[3]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[4]  R. Raussendorf.  Quantum computation, discreteness, and contextuality , 2009 .

[5]  R. Raussendorf,et al.  S , 2017, Quantum Inf. Comput..

[6]  David Gosset,et al.  Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates. , 2016, Physical review letters.

[7]  Joel J. Wallman,et al.  Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities. , 2015, Physical review letters.

[8]  Dan E Browne,et al.  Contextuality as a Resource for Models of Quantum Computation with Qubits. , 2016, Physical review letters.

[9]  Stephen D. Bartlett,et al.  From estimation of quantum probabilities to simulation of quantum circuits , 2017, Quantum.

[10]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[11]  Richard Jozsa,et al.  Classical simulation complexity of extended Clifford circuits , 2013, Quantum Inf. Comput..

[12]  M. Leifer.  ψ-Epistemic models are exponentially bad at explaining the distinguishability of quantum states. , 2014, Physical review letters.

[13]  Raymond Lal,et al.  No ψ-epistemic model can fully explain the indistinguishability of quantum states. , 2013, Physical review letters.

[14]  Mermin Nd.  Simple unified form for the major no-hidden-variables theorems. , 1990 .

[15]  J. Bell.  On the Problem of Hidden Variables in Quantum Mechanics , 1966 .

[16]  Asher Peres,et al.  Two simple proofs of the Kochen-Specker theorem , 1991 .

[17]  Scott Aaronson,et al.  Representing probabilistic data via ontological models , 2007, 0709.1149.

[18]  Matthew F Pusey,et al.  On the reality of the quantum state , 2011, Nature Physics.

[19]  Robert W. Spekkens,et al.  Reconstruction of Gaussian quantum mechanics from Liouville mechanics with an epistemic restriction , 2011, 1111.5057.

[20]  E. Specker,et al.  The Problem of Hidden Variables in Quantum Mechanics , 1967 .

[21]  R. Raussendorf,et al.  Wigner Function Negativity and Contextuality in Quantum Computation on Rebits , 2014, 1409.5170.

[22]  Scott Aaronson,et al.  The computational complexity of linear optics , 2010, STOC '11.

[23]  D. Browne,et al.  Computational power of correlations. , 2008, Physical review letters.

[24]  Nicolas Delfosse,et al.  Contextuality and Wigner-function negativity in qubit quantum computation , 2015, 1511.08506.

[25]  R. Spekkens.  Contextuality for preparations, transformations, and unsharp measurements , 2004, quant-ph/0406166.

[26]  Otfried Guhne,et al.  Memory cost of quantum contextuality , 2010, 1007.3650.

[27]  Dax Enshan Koh,et al.  Further extensions of Clifford circuits and their classical simulation complexities , 2015, Quantum Inf. Comput..

[28]  J. Emerson,et al.  Corrigendum: Negative quasi-probability as a resource for quantum computation , 2012, 1201.1256.

[29]  A. Winter,et al.  Graph-theoretic approach to quantum correlations. , 2014, Physical review letters.

[30]  R. Jozsa,et al.  Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[31]  P. K. Aravind,et al.  Proofs of the Kochen-Specker theorem based on the N-qubit Pauli group , 2013, 1302.4801.

[32]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[33]  Victor Veitch,et al.  Contextuality Supplies the Magic for Quantum Computation , 2015, 2015 IEEE International Symposium on Multiple-Valued Logic.

[34]  R. Jozsa,et al.  Matchgates and classical simulation of quantum circuits , 2008, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[35]  Samson Abramsky,et al.  The sheaf-theoretic structure of non-locality and contextuality , 2011, 1102.0264.

[36]  M. Leifer,et al.  Maximally epistemic interpretations of the quantum state and contextuality. , 2012, Physical review letters.