arXiv:1210.0436 · AIP conference proceedings

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

Ingemar Bengtsson

Published Jan 1, 2012• 6 citations

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.

DOI: 10.1063/1.4773124

Related papers

The theorem of Gleason for nonseparable hilbert spaces

Manfred Eilers, Ernst Horst

International Journal of Theoretical PhysicsAug 1, 197554 citations

Revisiting Quantum Contextuality

Philippe Grangier

The purpose of this note is to complete the interesting review on quantum contextuality [1] that appeared recently. In particular we will introduce and discuss the ideas of extracontextuality and extravalence, that allow one to relate Kochen-Specker's and Gleason's theorems, and also to shift the emphasis from the first to the second one. We will also argue that whereas Kochen-Specker's is essentially a negative result (a no-go theorem), Gleason's is a positive one since it provides a mathematical justification of Born's rule. The link between these issues is provided by a specific quantum feature that we call extravalence.

arXiv:2201.00371Jan 2, 20220 citations

BELL'S VERSION OF GLEASON'S PROOF OF THE KOCHEN-SPECKER PARADOX

Elsevier eBooksJan 1, 19730 citations

Gadget structures in proofs of the Kochen-Specker theorem

Ravishankar Ramanathan, Monika Rosicka, Karol Horodecki +3 more

The Kochen-Specker theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We show that within every Kochen-Specker graph, there exist interesting subgraphs which we term 01 -gadgets, that capture the essential contradiction necessary to prove the Kochen-Specker theorem, i.e,. every Kochen-Specker graph contains a 01 -gadget and from every 01 -gadget one can construct a proof of the Kochen-Specker theorem. Moreover, we show that the 01 -gadgets form a fundamental primitive that can be used to formulate state-independent and state-dependent statistical Kochen-Specker arguments as well as to give simple constructive proofs of an ``extended'' Kochen-Specker theorem first considered by Pitowsky in \cite{Pitowsky}.

arXiv:1807.00113QuantumAug 14, 202018 citations

A Primer on Hilbert Space Theory

Carlo Alabiso, Ittay Weiss

UNITEXT for physicsOct 8, 20149 citations

How orthogonalities set Kochen-Specker sets

Kate Blanchfield

We look at generalisations of sets of vectors proving the Kochen-Specker theorem in 3 and 4 dimensions. It has been shown that two such sets, although unitarily inequivalent, are part of a larger 3-parameter family of vectors that share the same orthogonality graph. We find that these sets are unusual, in that the vectors in all other Kochen-Specker sets investigated here are fully determined by orthog-onality conditions and thus admit no free parameters. The Kochen-Specker (KS) theorem [1] is a statement about the fundamen-tal nature of quantum mechanics: no non-contextual hidden variable theory can reliably reproduce quantum mechanical predictions. The KS theorem states that in a Hilbert space with dimension n ≥ 3 it is impossible to assign definite values v ∈ {0, 1} to m projection operators Pm so that for every commuting set of projection operators satisfying Pm = I, the correspond-ing definite values obey v (Pm) = 1. The KS theorem is often visualised by means of a set of "uncolourable" vectors, where projection operators are represented by their constituent rays in Hilbert space and rays can be simplified to vectors as only directions are relevant here. The vectors are coloured according to their pre-assigned val-ues and the summation conditions above translate into colouring rules. This allows us to construct orthogonality graphs that, when uncolourable, pro-vide a contradiction within non-contextual hidden variable models and thus a proof of the KS theorem. Sets of vectors exemplifying the KS theorem have been discovered by nu-merous authors, with an aim to reduce the number of vectors required to reach a contradiction. Most notably, in a 3-dimensional Hilbert space, the original KS proof of 117 vectors has been replicated with sets using between 31 and 33 vectors [2, 3, 4, 5] and in a 4-dimensional Hilbert space, sets of between 24 and the lower limit of 18 vectors have been realised [2, 6, 7]. Additionally, an extensive computer search has recently revealed over one thousand of such KS sets in R4 [8]. In a publication by E. Gould and P. K. Aravind [10], two of these sets in 3 dimensions have been shown to share the same orthogonality graph. Specifically, the sets of 33 vectors found by Penrose [3] and Peres [2] have

Aug 14, 20161 citation