We show that every quantum computation can be described by a probabilistic update of a probability distribution on a finite phase space. Negativity in a quasiprobability function is not required in states or operations. Our result is consistent with Gleason’s theorem and the Pusey-Barrett-Rudolph theorem.
Joint work with: Michael Zurel and Cihan Okay
J-Ref: Phys. Rev. Lett. 125, 260404 (2020)
(Please note the earlier start time of 10:30 a.m. for this seminar.)
