相关论文: Automated Generation of Arbitrarily Many Kochen-Sp…
Quantum contextuality turns out to be a necessary resource for universal quantum computation and also has applications in quantum communication. Thus it becomes important to generate contextual sets of arbitrary structure and complexity to…
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…
Recently, handling of contextual sets, in particular Kochen-Specker (KS) sets, in higher dimensions has been given an increasing attention, both theoretically and experimentally. However, methods of their generation are diverse, not…
Recently, quantum contextuality has been proved to be the source of quantum computation's power. That, together with multiple recent contextual experiments, prompts improving the methods of generation of contextual sets and finding their…
Quantum contextuality turns out to be a necessary resource for universal quantum computation and important in the field of quantum information processing. It is therefore of interest both for theoretical considerations and for experimental…
In Phys. Rev. Lett. 135, 190203 (2025) a discovery of the simplest 3D contextual set with 33 vertices, 50 bases, and 14 complete bases is claimed. In this paper, we show that it was previously generated in Quantum 7, 953 (2023) and analyze…
A Kochen-Specker (KS) set is a specific set of projectors and measurement contexts that prove the Bell-Kochen-Specker contextuality theorem. The simplest known KS sets in Hilbert space dimensions $d=3,4,5,6,8$ are reproduced, and several…
We give a method for exhaustive generation of a huge number of Kochen-Specker contextual sets, based on the 600-cell, for possible experiments and quantum gates. The method is complementary to our previous parity proof generation of these…
Quantum contextuality supports quantum computation and communication. One of its main vehicles is hypergraphs. The most elaborated are the Kochen-Specker ones, but there is also another class of contextual sets that are not of this kind.…
We give a constructive and exhaustive definition of Kochen-Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e.,…
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…
Contextuality is one of the fundamental deviations of quantum mechanics from classical physics. The Kochen-Specker (KS) theorem shows that non-contextual classical physics with hidden variables is inconsistent with the predictions of…
We show that all possible 388 4-dim Kochen-Specker (KS) (vector) sets (of yes-no questions) with 18 through 23 vectors and 844 sets with 24 vectors all with component values from \{-1,0,1\} can be obtained by stripping vectors off a single…
Kochen-Specker (KS) theorem denies the possibility for the noncontextual hidden variable theories to reproduce the predictions of quantum mechanics. A set of projection operators (projectors) and bases used to show the impossibility of…
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…
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 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…
Kochen-Specker (KS) sets are key tools for proving some fundamental results in quantum theory and also have potential applications in quantum information processing. However, so far, their intrinsic complexity has prevented experimentalists…
For the first time we construct an infinite family of Kochen-Specker sets in a space of fixed dimension, namely in R^4. While most of the previous constructions of Kochen-Specker sets have been based on computer search, our construction is…
Kochen-Specker (KS) vector systems are sets of vectors in R^3 with the property that it is impossible to assign 0s and 1s to the vectors in such a way that no two orthogonal vectors are assigned 0 and no three mutually orthogonal vectors…