Self-Dual Codes

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems, bounds, mass formulae, enumeration, extremal codes, open problems. There is a comprehensive bibliography.Comment: 136 page

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

Graph-Based Classification of Self-Dual Additive Codes over Finite Fields

Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over GF(4). In this paper we classify self-dual additive codes over GF(9), GF(16), and GF(25). Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over GF(9) by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations.Comment: 20 pages, 13 figure