[Paper Review] Generalized parity proofs of the Kochen-Specker theorem

Petr Lisoněk, Robert Raussendorf+1 more|arXiv (Cornell University)|Jan 13, 2014

Quantum Mechanics and Applications18 references3 citations

TL;DR

This paper presents two complementary methods for generating generalized parity proofs of the Kochen-Specker theorem using constraints of commuting observables whose product is ±I. The first approach uses linear algebra and coding theory to enumerate proofs from a fixed set of constraints, while the second uses combinatorial incidence structures to determine whether observable assignments can yield valid parity proofs. The key contribution is a systematic framework to classify and enumerate such proofs, with results showing that many combinatorial structures cannot produce any parity proof.

ABSTRACT

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.

Motivation & Objective

• To develop a systematic framework for generating generalized parity proofs of the Kochen-Specker theorem beyond traditional Pauli observables.
• To address the challenge of enumerating parity proofs by size using coding-theoretic techniques.
• To determine which combinatorial incidence structures can or cannot support any parity proof, regardless of observable dimension or type.
• To provide an algorithmic method for checking the existence of parity proofs on given incidence structures using group-theoretic tools like the Knuth-Bendix algorithm.
• To establish that the number of parity proofs from a fixed set of constraints is always 0 or a power of two, based on binary linear codes.

Proposed method

• Model parity proofs as sets of constraints (sets of commuting observables with product ±I), where each observable appears in an even number of constraints and an odd number of constraints have product −I.
• Use binary linear algebra to show that the set of valid parity proofs corresponds to a coset of a binary linear code, implying the number of such proofs is always 0 or 2^k for some k.
• Apply coding theory duality to indirectly enumerate parity proofs by size, avoiding exhaustive search.
• Represent the combinatorial structure of constraints as an incidence structure with points (observables) and blocks (constraints), and use this to guide the search for valid assignments.
• Use the Knuth-Bendix algorithm in group theory to test whether a given incidence structure can support a parity proof by checking whether the product of all observables in all constraints reduces to I.
• Prune the search space by identifying non-commuting pairs of observables that must not commute in any valid proof, based on group relations.

Experimental results

Research questions

• RQ1 Can generalized parity proofs of the Kochen-Specker theorem be systematically generated and enumerated beyond the standard Pauli-based constructions?
• RQ2 For a given set of constraints, what determines whether a parity proof exists, and how many such proofs are possible?
• RQ3 Which combinatorial incidence structures (with fixed block and point degrees) can or cannot support any parity proof, regardless of observable dimension?
• RQ4 How can group-theoretic methods like the Knuth-Bendix algorithm be used to rule out the existence of parity proofs on specific incidence structures?
• RQ5 What is the role of coding theory in enabling efficient enumeration of parity proofs by size?

Key findings

• The number of parity proofs derivable from a fixed set of constraints is always 0 or a power of two, due to a one-to-one correspondence with cosets of a binary linear code.
• For incidence structures derived from connected cubic graphs on up to 10 vertices, 10 out of 19 such structures can produce parity proofs, while 9 cannot.
• The C2 configuration (a 3-regular graph on 6 vertices) was proven to be incapable of supporting any parity proof, as the product of all observables in all constraints reduces to I in the associated group.
• The C3 configuration (also on 6 vertices) supports at least one parity proof, as demonstrated by the Mermin square construction, and the Knuth-Bendix algorithm confirms that the product does not reduce to I.
• The method enables indirect enumeration of parity proofs by size via duality in coding theory, significantly reducing computational cost.
• Non-existence of parity proofs can be rigorously established using the Knuth-Bendix algorithm to test group relations, allowing pruning of impossible configurations before full search.