2000 character limit reached
Generating the Kochen-Specker Sets with 36, 38 and 40 Rays in Three-qubit System: Three Simple Algorithms (1207.5982v3)
Published 25 Jul 2012 in quant-ph
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.