Related papers: A SAT Solver and Computer Algebra Attack on the Mi…
Satisfiability (SAT) is a central problem in computer science, and advances in SAT-solving algorithms have a far-reaching impact across many fields. Recent works have proposed quantum SAT solvers based on Grover's algorithm, a quantum…
We put forward three simple algorithms to generate Kochen-Specker sets used for parity proof of Kochen-Specker theorem in three-qubit system. These algorithms enables us to generate 320, 640 and 64 Kochen-Specket sets with 36, 38 and 40…
As quantum contextuality proves to be a necessary resource for universal quantum computation, we present a general method for vector generation of Kochen-Specker (KS) contextual sets in the form of hypergraphs. The method supersedes all…
Development of quantum computation and communication, recently shown to be supported by contextuality, arguably asks for a requisite supply of contextual sets. While that has been achieved in even dimensional spaces, in odd dimensional…
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…
We show that (1) the violation of the Ekert 91 inequality is a sufficient condition for certification of the Kochen-Specker (KS) theorem, and (2) the violation of the Bennett-Brassard-Mermin 92 (BBM) inequality is, also, a sufficient…
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 (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…
Yu and Oh [1] have given a state independent proof of the Kochen-Specker theorem in three dimensions using only 13 rays. The proof consists of showing that a non-contextual hidden variable theory necessarily leads to an inequality that is…
We present a systematic, constructive analysis of Kochen-Specker contextuality, emphasizing the foundational importance of complete orthogonal bases (contexts). First, in three dimensions, we generate a complete inventory of 165 rays and…
Every set (finite or infinite) of quantum vectors (states) satisfies generalized orthoarguesian equations ($n$OA). We consider two 3-dim Kochen-Specker (KS) sets of vectors and show how each of them should be represented by means of a Hasse…
Algorithms for finding arbitrary sets of Kochen-Specker (KS) qunits (n-level systems) as well as all the remaining vectors in a space of an arbitrary dimension are presented. The algorithms are based on linear MMP diagrams which generate…
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…
Since the enlightening proofs of quantum contextuality first established by Kochen and Specker, and also by Bell, various simplified proofs have been constructed to exclude the non-contextual hidden variable theory of our nature at the…
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…
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.…
The set of 60 real rays in four dimensions derived from the vertices of a 600-cell is shown to possess numerous subsets of rays and bases that provide basis-critical parity proofs of the Bell-Kochen-Specker (BKS) theorem (a basis-critical…
The Kochen-Specker theorem states that noncontextual hidden variable models are inconsistent with the quantum predictions for every yes-no question on a qutrit, corresponding to every projector in three dimensions. It has been suggested [D.…
A generalized Kochen-Specker theorem is proved. It is shown that there exist sets of $n$ projection operators, representing $n$ yes-no questions about a quantum system, such that none of the $2^n$ possible answers is compatible with sum…
Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving has broad implications in many areas of computer science and beyond. Quantum SAT solvers have been proposed in…