Constacyclic codes over mixed rings and their quantum error correction uses

A team of Chinese mathematicians has unveiled a comprehensive framework for a special family of error-correcting codes that could expand the toolbox available to engineers building fault-tolerant quantum computers. In a study published in Quantum Information Processing, Xiusheng Liu of Hubei Normal University and Jie Liu of Hubei Polytechnic University provide a complete structural description of so-called (1, 1−2v)-constacyclic codes defined over the mixed-alphabet ring F_q × (F_q + vF_q), where q is an odd prime power, and then show how these codes can be systematically converted into quantum error-correcting (QEC) codes. The work, which appeared on 27 July 2026 as Volume 25, article number 270 of the journal, is a contribution to a long-running mathematical effort: finding new, well-behaved families of classical codes whose symmetries can be harnessed to protect fragile quantum information from decoherence and noise.

The central objects of the study live on an unusual mathematical landscape. Rather than working over a single finite field F_q, the authors work over the direct product R_q = F_q × (F_q + vF_q), where the symbol v satisfies the idempotency relation v² = v. The second component, F_q + vF_q, is a small ring of characteristic p (where q = p^s) containing a nilpotent-free but non-field element; elements of this ring have the form a + bv with a and b in F_q, and multiplication follows from v² = v. Because a vector space over this ring decomposes neatly into a direct sum of two copies of F_q, codes over R_q behave like “mixed” codes that blend two field-based code components of different sizes into one structure. Codes of this kind generalize a lineage of constructions studied over the past two decades, from Z_2Z_4-additive cyclic codes through Z_2Z_2[u]-cyclic and constacyclic codes, and they are attractive to coding theorists precisely because a single code over R_q can yield several different codes over F_q simultaneously.

The “constacyclic” property is the structural heart of the paper. A linear code of length n over R_q is constacyclic if shifting every coordinate cyclically and multiplying by a fixed unit constant λ maps the code back to itself; in the present work the unit is λ = (1, 1−2v) in the product ring. When λ = 1 such codes are cyclic, and when λ = −1 they are negacyclic, so constacyclic codes encompass both classical cases. The researchers first construct two Gray maps, functions that translate length-n codewords over R_q into length-3n codewords over the plain field F_q. These maps are distance-preserving in an appropriate sense, which means that parameters such as the Hamming distance of the resulting field code can be controlled through the structure of the original code over the ring. Gray maps of this type are the standard bridge from ring-based coding theory to the finite-field codes that ultimately specify quantum code parameters, and having two distinct maps gives the construction extra flexibility in how the two ring components are unpacked into field symbols.

With the Gray maps in place, the paper delivers a full algebraic characterization of all (1, 1−2v)-constacyclic codes of length n over R_q and, crucially, of their dual codes. Because the length-n shift over the product ring splits naturally according to the two factors F_q and F_q + vF_q, every constacyclic code decomposes into a pair of constacyclic codes over the field component and the ring component respectively. Each component is generated by a single polynomial factor of x^n − λ modulo the ambient ring polynomial, so the entire code family is parametrized by a small set of divisor polynomials. The duals satisfy a corresponding factorization: the dual of a constacyclic code with unit λ is constacyclic with reciprocal unit λ^(−1), and the generating polynomials of the dual are reciprocal to the original ones. This clean polynomial description is what makes the family tractable for the quantum constructions that follow.

A distinctive feature of the study is its detailed treatment of Euclidean hulls and Euclidean sums. The Euclidean hull of a code C is the intersection C ∩ C^⊥, where C^⊥ denotes the dual under the standard Euclidean inner product; the hull measures how much of a code is self-orthogonal. Hulls have become a hot topic in recent coding theory because the dimension of the hull governs how many entanglement-assisted resources a quantum code derived from C would require, and because hull-variability problems connect to algebraic-geometry questions about finite fields. Liu and Liu determine, for every (1, 1−2v)-constacyclic code, the precise structure of its hull and of the Euclidean sum C + C^⊥, again expressed through the factorization of generating polynomials. This means a researcher can now read off the self-orthogonality properties of any code in the family directly from its polynomial description, without performing brute-force inner-product computations on generator matrices.

