Related papers: Proofs of the Kochen-Specker theorem based on a sy…
In a proof of knowledge (PoK), a verifier becomes convinced that a prover possesses privileged information. In combination with zero-knowledge proof systems, PoKs play an important role in security protocols such as in digital signatures…
Using the spontaneous parametric down-conversion process in a type-I phase matching BBO crystal as single photon source, we perform an all-or-nothing-type Kochen-Specker experiment proposed by Simon \QTR{it}{et al}. [Phys. Rev. Lett.…
In this paper we attempt to physically interpret the Modal Kochen- Specker (MKS) theorem. In order to do so, we analyze the features of the possible properties of quantum systems arising from the elements in an orthomodular lattice and…
We present a computational survey of Kochen-Specker (KS) uncolorability in three-dimensional Hilbert space across two-symbol coordinate alphabets $\mathcal{A} = \{0, \pm 1, \pm x\}$ drawn from quadratic, cyclotomic, and golden-ratio number…
Consequence-based reasoning can be used to construct proofs that explain entailments of description logic (DL) ontologies. In the literature, one can find multiple consequence-based calculi for reasoning in the $\mathcal{EL}$ family of DLs,…
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…
Most of the paradoxical, for the classical intuition, features of quantum theory were formulated for situations which involve a fixed number of particles. While one can now find a formulation of Bell's theorem for quantum fields, a…
In the paper, a value assignment for projection operators relating to a quantum system is equated with assignment of truth-values to the propositions associated with these operators. In consequence, the Kochen-Specker theorem (its localized…
It is shown that the restrictions of what can be inferred from classically-recorded observational outcomes that are imposed by the no-cloning theorem, the Kochen-Specker theorem and Bell's theorem also follow from restrictions on inferences…
We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access…
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…
We find a new highly symmetrical and very numerous class (millions of non-isomorphic sets) of 4-dim Kochen-Specker (KS) vector sets. Due to the nature of their geometrical symmetries, they cannot be obtained from previously known ones. We…
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…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…
A proof of Bell's theorem without inequalities and involving only two observers is given by suitably extending a proof of the Bell-Kochen-Specker theorem due to Mermin. This proof is generalized to obtain an inequality-free proof of Bell's…
It will be shown that Pascal's Theorem is equivalent to the associativity of a natural binary operation on conic sections. A novel proof for Pascal's Theorem will then be given by showing that this binary operation is associative…
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…
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…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial…
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…