Abstract: 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., vectors in n-dim Hilbert space, H^n, n>3 to which it is impossible to assign 1s and 0s in such a way that no two mutually orthogonal vectors from the set are both assigned 1 and that not all mutually orthogonal vectors are assigned 0. Our constructive definition of such KS vectors is based on algorithms that generate MMP diagrams corresponding to blocks of orthogonal vectors in R^n, on algorithms that single out those diagrams on which algebraic 0-1 states cannot be defined, and on algorithms that solve nonlinear equations describing the orthogonalities of the vectors by means of statistically polynomially complex interval analysis and self-teaching programs. The algorithms are limited neither by the number of dimensions nor by the number of vectors. To demonstrate the power of the algorithms, all 4-dim KS vector systems containing up to 24 vectors were generated and described, all 3-dim vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.
Recommendations
- Kochen-Specker theorem in Krein space
- Kochen Specker vectors
- On searching for small Kochen-Specker vector systems
- Kochen-Specker sets and Hadamard matrices
- scientific article; zbMATH DE number 5589487
- Kochen-Specker theorem for von Neumann algebras
- Vector coherent state representation theory
- Coherent states and the -representation
- Measuring quantum coherence in coherence-vector representation
- Vector coherent state representations and their inner products
Cited in
(19)- Axiomatic quantum mechanics and completeness
- A Kochen-Specker system has at least 22 vectors
- Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis
- A combinatorial approach to nonlocality and contextuality
- Recursive proof of the Bell-Kochen-Specker theorem in any dimension \(n>3\)
- On searching for small Kochen-Specker vector systems
- New Kochen-Specker sets in four dimensions
- Parity proofs of the Kochen-Specker theorem based on the 24 rays of Peres
- Kochen Specker vectors
- Conway-Kochen and the finite precision loophole
- Parity proofs of the Kochen-Specker theorem based on the 120-cell
- A Kochen-Specker system has at least 22 vectors (extended abstract)
- The sheaf-theoretic structure of non-locality and contextuality
- Graph approach to quantum systems
- New class of 4-dim Kochen-Specker sets
- HOW MANY QUESTIONS DO YOU NEED TO PROVE THAT UNASKED QUESTIONS HAVE NO ANSWERS?
- Parity proofs of the Bell-Kochen-Specker theorem based on the 600-cell
- Noncontextual coloring of orthogonality hypergraphs
- Hilbert lattice equations
This page was built for publication: Kochen–Specker vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667963)
