Contextuality, the PBR theorem and their effects on simulation of quantum systems

          @misc{ pirsa_PIRSA:17070051,
            doi = {10.48660/17070051},
            url = {https://pirsa.org/17070051},
            author = {Karanjai, Angela},
            keywords = {Quantum Foundations, Quantum Information},
            language = {en},
            title = {Contextuality, the PBR theorem and their effects on simulation of quantum systems},
            publisher = {Perimeter Institute},
            year = {2017},
            month = {jul},
            note = {PIRSA:17070051 see, \url{https://pirsa.org}}
          }
          

Abstract

This talk will be about constraints on any model which reproduces the qubit stabilizer sub-theory. We show that the minimum number of classical bits required to specify the state of an n-qubit system must scale as ~ n(n-3)/2 in any model that does not contradict the predictions of the quantum stabilizer sub-theory. The Gottesman-Knill algorithm, which is a strong simulation algorithm is in fact, very close to this bound as it scales at ~n(2n+1). This is a result of state-independent contextuality which puts a lower bound on the minimum number of states a model requires in order to reproduce the statistics of the qubit stabilizer sub-theory.