The quantum payoff arrives through two classical-to-quantum conversion recipes. The first is Steane’s construction, the 1996 enlargement method that builds a quantum stabilizer code from a pair of nested classical codes in which one code contains the dual of the other — the ancestor of the celebrated Calderbank–Shor–Steane (CSS) scheme, which itself grew out of Peter Shor’s pioneering 1995 nine-qubit code. The second is “quantum construction X,” a propagation technique in the spirit of Construction X from classical coding theory, which enlarges a code by combining it with auxiliary codes to push its minimum distance upward while keeping the dimension favorable. Applied to the Euclidean sums and hulls of the (1, 1−2v)-constacyclic codes — paired with auxiliary linear codes of the same length over R_q — these two methods yield families of q-ary QEC codes whose parameters [[n, k, d]] encode the number of physical qubits protected, the number of logical qubits carried, and the number of errors that can be corrected.

To demonstrate that the theory is not merely formal, the authors construct concrete examples of new QEC codes arising from the Euclidean sums and hulls of their constacyclic codes. The stated purpose is to enrich the variety of available quantum error-correcting codes, a goal that matters because tables of best-known quantum code parameters still contain many gaps. Every new [[n, k, d]] code with parameters competitive against existing entries is a potential asset for quantum communication protocols, since larger minimum distances translate directly into lower logical error rates for a fixed physical overhead. The mixed-ring setting is particularly effective at generating codes whose parameters would be awkward to reach through straightforward field-based constructions, because the two ring components contribute code components of differing field sizes that merge into richer composite structures after the Gray map is applied.

The broader context of this line of research stretches back to the foundations of quantum error correction. Shor’s 1995 scheme demonstrated that quantum information, despite its extreme fragility under decoherence, could be redundantly encoded; Steane and Calderbank, Rains, Shor and Sloane then established the stabilizer formalism and the CRSS framework for nonbinary stabilizer codes over finite fields, later generalized by Ashikhmin and Knill. Since then, a large research community has mined families of classical codes — BCH codes, cyclic codes, negacyclic codes, skew constacyclic codes, and codes over an expanding zoo of finite rings including F_q + uF_q, F_q + vF_q + v²F_q, and various non-chain rings — for quantum constructions. Recent contributions in Quantum Information Processing and related journals have extracted quantum maximum-distance-separable codes, entanglement-assisted codes, and quantum synchronizable codes from such families. The present work extends this program to the product ring F_q × (F_q + vF_q) with a constacyclic unit that is neither 1 nor −1, filling a previously open case.

Why do mathematicians persist in exploring ever-more-exotic rings for quantum codes? The answer lies in a trade-off between algebraic convenience and parameter richness. Rings with idempotent or nilpotent elements allow codes to be assembled from several field-level components at once, so that a single well-chosen constacyclic code over the ring can produce multiple distinct q-ary quantum codes with different lengths and distances after Gray mapping. Moreover, the constacyclic property preserves the cyclic symmetry that makes encoding and decoding circuits efficient — a property that matters practically, since a code that cannot be encoded and decoded with manageable circuit depth offers little benefit to a quantum computer designer regardless of its theoretical parameters. The complete duality theory developed by Liu and Liu ensures that the self-orthogonality conditions required by Steane’s construction can be verified at the polynomial level, streamlining the search for good quantum codes dramatically compared with matrix-level approaches.

The authors acknowledge support from the Research Funds of Hubei Province (Grant No. Q20164505) and the talent project of Hubei Polytechnic University (Grant No. 16xjzo8R). Both authors contributed equally to the work, which was received by the journal on 7 May 2025, accepted on 14 July 2026, and classified under the mathematics subject classifications 94B15 and 94B65, covering linear codes over rings and quantum coding theory respectively. The paper reports that no datasets were generated or analyzed beyond the theoretical constructions themselves.

For the quantum computing community, the study arrives at a moment when the demand for good error-correcting codes is intensifying. As hardware platforms scale toward hundreds and thousands of physical qubits, the question of which classical code families feed the best quantum stabilizer constructions has become an active frontier of applied mathematics. The complete structural theory of (1, 1−2v)-constacyclic codes over F_q × (F_q + vF_q) — their Gray images, duals, hulls, and sums — hands researchers a new, fully mapped territory in which to search for quantum codes with improved parameters, and the concrete examples included in the paper provide immediate entry points into databases of best-known quantum codes. Whether the next generation of fault-tolerant quantum machines will use codes born from mixed product rings remains an open question, but the algebraic inventory from which such codes may be drawn has just grown measurably larger.