Zoology of Atlas-groups: dessins d'enfants, finite geometries and quantum commutation

Every finite simple group P can be generated by two of its elements. Pairs of generators for P are available in the Atlas of finite group representations as (not neccessarily minimal) permutation representations P. It is unusual but significant to recognize that a P is a Grothendieck's dessin d'enfant D and that most standard graphs and finite geometries G-such as near polygons and their generalizations-are stabilized by a D. In our paper, tripods P -- D -- G of rank larger than two, corresponding to simple groups, are organized into classes, e.g. symplectic, unitary, sporadic, etc (as in the Atlas). An exhaustive search and characterization of non-trivial point-line configurations defined from small index representations of simple groups is performed, with the goal to recognize their quantum physical significance. All the defined geometries G' s have a contextuality parameter close to its maximal value 1.Comment: 19 page

The hyperplanes of the U (4)(3) near hexagon

Combining theoretical arguments with calculations in the computer algebra package GAP, we are able to show that there are 27 isomorphism classes of hyperplanes in the near hexagon for the group U (4)(3). We give an explicit construction of a representative of each class and we list several combinatorial properties of such a representative

The hyperplanes of the glued near hexagon Q(5,2) ⊗ Q(5,2)

With the aid of the computer algebra system GAP, we show that the glued near hexagon Q(5, 2) circle times Q(5, 2) has 16 isomorphism classes of hyperplanes. We give at least one explicit construction for a representative of each isomorphism class and we list several properties of such a representative

Unitary reflection groups for quantum fault tolerance

This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by Euclidean real reflections (i.e., Coxeter groups) or by specific imprimitive reflection groups, introduced (but not named) in a recent paper [Planat M and Jorrand Ph 2008, {\it J Phys A: Math Theor} {\bf 41}, 182001]. The automorphisms of multiple qubit systems are found to relate to some Clifford operations once the corresponding group of reflections is identified. For a short list, one may point out the Coxeter systems of type $B_3$ and $G_2$ (for single qubits), $D_5$ and $A_4$ (for two qubits), $E_7$ and $E_6$ (for three qubits), the complex reflection groups $G(2^l,2,5)$ and groups No 9 and 31 in the Shephard-Todd list. The relevant fault tolerant subsets of the Clifford groups (the Bell groups) are generated by the Hadamard gate, the $\pi/4$ phase gate and an entangling (braid) gate [Kauffman L H and Lomonaco S J 2004 {\it New J. of Phys.} {\bf 6}, 134]. Links to the topological view of quantum computing, the lattice approach and the geometry of smooth cubic surfaces are discussed.Comment: new version for the Journal of Computational and Theoretical Nanoscience, focused on "Technology Trends and Theory of Nanoscale Devices for Quantum Applications

The hyperplanes of the near hexagon related to the extended ternary Golay code

We prove that the near hexagon associated with the extended ternary Golay code has, up to isomorphism, 25 hyperplanes, and give an explicit construction for each of them. As a main tool in the proof, we show that the classification of these hyperplanes is equivalent to the determination of the orbits on vectors of certain modules for the group 2 center dot M-12

Pseudo-embeddings and pseudo-hyperplanes

We generalize some known results regarding hyperplanes and projective embeddings of point-line geometries with three points per line to geometries with an arbitrary but finite number of points on each line. In order to generalize these results, we need to introduce the new notions of pseudo-hyperplane, (universal) pseudo-embedding, pseudo-embedding rank and pseudo-generating rank. We prove several connections between these notions and address the problem of the existence of (certain) pseudo-embeddings. We apply this to several classes of point-line geometries. We also determine the pseudo-embedding rank and the pseudo-generating rank of the projective space PG (n,4) and the affine space AG (n,4

Near polygons and Fischer spaces

In this paper we exploit the relations between near polygons with lines of size 3 and Fischer spaces to classify near hexagons with quads and with lines of size three. We also construct some infinite families of near polygons