Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1502.04350

Parity proofs of the Kochen-Specker theorem based on the Lie algebra E8

Mordecai Waegell·P. K. Aravind
View original source ↗Read source document ↗Export metadata ↓

Abstract

The 240 root vectors of the Lie algebra E8 lead to a system of 120 rays in a real 8-dimensional Hilbert space that contains a large number of parity proofs of the Kochen-Specker theorem. After introducing the rays in a triacontagonal representation due to Coxeter, we present their Kochen-Specker diagram in the form of a "basis table" showing all 2025 bases (i.e., sets of eight mutually orthogonal rays) formed by the rays. Only a few of the bases are actually listed, but simple rules are given, based on the symmetries of E8, for obtaining all the other bases from the ones shown. The basis table is an object of great interest because all the parity proofs of E8 can be exhibited as subsets of it. We show how the triacontagonal representation of E8 facilitates the identification of substructures that are more easily searched for their parity proofs. We have found hundreds of different types of parity proofs, ranging from 9 bases (or contexts) at the low end to 35 bases at the high end, and involving projectors of various ranks and multiplicities. After giving an overview of the proofs we found, we present a few concrete examples of the proofs that illustrate both their generic features as well as some of their more unusual properties. In particular, we present a proof involving 34 rays and 9 bases that appears to be the most compact parity proof found to date in 8 dimensions.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mordecai Waegell, P. K. Aravind. 2015-05-04. Parity proofs of the Kochen-Specker theorem based on the Lie algebra E8. https://doi.org/10.1088/1751-8113%2F48%2F22%2F225301

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph↗
arXiv2026

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph↗
arXiv2026

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph↗