Abstract
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.
- Received 14 May 2020
- Revised 3 November 2020
- Accepted 10 November 2020
DOI:https://doi.org/10.1103/PhysRevLett.125.260404
© 2020 American Physical Society