Computer-assisted enumeration of finite geometries related to quantum contextuality
Résumé
The talk presents finite geometries, named $N$-qubit doily doilies
($N \geq 2$) related to operator-based proofs of quantum contextuality. We
first show closed formulas for the numbers of linear and quadratic doilies for $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.
Origine : Fichiers produits par l'(les) auteur(s)