Related papers: New Kochen-Specker Sets in Four Dimensions
We introduce a method to identify speakers by computing with high-dimensional random vectors. Its strengths are simplicity and speed. With only 1.02k active parameters and a 128-minute pass through the training data we achieve Top-1 and…
We investigate the possibility of constructing Kochen-Specker uncolorable sets of idempotent matrices whose entries lie in various rings, including the rational numbers, the integers, and finite fields. Most notably, we show that there is…
It has recently been questioned whether the Kochen-Specker theorem is relevant to real experiments, which by necessity only have finite precision. We give an affirmative answer to this question by showing how to derive hidden-variable…
In [1] it was shown that the Kochen Specker theorem can be written in terms of the non-existence of global elements of a certain varying set over the partially ordered set of boolean subalgebras of projection operators on some Hilbert…
We present Backpacks: a new neural architecture that marries strong modeling performance with an interface for interpretability and control. Backpacks learn multiple non-contextual sense vectors for each word in a vocabulary, and represent…
There is rising interest in vector-space word embeddings and their use in NLP, especially given recent methods for their fast estimation at very large scale. Nearly all this work, however, assumes a single vector per word type ignoring…
We investigate small geometric configurations that furnish observable-based proofs of the Kochen-Specker theorem. Assuming that each context consists of the same number of observables and each observable is shared by two contexts, it is…
Using a graph approach to quantum systems, we prove that descriptions of 3-dim Kochen-Specker (KS) setups as well as descriptions of 3-dim spin systems by means of Greechie lattices that we find in the literature are wrong. Correct lattices…
A range of recent works addresses the problem of compression of sequence of tokens into a shorter sequence of real-valued vectors to be used as inputs instead of token embeddings or key-value cache. These approaches are focused on reduction…
Representing meaning in the form of high dimensional vectors is a common and powerful tool in biologically inspired architectures. While the meaning of a set of concepts can be summarized by taking a (possibly weighted) sum of their…
We show that for all integers $2\le s\le t$, any $K_{s,t}$-free subset of $[N]$ with size $\Omega(n^{1-1/s})$ must contain a nontrivial solution to every fixed translation-invariant linear equation in at least five variables. This extends…
The Kochen-Specker theorem is a basic and fundamental 50 year old non-existence result affecting the foundations of quantum mechanix, strongly implying the lack of any meaningful notion of "quantum realism", and typically leading to…
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…
Quantum cryptographic protocols based on complementarity are nonsecure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without…
Recent research shows that deep neural networks (DNNs) can be used to extract deep speaker vectors (d-vectors) that preserve speaker characteristics and can be used in speaker verification. This new method has been tested on text-dependent…
The Kochen-Specker Theorem is widely interpreted to imply that non-contextual hidden variable theories that agree with the predictions of Copenhagen quantum mechanics are impossible. The import of the theorem for a novel observer…
We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to…
The Bell-Kochen-Specker conditions (BKS) for a deterministic noncontextual hidden-variable model are wonderfully simple to state, deal with just one-dimensional projectors on a Hilbert space H and make no reference to a probabilistic phase…
This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we…
The main object of this paper is to determine the maximum number of $\{0,\pm 1\}$-vectors subject to the following condition. All vectors have length $n$, exactly $k$ of the coordinates are $+1$ and one is $-1$, $n \geq 2k$. Moreover, there…