Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1205.5015 · Journal of Physics A Mathematical and Theoretical

Proofs of the Kochen–Specker theorem based on a system of three qubits

Mordecai Waegell, P. K. Aravind

Published Sep 18, 2012• 44 citations
arXivHTMLPDF

Abstract

A number of new proofs of the Kochen–Specker theorem are given based on the observables of the three-qubit Pauli group. Each proof is presented in the form of a diagram from which it is obvious by inspection. Each of our observable-based proofs leads to a system of projectors and bases that generally yields a large number of ‘parity proofs’ of the Kochen–Specker theorem. Some examples of such proofs are given and some of their applications are discussed.

DOI
10.1088/1751-8113/45/40/405301

Related papers

Proofs of the Kochen-Specker theorem based on the N -qubit Pauli group

Mordecai Waegell, P. K. Aravind

We present a number of observables-based proofs of the Kochen-Specker (KS) theorem based on the $N$-qubit Pauli group for $N\ensuremath{\ge}4$, thus adding to the proofs that have been presented earlier for the 2- and 3-qubit groups. These proofs have the attractive feature that they can be presented in the form of diagrams from which they are obvious by inspection. They are also irreducible in the sense that they cannot be reduced to smaller proofs by ignoring some subset of qubits and/or observables in them. A simple algorithm is given for transforming any observables-based KS proof into a large number of projectors-based KS proofs; if the observables-based proof has $O$ observables, with each observable occurring in exactly two commuting sets and any two commuting sets having at most one observable in common, the number of associated projectors-based parity proofs is 2${}^{O}$. We introduce symbols for the observables- and projectors-based KS proofs that capture their important features and also convey a feeling for the enormous variety of both these types of proofs within the $N$-qubit Pauli group. We discuss an infinite family of observables-based proofs, whose members include all numbers of qubits from 2 up, and show how it can be used to generate projectors-based KS proofs involving only 9 bases (or experimental contexts) in any dimension of the form ${2}^{N}$ for $N\ensuremath{\ge}2$. Some implications of our results are discussed.

arXiv:1302.4801•Physical Review A•Jul 1, 2013•33 citations

QUANTUM STATES ARISING FROM THE PAULI GROUPS: SYMMETRIES AND PARADOXES

Michel R. P. Planat

We investigate multiple qubit Pauli groups and the quantum states/rays arising from their maximal bases. Remarkably, the real rays are carried by a Barnes-Wall lattice $BW_n$ ($n=2^m$). We focus on the smallest subsets of rays allowing a state proof of the Bell-Kochen-Specker theorem (BKS). BKS theorem rules out realistic non-contextual theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of small BKS-proofs $v-l$ involving $v$ rays and $l$ $2n$-dimensional bases of $n$-qubits. Specifically, we look at the classes of parity proofs 18-9 with two qubits (A. Cabello, 1996), 36-11 with three qubits (M. Kernaghan & A. Peres, 1995) and related classes. One finds characteristic signatures of the distances among the bases, that carry various symmetries in their graphs.

arXiv:1209.5176•WORLD SCIENTIFIC eBooks•Aug 14, 2013•2 citations

Generalized parity proofs of the Kochen-Specker theorem

Petr Lisoněk, Robert Raussendorf, Vijaykumar Singh

We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is $I$ or $-I$; we call them constraints. In the first approach, one starts with a fixed set of constraints and methods of linear algebra are used to produce subsets that are generalized parity proofs. Coding theory methods are used for enumeration of the proofs by size. In the second approach, one starts with the combinatorial structure of the set of constraints and one looks for ways to suitably populate this structure with observables. As well, we are able to show that many combinatorial structures can not produce parity proofs.

arXiv:1401.3035•Jan 13, 2014•4 citations

Construction of Three-Qubit Kochen-Specker Sets

S. P. Toh

Contextuality is one of the fundamental deviations of quantum mechanics from classical physics.The Kochen-Specker theorem shows that non-contextual classical physics with hidden variables is inconsistent with the predictions of quantum mechanics.Parity proof is one of the many different approaches applied to prove Kochen-Specker theorem for quantum system with different dimensionality.This method of proof requires Kochen-Specker sets that were composed of an odd number of bases and an even number of projectors.In most of the cases, the number of Kochen-Specker sets produced is large and its production is generally aided by computer calculation.However, manual generation of the Kochen-Specker sets are also reported previously for qutrit and two-qubit systems.We put forward the first and surprisingly simple method to generate manually Kochen-Specker sets, with respect to the Mermin pentagram, that can be used for the parity proof of the Kochen-Specker theorem in a state space of eight-dimensional three-qubit system.

arXiv:1603.08282•Acta Physica Polonica A•Mar 1, 2016•0 citations

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

S. P. Toh

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.

arXiv:1304.6166•Apr 23, 2013•0 citations

QUANTUM STATES ARISING FROM THE PAULI GROUPS, SYMMETRIES AND PARADOXES

Michel R. P. Planat

