2000 character limit reached
Kochen-Specker Sets with Thirty Rank-Two Projectors in Three-Qubit System
Published 23 Apr 2013 in quant-ph | (1304.6166v2)
Abstract: A simple three rules supplemented by five steps scheme is proposed to produce Kochen-Specker (KS) sets with 30 rank-2 projectors that occur twice each. The KS sets provide state-independent proof of KS theorem based on a system of three qubits. A small adjustment of the scheme enables us to manually generate a large number of KS sets with a mixture of rank-1 and rank-2 projectors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.