On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12

Abstract

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.

18 pages, 4 figures

References in corpus (5)

• Multi-party entanglement in graph states
• Quantum error-correcting codes associated with graphs
• Graphical description of the action of local Clifford transformations on graph states
• Graphs, Quadratic Forms, and Quantum Codes
• On Self-Dual Quantum Codes, Graphs, and Boolean Functions

Cited by in corpus (38)

• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Additive Asymmetric Quantum Codes
• Mapping graph state orbits under local complementation
• Solutions of modular bootstrap constraints from quantum codes
• Codeword stabilized quantum codes: algorithm and structure
• Quantum stabilizer codes, lattices, and CFTs
• Hard limits on the postselectability of optical graph states
• Edge Local Complementation and Equivalence of Binary Linear Codes
• Directed Graph Representation of Half-Rate Additive Codes over GF(4)
• Codes for Simultaneous Transmission of Quantum and Classical Information
• Near-term $n$ to $k$ distillation protocols using graph codes
• Efficient Entanglement Measure for Graph States
• On the classification of Hermitian self-dual additive codes over GF(9)
• Two-colorable graph states with maximal Schmidt measure
• New self-dual additive ${\mathbb{F}}_4$-codes constructed from circulant graphs
• Calculating Concentratable Entanglement in Graph States
• On Pivot Orbits of Boolean Functions
• Some Ulam's reconstruction problems for quantum states
• Counting single-qubit Clifford equivalent graph states is #P-Complete
• Quantum stabilizer codes and beyond
• Codeword Stabilized Quantum Codes for Asymmetric Channels
• New quantum codes constructed from some self-dual additive ${\mathbb{F}}_4$-codes
• Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes
• Scheme for constructing graphs associated with stabilizer quantum codes
• Exclusivity structures and graph representatives of local complementation orbits
• Heuristic construction of codeword stabilized codes
• The automorphism group of a self-dual [72,36,16] code does not contain S_3, A_4, or D_8
• Nonbinary stabilizer codes over finite fields
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• Additive codes over $GF(4)$ from circulant graphs
• From Graph States to Two-Graph States
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
• Formally self-dual linear binary codes from circulant graphs
• A new class of codes over Z_2 x Z_2
• Additive Tridiagonal Codes over ${\mathbb{F}}_4$
• Some Extremal Self-Dual Codes and Unimodular Lattices in Dimension 40
• A Projection Decoding of a Binary Extremal Self-Dual Code of Length $40$