Related papers: Complexity of Satisfiability in Kochen-Specker Par…
The Kochen-Specker theorem, Bell inequalities, and several other tests that were designed to rule out hidden-variable theories, assume the existence of observables having infinitely sharp eigenvalues. A paradigmatic example is spin-1/2. It…
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…
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…
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…
A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…
The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…
As established by Sol\`er, Quantum Theories may be formulated in real, complex or quaternionic Hilbert spaces only. St\"uckelberg provided physical reasons for ruling out real Hilbert spaces relying on Heisenberg principle. Focusing on this…
It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators,…
A recent claim that finite precision in the design of real experiments ``nullifies'' the impact of the Kochen-Specker theorem, is shown to be unsupportable, because of the continuity of probabilities of measurement outcomes under slight…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
Formalizing an old desire of Einstein, "psi-epistemic theories" try to reproduce the predictions of quantum mechanics, while viewing quantum states as ordinary probability distributions over underlying objects called "ontic states."…
Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…
We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between…
Given the family $P$ of all nonempty subsets of a set $U$ of alternatives, a choice over $U$ is a function $c \colon \Omega \to P$ such that $\Omega \subseteq P$ and $c(B) \subseteq B$ for all menus $B \in \Omega$. A choice is total if…
The Kochen-Specker theorem rules out models of quantum theory wherein projective measurements are assigned outcomes deterministically and independently of context. This notion of noncontextuality is not applicable to experimental…
Quantum theory does not only predict probabilities, but also relative phases for any experiment, that involves measurements of an ensemble of systems at different moments of time. We argue, that any operational formulation of quantum theory…
For a two-particle two-state system, sets of compatible propositions exist for which quantum mechanics and noncontextual hidden-variable theories make conflicting predictions for every individual system whatever its quantum state. This…
Kent's conclusion that ``non-contextual hidden variable theories cannot be excluded by theoretical arguments of the Kochen-Specker type once the imprecision in real world experiments is taken into account'' [Phys. Rev. Lett. 83, 3755…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
In the recent literature of Artificial Intelligence, an intensive research effort has been spent, for various algebras of qualitative relations used in the representation of temporal and spatial knowledge, on the problem of classifying the…