Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Compendium of Quantum Physics

Kochen—Specker Theorem

Carsten Held

Published Jan 1, 2009• 17 citations
Publisher
DOI
10.1007/978-3-540-70626-7_104

Related papers

Kochen-Specker Theorem

Cecilia Flori

Lecture notes in physics•Jan 1, 2013•18 citations

The Kochen-Specker Theorem

Guillermo Morales Luna

•Jan 1, 2007•41 citations

A remark on the Kochen-Specker Theorem

Andrew Lenard

Springer eBooks•Jan 1, 1974•4 citations

The Kochen-Specker theorem and Bell's theorem: An algebraic approach

Jose Luis Cereceda

Foundations of Physics•Jun 1, 1995•9 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.00113•Quantum•Aug 14, 2020•18 citations

The Kochen-Specker and Conway-Kochen Theorems

Ahmed Barbar

This essay provides an analysis of two important theorems that arise in the context of quantum mechanics: the Kochen-Specker theorem, which challenges the existence of hidden variable theories; and the Conway-Kochen (free will) theorem, which can be seen as an improvement over the Kochen-Specker theorem, but instead focuses on challenging determinism.

•May 5, 2017•0 citations
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}.