Clifford quantum computer and the Mathieu groups
Abstract
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer. We employ the group theoretical package GAP\cite{GAP} for simulating the two qubit Clifford group . We already found that the symmetric group S(6), aka the automorphism group of the generalized quadrangle W(2), controls the geometry of the two-qubit Pauli graph \cite{Pauligraphs}. Now we find that the {\it inner} group exactly contains two normal subgroups, one isomorphic to (of order 16), and the second isomorphic to the parent (of order 5760) of the alternating group A(6). The group stabilizes an {\it hexad} in the Steiner system attached to the Mathieu group M(22). Both groups A(6) and have an {\it outer} automorphism group , a feature we associate to two-qubit quantum entanglement.
Keywords
Cite
@article{arxiv.0711.1733,
title = {Clifford quantum computer and the Mathieu groups},
author = {Michel Planat},
journal= {arXiv preprint arXiv:0711.1733},
year = {2010}
}
Comments
version for the journal Entropy