Hidden Variable Model for Universal Quantum Computation with Magic States on Qubits
Michael Zurel, Cihan Okay, Robert Raussendorf
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.
Topics & Concepts
QubitQuantum computerComputationMAGIC (telescope)PhysicsProbabilistic logicQuantum mechanicsHidden variable theoryPhase spaceQuantumTheoretical physicsMathematical physicsStatistical physicsMathematicsComputer scienceAlgorithmArtificial intelligenceQuantum Mechanics and ApplicationsQuantum Information and CryptographyQuantum Computing Algorithms and Architecture