Generalized Gleason theorem and finite amount of information for the context
A. Montina, S. Wolf

TL;DR
This paper generalizes Gleason's theorem to include finite information about measurement contexts, showing that probabilities in quantum measurements with three or more outcomes are linear functions of projectors under these conditions.
Contribution
It introduces a generalized Gleason theorem assuming local hypotheses and finite contextual information, extending the original theorem's conclusions.
Findings
Probabilities are linear functions of projectors with finite contextual information.
The generalized theorem holds under local hypotheses and relaxed density operator properties.
Finite information about measurement context constrains the form of quantum probabilities.
Abstract
Quantum processes cannot be reduced, in a nontrivial way, to classical processes without specifying the context in the description of a measurement procedure. This requirement is implied by the Kochen-Specker theorem in the outcome-deterministic case and, more generally, by the Gleason theorem. The latter establishes that there is only one non-contextual classical model compatible with quantum theory, the one that trivially identifies the quantum state with the classical state. However, this model requires a breaking of the unitary evolution to account for macroscopic realism. Thus, a causal classical model compatible with the unitary evolution of the quantum state is necessarily contextual at some extent. Inspired by well-known results in quantum communication complexity, we consider a particular class of hidden variable theories by assuming that the amount of information about the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
