Related papers: Complexity of Satisfiability in Kochen-Specker Par…
We study invariant pseudo-K\"ahler structures on a solvmanifold $G$ such that the Lie algebra $\mathfrak{g}$ is almost abelian, that is $\mathfrak{g}=\mathfrak{h}\rtimes\mathbb{R}$, with $\mathfrak{h}$ abelian; comparing with the…
In this talk I present a simple derivation of an old result of Kochen and Specker, which is apparently unrelated to the famous work of Bell on hidden variables, but is presumably equally important. Kochen and Specker showed in 1967 that…
We show that provided $n\ne 3$, the involutive Hopf *-algebra $A_u(n)$ coacting universally on an $n$-dimensional Hilbert space has enough finite-dimensional representations in the sense that every non-zero element acts non-trivially in…
The natural problem we approach in the present paper is to show how the notion of formally smooth (co)algebra inside monoidal categories can substitute that of (co)separable (co)algebra in the study of splitting bialgebra homomorphisms.…
We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product…
In this paper we analyze the structure of some subalgebras of quantized enveloping algebras corresponding to unipotent and solvable subgroups of a simple Lie group G. These algebras have the non--commutative structure of iterated algebras…
The question of a hidden variable interpretation of quantum contextuality in the Mermin-Peres square is considered. The Kochen-Specker theorem implies that quantum mechanics may be interpreted as a contextual hidden variable theory. It is…
Contextuality is a key distinguishing feature between classical and quantum physics. It expresses a fundamental obstruction to describing quantum theory using classical concepts. In turn, when understood as a resource for quantum…
A key ingredient of the Kochen-Specker theorem is the so-called functional composition principle, which asserts that hidden states must ascribe values to observables in a way that is consistent with all functional relations between them.…
We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is $I$ or $-I$; we call them constraints. In the first approach, one starts with a fixed…
In contrast to conventional, dynamical entanglement, in which particles with definite identity have uncertain properties, in so-called statistical entanglement, which arises between indistinguishable particles because of quantum symmetry…
We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…
We explore the relations between the Boolean Satisfiability Problem with $n$ Boolean variables and the orthogonal group $\mbox{O}(n)$. We show that all $2^n$ possible solutions induce involutions of $\mathbb{R}^n$ that lie in the compact,…
Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…
The fundamental algebraic concepts of quantum mechanics, as expressed by many authors, are reviewed and translated into the framework of the relatively new non-distributive system of Boolean fractions (also called conditional events or…
We study a noncanonical Hilbert space representation of the polymer quantum mechanics. It is shown that Heisenberg algebra get some modifications in the constructed setup from which a generalized uncertainty principle will naturally come…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and…
A standard approach in the foundations of quantum mechanics studies local realism and hidden variables models exclusively in terms of violations of Bell-like inequalities. Thus quantum nonlocality is tied to the celebrated no-go theorems,…
We refine the formulation of the Boolean satisfiability problem with $n$ Boolean variables in Clifford algebra ${\cal C}\ell(\mathbb{R}^{n,n})$ [3] and exploit this continuous setting to outline a new unsatisfiability test. This algorithm…