We investigate multiple qubit Pauli groups and the quantum states/rays arising from their maximal bases. Remarkably, the real rays are carried by a Barnes-Wall lattice $BW_n$ ($n=2^m$). We focus on the smallest subsets of rays allowing a state proof of the Bell-Kochen-Specker theorem (BKS). BKS theorem rules out realistic {\it non-contextual} theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of small BKS-proofs $v-l$ involving $v$ rays and $l$ $2n$-dimensional bases of $n$-qubits. Specifically, we look at the classes of parity proofs $18-9$ with two qubits (A. Cabello, 1996), $36-11$ with three qubits (M. Kernaghan \& A. Peres, 1995) and related classes. One finds characteristic signatures of the distances among the bases, that carry various symmetries in their graphs.

•Aug 20, 2012•0 citations
A number of new proofs of the Kochen–Specker theorem are given based on the observables of the three-qubit Pauli group. Each proof is presented in the form of a diagram from which it is obvious by inspection. Each of our observable-based proofs leads to a system of projectors and bases that generally yields a large number of ‘parity proofs’ of the Kochen–Specker theorem. Some examples of such proofs are given and some of their applications are discussed.
We present a number of observables-based proofs of the Kochen-Specker (KS) theorem based on the NNN-qubit Pauli group for $N\ensuremath{\ge}4$, thus adding to the proofs that have been presented earlier for the 2- and 3-qubit groups. These proofs have the attractive feature that they can be presented in the form of diagrams from which they are obvious by inspection. They are also irreducible in the sense that they cannot be reduced to smaller proofs by ignoring some subset of qubits and/or observables in them. A simple algorithm is given for transforming any observables-based KS proof into a large number of projectors-based KS proofs; if the observables-based proof has OOO observables, with each observable occurring in exactly two commuting sets and any two commuting sets having at most one observable in common, the number of associated projectors-based parity proofs is 2O{}^{O}O. We introduce symbols for the observables- and projectors-based KS proofs that capture their important features and also convey a feeling for the enormous variety of both these types of proofs within the NNN-qubit Pauli group. We discuss an infinite family of observables-based proofs, whose members include all numbers of qubits from 2 up, and show how it can be used to generate projectors-based KS proofs involving only 9 bases (or experimental contexts) in any dimension of the form 2N{2}^{N}2N for $N\ensuremath{\ge}2$. Some implications of our results are discussed.
We investigate multiple qubit Pauli groups and the quantum states/rays arising from their maximal bases. Remarkably, the real rays are carried by a Barnes-Wall lattice BWnBW_nBWn​ (n=2mn=2^mn=2m). We focus on the smallest subsets of rays allowing a state proof of the Bell-Kochen-Specker theorem (BKS). BKS theorem rules out realistic non-contextual theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of small BKS-proofs v−lv-lv−l involving vvv rays and lll 2n2n2n-dimensional bases of nnn-qubits. Specifically, we look at the classes of parity proofs 18-9 with two qubits (A. Cabello, 1996), 36-11 with three qubits (M. Kernaghan & A. Peres, 1995) and related classes. One finds characteristic signatures of the distances among the bases, that carry various symmetries in their graphs.
We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is III or −I-I−I; we call them constraints. In the first approach, one starts with a fixed set of constraints and methods of linear algebra are used to produce subsets that are generalized parity proofs. Coding theory methods are used for enumeration of the proofs by size. In the second approach, one starts with the combinatorial structure of the set of constraints and one looks for ways to suitably populate this structure with observables. As well, we are able to show that many combinatorial structures can not produce parity proofs.
Contextuality is one of the fundamental deviations of quantum mechanics from classical physics.The Kochen-Specker theorem shows that non-contextual classical physics with hidden variables is inconsistent with the predictions of quantum mechanics.Parity proof is one of the many different approaches applied to prove Kochen-Specker theorem for quantum system with different dimensionality.This method of proof requires Kochen-Specker sets that were composed of an odd number of bases and an even number of projectors.In most of the cases, the number of Kochen-Specker sets produced is large and its production is generally aided by computer calculation.However, manual generation of the Kochen-Specker sets are also reported previously for qutrit and two-qubit systems.We put forward the first and surprisingly simple method to generate manually Kochen-Specker sets, with respect to the Mermin pentagram, that can be used for the parity proof of the Kochen-Specker theorem in a state space of eight-dimensional three-qubit system.
We investigate multiple qubit Pauli groups and the quantum states/rays arising from their maximal bases. Remarkably, the real rays are carried by a Barnes-Wall lattice BWnBW_nBWn​ (n=2mn=2^mn=2m). We focus on the smallest subsets of rays allowing a state proof of the Bell-Kochen-Specker theorem (BKS). BKS theorem rules out realistic {\it non-contextual} theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of small BKS-proofs v−lv-lv−l involving vvv rays and lll 2n2n2n-dimensional bases of nnn-qubits. Specifically, we look at the classes of parity proofs 18−918-918−9 with two qubits (A. Cabello, 1996), 36−1136-1136−11 with three qubits (M. Kernaghan \& A. Peres, 1995) and related classes. One finds characteristic signatures of the distances among the bases, that carry various symmetries in their graphs.