Related papers: On Simplest Kochen-Specker Sets
Kochen-Specker theorems assure the breakdown of certain types of non-contextual hidden variable theories through the non-existence of global, holistic frame functions; alas they do not allow us to identify where this breakdown occurs, nor…
In "Object generators, relaxed sets, and a foundation for mathematics", we introduced ``object generators'', a logical environment much more general than set theory. Inside this we found a `relaxed' version of set theory. That paper is…
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,…
Contextuality is a fundamental property of quantum mechanics. Contrary to entanglement, which can only exist in composite systems, contextuality is also present for single entities. The case of a three-level system is of particular interest…
Knowledge Graphs (KGs) are foundational structures in many AI applications, representing entities and their interrelations through triples. However, triple-based KGs lack the contextual information of relational knowledge, like temporal…
The Kochen-Specker theorem states that noncontextual hidden variable theories are incompatible with quantum mechanics. We provide a state independent proof of the Kochen-Specker theorem using the smallest number of projectors, i.e., thirty…
The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is non-contextual and consistent with quantum mechanics. If we require…
It has been recently shown that state-independent contextuality (SIC) is a fundamental resource linked with a type of nonlocality which cannot be improved by nonsignaling resources. Therefore, it is of fundamental importance to identify the…
Hidden variables theories for quantum mechanics are usually assumed to satisfy the KS condition. The Bell-Kochen-Specker theorem then shows that these theories are necessarily contextual. But the KS condition can be criticized from an…
The Kochen-Specker theorem states that exclusive and complete deterministic outcome assignments are impossible for certain sets of measurements, called Kochen-Specker (KS) sets. A straightforward consequence is that KS sets do not have…
Kochen-Specker theorem rules out the non-contextual assignment of values to physical magnitudes. Here we enrich the usual orthomodular structure of quantum mechanical propositions with modal operators. This enlargement allows to refer…
In this article we present a new prepare and measure quantum key distribution protocol that uses an experimentally accessible measure of single qubit contextuality to warranty the security of the quantum channel. The definition of…
In the paper it is shown that the Kochen-Specker theorem follows from Burnside's theorem on noncommutative algebras. Accordingly, contextuality (as an impossibility of assigning binary values to projection operators independently of their…
Bell-Kochen-Specker theorem states that a non-contextual hidden-variable theory cannot completely reproduce the predictions of quantum mechanics. Asher Peres gave a remarkably simple proof of quantum contextuality in a four-dimensional…
A set of quantum measurements exhibits quantum contextuality when any consistent value assignment to the measurement outcomes leads to a contradiction with quantum theory. In the original Kochen-Specker-type of argument the measurement…
Meyer recently queried whether non-contextual hidden variable models can, despite the Kochen-Specker theorem, simulate the predictions of quantum mechanics to within any fixed finite experimental precision. Clifton and Kent have presented…
How many words (and which ones) are sufficient to define all other words? When dictionaries are analyzed as directed graphs with links from defining words to defined words, they reveal a latent structure. Recursively removing all words that…
A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…
We consider algebras underlying Hilbert spaces used by quantum information algorithms. We show how one can arrive at equations on such algebras which define n-dimensional Hilbert space subspaces which in turn can simulate quantum systems on…
Existing dialog datasets contain a sequence of utterances and responses without any explicit background knowledge associated with them. This has resulted in the development of models which treat conversation as a sequence-to-sequence…