Related papers: New Kochen-Specker Sets in Four Dimensions
We present a search for small Kochen-Specker (KS) sets in dimension 3, specifically targeting extensions of the 13-ray Yu-Oh set, which has been proven to be the minimal witness to state-independent contextuality. To enable this search, we…
Only finite precision measurements are experimentally reasonable, and they cannot distinguish a dense subset from its closure. We show that the rational vectors, which are dense in S^2, can be colored so that the contradiction with hidden…
In [1] we proved a strengthened Kochen-Specker theorem in 3 dimensions: non-contextual hidden variable (NCHV) models cannot reproduce all the quantum correlations of two compatible observables, which is a minimal requirement imposed on the…
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…
A recent proposal to experimentally test quantum mechanics against noncontextual hidden-variable theories [Phys. Rev. Lett. 80, 1797 (1998)] is shown to be related with the smallest proof of the Kochen-Specker theorem currently known [Phys.…
We discuss two new demonstrations of the Bell-Kochen-Specker theorem: a state-independent proof using 14 four-dimensional propositions, based on a suggestion made by Clifton, and a state-specific proof involving 5 propositions on the…
We show a kernel of at most $13k$ vertices for the Planar Feedback Vertex Set problem restricted to planar graphs, i.e., a polynomial-time algorithm that transforms an input instance $(G,k)$ to an equivalent instance with at most $13k$…
The Kochen-Specker (KS) theorem is a cornerstone result in quantum foundations, establishing that quantum correlations in Hilbert spaces of dimension $d \geq 3$ cannot be explained by (consistent) hidden variable theories that assign a…
Mermin's simple "pentagram" proof of the Kochen-Specker theorem is examined from various perspectives. We emphasise the many mathematical structures intimately related to Kochen-Specker proofs, ranging through functional analysis, sheaf…
We describe an approach for unsupervised learning of a generic, distributed sentence encoder. Using the continuity of text from books, we train an encoder-decoder model that tries to reconstruct the surrounding sentences of an encoded…
We intend to generate low-dimensional explicit distributional semantic vectors. In explicit semantic vectors, each dimension corresponds to a word, so word vectors are interpretable. In this research, we propose a new approach to obtain…
The Kochen-Specker (KS) theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We present state-independent non-contextuality inequalities with large violations, in particular, we…
We identify targets in the Kepler field that may be characterized by transit timing variations (TTVs) and are detectable by the Transiting Exoplanet Survey Satellite (TESS). Despite the reduced signal-to-noise ratio of TESS transits…
Automatic measuring of speaker sincerity degree is a novel research problem in computational paralinguistics. This paper proposes covariance-based feature vectors to model speech and ensembles of support vector regressors to estimate the…
In the paper it is argued that the Kochen-Specker theorem necessitates a conclusion that for a quantum system it is possible to find a set of projection operators which is not truth-value bivalent; that is, a bivalent truth-value assignment…
Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper, we consider the following very basic recovery question:…
The Kochen-Specker theorem proves the inability to assign, simultaneously, noncontextual definite values to all (of a finite set of) quantum mechanical observables in a consistent manner. If one assumes that any definite values behave…
For positive integers $n$ and $k$ such that $k$ is at most $n$, we find an explicit one-to-one correspondence between the following two sets: the set of words consisting of $k$ $R$s, $k$ $U$s, and $n - k$ $D$s, where the first letter of the…
Recently Waegell and Aravind [J. Phys. A: Math. Theor. 45 (2012), 405301, 13 pages] have given a number of distinct sets of three-qubit observables, each furnishing a proof of the Kochen-Specker theorem. Here it is demonstrated that two of…
Aims. We present our re-analyze the Kepler photometric dataset, searching for planetary transits using an alternative processing pipeline to the one used by the Kepler Mission. Methods. The SARS pipeline was tested extensively by processing…