A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals

We introduce and describe a new heuristic method for finding an upper bound on the degree of contextuality and the corresponding unsatisfied (i.e. non-reproducible by any NCHV model) part of a quantum contextual configuration with three-element contexts (i.e. lines) located in a multi-qubit symplectic polar space of order two. While the previously used method based on a SAT solver was limited to three qubits, this new method is much faster and more versatile, enabling us to also handle four- to six-qubit cases. The method is illustrated by the structure of unsatisfied parts of the associated contextual configurations represented by quadrics and full spaces; these entail well-known finite geometries like the split Cayley hexagon of order two, the dual polar space of rank three and order two as well as certain incidence graphs of binary projective spaces of small dimensions.