Generating the Kochen-Specker Sets with 36, 38 and 40 Rays in Three-qubit System: Three Simple Algorithms

TL;DR

This paper introduces three straightforward algorithms for generating Kochen-Specker sets in three-qubit systems, producing numerous sets without computer calculations by selecting rays that repeat four times.

Contribution

The paper presents novel simple algorithms that generate Kochen-Specker sets with specific rays counts, eliminating the need for computational methods.

Findings

Generated 320, 640, and 64 Kochen-Specker sets with 36, 38, and 40 rays respectively.

Algorithms are simple and do not require computer calculations.

Method relies on selecting rays that repeat four times in the sets.

Abstract

We put forward three simple algorithms to generate Kochen-Specker sets used for parity proof of Kochen-Specker theorem in three-qubit system. These algorithms enables us to generate 320, 640 and 64 Kochen-Specket sets with 36, 38 and 40 rays, respectively. No any computer calculation is required, every step in the algorithms is determined by the method of picking the rays that repeat 4 times in the KS sets.