pith. sign in

arxiv: 1210.0436 · v1 · pith:NQJ4SU52new · submitted 2012-10-01 · 🪐 quant-ph

Gleason, Kochen-Specker, and a competition that never was

classification 🪐 quant-ph
keywords hilbertinterestingknowspacetheoremscompetitioncubesdiscuss
0
0 comments X
read the original abstract

I review the two theorems referred to in the title, and then suggest that it would be interesting to know how much of Hilbert space one can use without forcing the proof of these theorems. It would also be interesting to know what parts of Hilbert space that are essential for the proofs. I go on to discuss cubes, graphs, and pentagrams.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.