Two new zero-dimensional qubit codes from bordered metacirculant construction (Q2037568)

A code is \textit{additive} if it is closed under addition. The \textit{weight} of a vector in \(\mathbb F_{4}^{n}\) is the number of its nonzero entries, and the minimum distance of an additive code \(C\) is the smallest weight \(d\) among the weights of its nonzero codewords. An \((n,2^{n},d)_{4}\) additive code \(C\) is a code of length \(n\), \(2^{n}\) elements, and minimum distance \(d\). Let \(G\) be a simple undirected graph on \(n\) vertices and let \(\Gamma\) be the adjacency matrix of \(G\). A \textit{graph code} is an \((n,2^{n},d)_{4}\) additive code \(C\) whose codewords are the \(\mathbb F_{2}\)-linear combinations of the rows of \(\Gamma+\omega I_{n}\). Here, \(\omega\) is a root of \(x^{2}+x+1\in \mathbb F_{2}[x]\) and \(\mathbb F_{4}=\{0,1,\omega,\omega^{2}\}\). Furthermore, for two elements \(a,b\) of \(\mathbb F_{4}^{n}\), define \[ a*b=\sum_{j=1}^{n}(a_{j}b_{j}^{2}+a_{j}^{2}b_{j}). \] Then, the \textit{symplectic dual code} \(C^{*}\) of a code \(C\) is defined as \[ C^{*}=\{w\in \mathbb F_{4}^{n}: w*c=0\; \text{for all \(c\in C\)}\}. \] A code \(C\) is \textit{self-dual} if \(C=C^{*}\). Any graph code is self-dual. And a self-dual additive code \(C\) over \(\mathbb F_{4}\) leads to a stabiliser code with parameters \([\![ n,0,d ]\!]_{2}\); see [\textit{A. R. Calderbank} et al., IEEE Trans. Inf. Theory 44, No. 4, 1369--1387 (1998; Zbl 0982.94029)] for more details. According to [\textit{D. Schlingemann}, Quantum Inf. Comput. 2, No. 4, 307--323 (2002; Zbl 1187.81087)], every graph represents a self-dual additive code over \(\mathbb F_{4}\) and every self-dual additive code over \(\mathbb F_{4}\) can be represented by a graph. Thus, to construct \([\![ n,0,d ]\!]_{2}\) stabiliser codes, it suffices to find graph codes with minimum distance \(d\).