A hidden variable model for universal quantum computation with magic states on qubits
MATHEMATICAL PICTURE LANGUAGE
Robert Raussendorf - University of British Columbia
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. Negativity in a quasiprobability function is not required, neither in states nor the operations. Our result is consistent with Gleason's Theorem and the PBR theorem. This is joint work with Michael Zurel and Cihan Okay; see arXiv:2004.01992.