Probabilistic Generation of Quantum Contextual Sets
Norman D. Megill, Kresimir Fresl, Mordecai Waegell, P.K. Aravind, and, Mladen Pavicic

TL;DR
This paper introduces a comprehensive method for generating a vast number of Kochen-Specker contextual sets from the 600-cell, enabling new experimental and quantum gate applications, and extends previous parity proof approaches.
Contribution
It provides an exhaustive generation technique for KS sets, including new sets with even numbers of edges, complementing existing methods and offering statistical estimates of total set counts.
Findings
Generated 35 new critical KS sets with even edges
Provided a statistical estimate of total KS sets possible
Complemented previous parity proof methods
Abstract
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 sets, and it gives all sets while the parity proof method gives only sets with an odd number of edges in their hypergraph representation. Thus we obtain 35 new kinds of critical KS sets with an even number of edges. Using a random sample of the sets generated with our method, we give a statistical estimate of the number of sets that might be obtained in an eventual exhaustive enumeration.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
