0000000001192612
AUTHOR
Alain Giorgetti
Automated detection of contextuality proofs with intermediate numbers of observables
<div style=""><font face="arial, helvetica"><span style="font-size: 13px;">Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality </span></font><span style="font-size: 13px; font-family: arial, helvetica;">proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the</span></div><div style=""><font face="arial, helvetica"><span style="font-size: 13px;">contextuality property as the absence of solutions to a linear system. Then we explain why </span></font><span style="font-size: 13px; font-family: arial, helvetica…
Computer-assisted enumeration and classification of multi-qubit doilies
For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.