--- title: Cyclic Quantum Codes Overview url: https://www.emergentmind.com/topics/cyclic-quantum-codes type: topic --- # Cyclic Quantum Codes Overview Cyclic quantum codes are a heterogeneous class of quantum error-correcting codes in which cyclic structure is imposed either on the classical ingredient codes, on the stabilizer generators, or on the preparation circuit. In the literature surveyed here, cyclicity appears through ideals in \(\mathbb{F}_q[x]/\langle x^n-1\rangle\), through circulant or bipartite-circulant stabilizer matrices, and through translation-invariant cluster-state constructions. This algebraic regularity supports explicit dual-containment criteria, defining-set descriptions, Gray-map reductions, synchronizability, burst-error correction, locality constraints, entanglement assistance, and several ring- and Ore-theoretic generalizations [1705.00239] [1911.06384] [2509.06865]. ## 1. Algebraic foundations and meanings of cyclicity A classical linear code \(C\subseteq \mathbb{F}_q^n\) is cyclic when it is invariant under cyclic shift. Under the standard identification of vectors with residue classes in \(\mathbb{F}_q[x]/(x^n-1)\), cyclic codes correspond to ideals and hence are generated by a monic divisor \(g(x)\mid (x^n-1)\). The defining-set language is central: if \(\beta\) is a primitive \(n\)-th root of unity, then \[ Z(C)=\{\,i\in \mathbb{Z}_n: c(\beta^i)=0\text{ for all }c(x)\in C\,\}, \] and for cyclic codes \(\dim C=n-|Z(C)|\). The defining set is a union of \(q\)-cyclotomic cosets, which also underlies BCH constructions and one-coset quantum-code constructions [1911.06384] [1705.00239]. Duality is especially transparent in defining-set form. For Euclidean duals, \[ Z(C^\perp)=\mathbb{Z}_n\setminus \{-i\mid i\in Z(C)\}, \] while for cyclic codes over \(\mathbb{F}_{q^2}\), \[ Z(C^{\perp_h})=\mathbb{Z}_n\setminus \{-i\mid i\in qZ(C)\}. \] These formulas make dual containment, LCD conditions, and intersection dimensions computable directly from root data [1911.06384]. A recurring terminological distinction is that several papers explicitly construct quantum codes *from* cyclic classical ingredients without claiming that the resulting quantum code is cyclic in a strict stabilizer-theoretic sense. Other works use an intrinsically cyclic stabilizer description, such as circulant check matrices or translation-invariant preparation graphs. This distinction is explicit in the literature and resolves a common source of ambiguity [2606.09522] [2112.13488] [2501.16827]. | Sense of cyclicity | Representative description | Representative papers | |---|---|---| | Classical cyclic ingredients | Ideals in \(\mathbb{F}_q[x]/\langle x^n-1\rangle\), defining sets, cyclotomic cosets | [1705.00239], [1911.06384] | | Stabilizer-circulant cyclicity | Stabilizers generated by cyclic shifts; circulant \(H_x,H_z\) | [2305.14883], [2501.16827] | | Preparation-graph cyclicity | Translation-invariant bipartite CZ graph on a cyclic ring | [2509.06865] | ## 2. CSS and stabilizer constructions from cyclic classical codes The standard bridge from classical cyclic codes to quantum codes is the CSS theorem. If \(C_2^\perp\subseteq C_1\), then there exists a quantum code with parameters \[ [[n,k_1+k_2-n,d_Q]]_q, \] and in the one-code case \(C^\perp\subseteq C\), one obtains \[ [[n,2k-n,d_Q]]_q. \] This framework appears repeatedly, including in cyclic \((r,\delta)\)-qLRC constructions and in asymmetric quantum cyclic codes [2606.09522] [1002.2966]. One influential line constructs nonbinary CSS codes from a single \(q\)-cyclotomic coset containing consecutive integers. If a defining set consists of one coset \(\mathbb{C}_x\) of size \(m^*\), and that coset contains \(r+1\) consecutive integers, then the BCH bound gives \(d\ge r+2\), while the dual-containing condition \(\mathbb{C}_x\neq \mathbb{C}_{-x}\) yields a quantum code \[ [[n,n-2m^*,d\ge r+2]]_q. \] The significance is that BCH-designed distance is achieved with a very small defining set, preserving dimension [1705.00239]. A second classical route uses maximal affine-invariant extended cyclic codes and duadic cyclic codes. Maximal affine-invariant extended cyclic codes of length \(p^m\) produce pure quantum codes with parameters \[ [[p^m,p^m-2-2m',d_Q]]_q, \] and, in the prime-field case, pure codes \[ [[p^m,p^m-2-2m,d_A]]_p. \] For duadic codes, Hermitian dual containment yields \([[n,1,d]]_q\) codes with \[ d^2-d+1\ge n, \] and under additional number-theoretic conditions one obtains degenerate families answering the open problem cited there [0711.2050]. The asymmetric extension keeps separate distances for phase and qubit-flip protection. If \(C_2^\perp\subseteq C_1\), the paper on asymmetric quantum cyclic codes defines \[ d_X=\min\{\operatorname{wt}(C_1\setminus C_2^\perp),\operatorname{wt}(C_2\setminus C_1^\perp)\}, \] \[ d_Z=\max\{\operatorname{wt}(C_1\setminus C_2^\perp),\operatorname{wt}(C_2\setminus C_1^\perp)\}, \] and constructs AQECs \([[n,k_1+k_2-n,d_Z/d_X]]_q\), together with asymmetric subsystem codes. Two generic cyclic methods are given: one via generator-polynomial multiplication \(g_2^\perp(x)=f(x)g_1(x)\), and one via enlarging defining sets by cyclotomic cosets [1002.2966]. ## 3. Entanglement assistance and locality-preserving cyclic families Entanglement-assisted quantum codes remove the dual-containing restriction. In the cyclic setting, the key innovation is that the number of consumed ebits can be expressed directly through defining-set intersections. For Euclidean constructions, cyclic codes \(C_1,C_2\) yield a QUENTA code whose quantum dimension and ebit count depend on \(|Z(C_1^\perp)\cap Z(C_2)|\); in the Hermitian case, the corresponding quantity is \(|Z(C^{\perp_h})\cap Z(C)|\). If a cyclic code is LCD, the resulting EAQECC is maximal-entanglement, and MDS LCD cyclic codes yield MDS QUENTA codes [1911.06384]. The paper develops explicit families from Reed–Solomon, BCH, and general cyclic codes. In particular, it derives MDS EAQECC families from Euclidean and Hermitian Reed–Solomon inputs, a BCH-based family with parameter sets stated to be new, and Hermitian cyclic families that are almost MDS or almost near-MDS. A long-length maximal-entanglement family is obtained from Hermitian LCD cyclic codes of length \(q^{2m}-1\), motivated there by possible relevance to hashing-bound applications [1911.06384]. Locality adds another structural layer. A classical cyclic \((r,\delta)\)-LRC with \(\mathcal{C}^\perp\subseteq \mathcal{C}\) and \(\delta\le d(\mathcal{C}^\perp)\) yields, via CSS, a quantum \((r,\delta)\)-LRC \[ [[n,\kappa=2k-n,d_Q\ge d]]_q. \] The decisive defining-set criterion is \[ Z\cap (-Z)=\varnothing, \] which is necessary and sufficient for dual containment of a cyclic code in that setting. Three explicit qLRC families are constructed: a length-\(q-1\) family, a \(\delta=2\) unbounded-length family at \(n=q^m-1\), and a more general unbounded-length family under \(q\equiv 1\pmod{r+\delta-1}\). Two of these are optimal with respect to the quantum Singleton-like bound whenever the resulting qLRCs are pure, and Constructions 2 and 3 impose no bound on code length relative to field size [2606.09522]. ## 4. Synchronization, burst correction, and correlated-error cyclic codes Quantum synchronizable codes exploit cyclic structure to recover both Pauli errors and block misalignment. The general mechanism uses nested cyclic codes \(C_2\subset C_1\) with generator polynomials related by \(g_2(x)=f(x)g_1(x)\); synchronization is correctable whenever \[ c_l+c_r<\operatorname{ord}(f(x)). \] Quadratic-residue cyclic codes and their supercodes give families \[ (c_l,c_r)\text{-}[[p+c_l+c_r,2zl+1]], \] for Mersenne primes \(p=2^l-1\), with \(\operatorname{ord}(f(x))=p\), hence maximal synchronization tolerance \(c_l+c_r