Related papers: Complexity of Satisfiability in Kochen-Specker Par…
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
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…
The Kochen-Specker theorem is one of the fundamental no-go theorems in quantum theory. It has far-reaching consequences for all attempts trying to give an interpretation of the quantum formalism. In this work, we examine the hypotheses…
An essential ingredient in many examples of the conflict between quantum theory and noncontextual hidden variables (e.g., the proof of the Kochen-Specker theorem and Hardy's proof of Bell's theorem) is a set of atomic propositions about the…
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…
Pusey, Barrett, and Rudolph introduce a new no-go theorem for hidden-variables models of quantum theory. We make precise the class of models targeted and construct equivalent models that evade the theorem. The theorem requires assumptions…
Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier…
We show that a reduced form of the structural requirements for deterministic hidden variables used in Bell-Kochen-Specker theorems is already sufficient for the no-go results. Those requirements are captured by the following principle: an…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…
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…
Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise,…
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…
A very simple illustration of the Bell-Kochen-Specker contradiction is presented using continuous observables in infinite dimensional Hilbert space. It is shown that the assumption of the \emph{existence} of putative values for position and…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We introduce a logic modelling some aspects of the behaviour of the measurement process, in such a way that no direct mention of quantum states is made, thus avoiding the problems associated to this rather evasive notion. We then study some…
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…
The Kochen-Specker theorem theoretically shows evidence of the incompatibility of noncontextual hidden variable theories with quantum mechanics. Quantum contextuality is a more general concept than quantum non-locality which is quite well…
For a hidden variable theory to be indistinguishable from quantum theory for finite precision measurements, it is enough that its predictions agree for some measurement within the range of precision. Meyer has recently pointed out that the…
We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…
While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…