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

Bulletin of the American Physical Society

New Algorithms for Generating Arbitrary Kochen-Specker Sets

Norman D. Megill, Mladen Pavičić

Published Mar 2, 2012• 0 citations
OpenAlex

Related papers

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 Hadamard matrices

Petr Lisoněk

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

Kochen–Specker Sets and Generalized Orthoarguesian Equations

Norman D. Megill, Mladen Pavičić

arXiv:1005.0016•Annales Henri Poincaré•Apr 20, 2011•10 citations

Vector space constructions of Kochen-Specker sets using Hadamard matrices

Petr Lisoněk, Liam Salt

Physical Review A•Jul 1, 2025•0 citations

New classes of Kochen-Specker contextual sets

Norman D. Megill, Mladen Pavičić

Finding Kochen-Specker contextual sets proves to be essential for quantum information and quantum computation in particular. It is therefore essential to find algorithms and programs which can generate arbitrary Kochen-Specker sets in a nearly-exhaustive manner. In this paper we present such generations for two new classes of Kochen-Specker sets. All sets from one of the classes are completely invisible to standard algorithms and programs from the literature as well as the upper part of sets from the second class. We also describe the methods and programs we used to obtain the sets on supercomputing clusters.

International Convention on Information and Communication Technology, Electronics and Microelectronics•May 1, 2017•5 citations

Kochen-Specker Algorithms for Qubits

Mladen Pavičić

Algorithms for finding arbitrary sets of Kochen‐Specker (KS) qubits 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 orthogonalities of KS qubits, on an algebraic definition of states on the diagrams, and on nonlinear equations corresponding to MMP diagrams whose solutions are either KS qubits or the remaining vectors of a chosen space depending on whether the diagrams allow 0–1 states or not. The complexity of the algorithms is polynomial. New results obtained with the help of the algorithms are presented.

arXiv:quant-ph/0412197•AIP conference proceedings•Jan 1, 2004•4 citations
Finding Kochen-Specker contextual sets proves to be essential for quantum information and quantum computation in particular. It is therefore essential to find algorithms and programs which can generate arbitrary Kochen-Specker sets in a nearly-exhaustive manner. In this paper we present such generations for two new classes of Kochen-Specker sets. All sets from one of the classes are completely invisible to standard algorithms and programs from the literature as well as the upper part of sets from the second class. We also describe the methods and programs we used to obtain the sets on supercomputing clusters.
Algorithms for finding arbitrary sets of Kochen‐Specker (KS) qubits 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 orthogonalities of KS qubits, on an algebraic definition of states on the diagrams, and on nonlinear equations corresponding to MMP diagrams whose solutions are either KS qubits or the remaining vectors of a chosen space depending on whether the diagrams allow 0–1 states or not. The complexity of the algorithms is polynomial. New results obtained with the help of the algorithms are presented.