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

arXiv:1005.0016 · Annales Henri Poincaré

Kochen–Specker Sets and Generalized Orthoarguesian Equations

Norman D. Megill, Mladen Pavičić

Published Apr 20, 2011• 10 citations
arXivHTMLPDF
DOI
10.1007/s00023-011-0109-0

Related papers

Kochen-Specker sets and Hadamard matrices

Petr Lisoněk

arXiv:1612.02901•Theoretical Computer Science•Oct 15, 2019•5 citations

New Algorithms for Generating Arbitrary Kochen-Specker Sets

Norman D. Megill, Mladen Pavičić

Bulletin of the American Physical Society•Mar 2, 2012•0 citations

New Kochen–Specker sets in four dimensions

Mladen Pavičić, Norman D. Megill, Jean‐Pierre Merlet

arXiv:0910.1311•Physics Letters A•Mar 17, 2010•32 citations

Kochen-Specker Sets and Generalized Orthoarguesian Equations

Norman D. Megill

We prove that the 7oa class (equational variety) of generalized orthoarguesian lattices is properly included in all noa classes for n < 7. This result strengthens the conjecture that any generalized orthoarguesian equation is strictly stronger than those of lower orders. The result emerged from our recent analysis of whether three-dimensional Kochen–Specker sets can be represented by Greechie lattices, which are a kind of orthomodular lattice.

•Aug 16, 2016•5 citations

Generation of Kochen-Specker contextual sets in higher dimensions by dimensional upscaling whose complexity does not scale with dimension and their applications

Mladen Pavičić, Mordecai Waegell

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 generally applicable in every dimension, and of exponential complexity. Therefore, we design a dimensional upscaling method, whose complexity does not scale with dimension. As a proof of principle we generate manageable-sized KS master sets in up to 27 dimensional spaces and show that well over 32 dimensions can be reached. From these master sets we obtain an ample number of smaller KS sets. We discuss three kinds of applications that work with KS sets in higher dimensions. We anticipate other applications of KS sets for quantum information processing that make use of large families of nonisomorphic KS sets.

arXiv:2305.08267•Physical Review A•Jul 3, 2024•4 citations

Generalized Kochen-Specker theorem

Asher Peres

arXiv:quant-ph/9510018•Foundations of Physics•Jun 1, 1996•22 citations
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 generally applicable in every dimension, and of exponential complexity. Therefore, we design a dimensional upscaling method, whose complexity does not scale with dimension. As a proof of principle we generate manageable-sized KS master sets in up to 27 dimensional spaces and show that well over 32 dimensions can be reached. From these master sets we obtain an ample number of smaller KS sets. We discuss three kinds of applications that work with KS sets in higher dimensions. We anticipate other applications of KS sets for quantum information processing that make use of large families of nonisomorphic KS sets.