Kochen-Specker Sets with Thirty Rank-Two Projectors in Three-Qubit System

2013/04/23 by S. P. Toh, Toh, S. P.
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.1304.6166

openalex publication_date 2013/04/23 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Related

• Generating the Kochen-Specker Sets with 36, 38 and 40 Rays in Three-qubit System: Three Simple Algorithms
• The simplest Kochen-Specker set
• Maximal Non-Kochen-Specker Sets and a Lower Bound on the Size of Kochen-Specker Sets
• Optimal conversion of Kochen-Specker sets into bipartite perfect quantum strategies
• Some remarks on the theorems of Gleason and Kochen-Specker