Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Elsevier eBooks

GENERALIZATION OF THE KOCHEN-SPECKER PARADOX TO COMPLEX HILBERT VECTORS IN HILBERT SPACES OF THREE OR MORE DIMENSIONS

Published Jan 1, 1973• 0 citations
Publisher
DOI
10.1016/b978-0-08-017032-9.50026-1

Related papers

The Kochen-Specker theorem without a Hilbert lattice

Arkady Bolotin

arXiv:1904.01364•Apr 2, 2019•0 citations

A SIMPLE NEW PROOF OF THE KOCHEN-SPECKER PARADOX

Elsevier eBooks•Jan 1, 1973•0 citations

Nonlocality and the Kochen-Specker paradox

Peter Heywood, Michael L. G. Redhead

Foundations of Physics•May 1, 1983•195 citations

Dynamical Basis Theory: Linear-Algebraic Foundations and Quantum Applications Resolving Kochen-Specker Paradox

Parker Emmerson

•Jun 9, 2025•0 citations

Kochen–Specker vectors

Mladen Pavičić, Jean‐Pierre Merlet, Brendan McKay +1 more

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 an n -dimensional Hilbert space, , 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 , 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 four-dimensional KS vector systems containing up to 24 vectors were generated and described, all three-dimensional vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.

arXiv:quant-ph/0409014•Journal of Physics A Mathematical and General•Feb 3, 2005•79 citations

The Kochen-Specker Paradox and Great-Circle Descents

Jan-Åke Larsson, Luigi Accardi, Guillaume Adenier +5 more

The Kochen‐Specker paradox has recently been subject to experimental interest, and in this situation the number of steps in the proof in question is important. The fewer number of steps there are in the proof, the more imperfections can be tolerated in the experimental setup. In the spin‐1 version of the Kochen‐Specker paradox, when the settings used are directions in three‐dimensional space, the proofs can be easily visualized and the steps can easily be counted. In particular, the original Kochen‐Specker paradox makes use of so‐called great‐circle descents. Here, we will examine such descents in detail and also some other versions of the proof for spin‐1 systems. We will see that, perhaps contrary to intuition, the proofs that use a small number of steps do not in general use only great‐circle descents, and examine the reasons for this and possible extensions. At least one new proof will also be presented for the spin‐1 case.

AIP conference proceedings•Jan 1, 2009•0 citations
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 an n -dimensional Hilbert space, , 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 , 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 four-dimensional KS vector systems containing up to 24 vectors were generated and described, all three-dimensional vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.
The Kochen‐Specker paradox has recently been subject to experimental interest, and in this situation the number of steps in the proof in question is important. The fewer number of steps there are in the proof, the more imperfections can be tolerated in the experimental setup. In the spin‐1 version of the Kochen‐Specker paradox, when the settings used are directions in three‐dimensional space, the proofs can be easily visualized and the steps can easily be counted. In particular, the original Kochen‐Specker paradox makes use of so‐called great‐circle descents. Here, we will examine such descents in detail and also some other versions of the proof for spin‐1 systems. We will see that, perhaps contrary to intuition, the proofs that use a small number of steps do not in general use only great‐circle descents, and examine the reasons for this and possible extensions. At least one new proof will also be presented for the spin‐1 case.