Quantum computers promise computational power far beyond the reach of any classical machine, but that promise rests on a fragile foundation. Quantum information lives in superpositions that collapse at the slightest disturbance, and the history of quantum computing is, in large part, the history of learning how to protect that information. Error-correcting codes are the armor of the quantum world, and a new study published in Quantum Information Processing adds a substantial piece to that armor. A team of researchers from Hefei Normal University and Hefei University of Technology in Anhui, China, has developed a systematic mathematical pipeline for constructing quantum error-correcting codes from an algebraic setting that had been only partially exploited before: finite non-chain rings of a very specific and elegant form.
The research, authored by Yongsheng Tang, Heqian Xu, Ting Yao, and Xiaoshan Kai, focuses on rings of the type F plus u times F, where F is the finite field with q raised to the power of 2m elements, q is an odd prime power, m is a positive integer, and u is an indeterminate satisfying the deceptively simple relation u squared equals one. Because u squares to one rather than to zero, the ring is not a chain ring; its ideals do not stack neatly in a single linear hierarchy. This seemingly technical distinction matters enormously. Chain rings have long been the workhorse of code construction over finite rings, but non-chain rings of this type offer a richer internal structure, and the new work shows how to harvest that richness for quantum coding purposes.
The central obstacle in building quantum codes from classical codes is that a quantum code cannot be assembled from just any classical code. The most productive construction routes pass through the so-called dual-containing condition: a classical code must contain its own dual, or more precisely its Hermitian dual, before it can be converted into a quantum stabilizer code. Verifying and engineering this condition directly over an unfamiliar ring is difficult. The Chinese team’s first key move is to define a class of Gray maps, functions that translate codewords over the ring R into codewords over the much better understood finite field with q to the 2m elements. Crucially, these maps are designed to preserve the Hermitian dual-containing property. If a linear code over the ring contains its Hermitian dual, then its Gray image is a linear code over the field that also contains its Hermitian dual. The property survives the journey across the map, and that survival is what makes the whole construction work.
Once the Gray maps are in place, the Hermitian construction takes over. This classical technique, rooted in the pioneering work of Calderbank, Rains, Shor, and Sloane in the late 1990s, converts a classical code that contains its Hermitian dual into a quantum code over a smaller alphabet. Applied to Hermitian dual-containing constacyclic codes over the ring R, the construction yields a new class of q raised to the m-ary quantum codes. Constacyclic codes are a natural generalization of cyclic codes: shifting a codeword cyclically multiplies it by a fixed constant lambda rather than leaving it unchanged. This extra flexibility, controlled by the unit u in the new setting, expands the family of available codes well beyond what cyclic codes alone can offer.
The second major contribution concerns primitive quantum BCH codes, an important family with strong distance properties. The authors take the Hermitian dual-containing u-constacyclic codes over R, apply the Gray maps to obtain their images over the field, and then extract the subfield subcodes of those images. A subfield subcode is obtained by restricting a code over a large field to symbols drawn from a smaller subfield, a process that typically improves the code’s minimum distance and produces parameters of genuine practical interest. Through this route, the paper determines a family of q-ary primitive quantum BCH codes, extending a line of research that stretches back to the influential work of Aly, Klappenecker, and Sarvepalli on quantum and classical BCH codes.
The third strand of the paper introduces a different type of map with a different destination. Instead of mapping Hermitian dual-containing codes over R to Hermitian dual-containing codes over the field, this second class of maps converts the Hermitian dual-containing property over the ring into the trace dual-containing property over the field. The trace dual-containing condition is the entry ticket for the Symplectic construction, an alternative route to quantum codes that produces codes over the smaller alphabet of size q raised to m. Using this second pipeline, the authors obtain yet another class of q raised to the m-ary quantum codes from the same pool of Hermitian dual-containing u-constacyclic codes over R. Two independent mechanisms, Hermitian and Symplectic, now feed off the same algebraic source, effectively doubling the harvest.
The technical machinery underlying these results is worth appreciating. A constacyclic code of length n over R can be represented as an ideal in a quotient ring of polynomials, and over rings of the form F plus uF the polynomial x raised to n minus lambda factors in a way that permits a complete description of all such codes through their generating polynomials. The Hermitian dual of such an ideal is again an ideal, described by a reciprocal polynomial relationship, and the dual-containing condition translates into divisibility constraints among the generators. The Gray maps then act coordinate-wise, expanding each ring symbol into a pair or block of field symbols, and the careful design of the maps ensures that the Hermitian inner product relations are maintained throughout. This interplay between ring-theoretic ideal structure, polynomial algebra, and linear maps over finite fields is the engine room of the entire paper.
What makes the contribution notable within the field is its place in a research trajectory that the same community has been steadily building. Tang, Zhu, Kai, and Ding produced early quantum codes from dual-containing cyclic codes over finite rings in 2016. Subsequent work by Tang and colleagues extended the approach to constacyclic codes over polynomial residue rings and to rings of the form F plus uF in characteristic two. Other groups, including Wang, Kai, Sun, and Zhu, explored Hermitian dual-containing constacyclic codes over rings of the form F plus vF with q squared elements. The new paper pushes the program into the case where the base field has q raised to 2m elements and the nilpotent-style indeterminate u squares to one rather than to zero, a combination that had not been systematically treated with both Hermitian and Symplectic constructions in parallel.
The practical significance of new code families lies in their parameters. A quantum code is characterized by its length, its dimension, and its minimum distance, the latter determining how many qubit errors it can correct. Codes with favorable combinations of these three numbers are scarce, and tables such as Markus Grassl’s codetables.de track the best known bounds. Every new construction that produces codes with competitive parameters enriches the toolbox available to theorists designing fault-tolerant protocols, and the authors report that the quantum codes emerging from their constructions include codes with good parameters, alongside families that are new additions to the known landscape of quantum error-correcting codes.
The work also carries conceptual weight for the mathematics of coding theory itself. Finite rings once sat at the periphery of coding research, viewed as curiosities compared to finite fields, but three decades of development have established them as a fertile source of classical codes with unexpected structure. The present study strengthens the bridge between ring-based classical coding and quantum stabilizer theory by demonstrating that dual-containing properties, the crucial currency of quantum constructions, can be transported across carefully chosen maps without loss. Each new bridge of this kind means that a larger body of classical algebraic knowledge can be repurposed for quantum applications, a pattern that has repeatedly accelerated progress in the field.
The paper also reflects the collaborative and well-supported state of Chinese research in quantum information mathematics. The work was supported by multiple grants from the National Natural Science Funds of China, together with funding from the Natural Science Foundation of Anhui Province and several provincial programs supporting research teams and young scientists. The authors acknowledge Doctor Sun Zhonghua for helpful suggestions that improved the presentation of the paper, and they declare no competing financial interests.
For a field racing toward practical quantum computers, incremental algebraic advances of this kind accumulate into real capability. Fault-tolerant quantum computation will demand families of error-correcting codes tailored to hardware constraints, and the mathematical repertoire from which such codes can be drawn determines how much design freedom engineers ultimately possess. By showing that finite non-chain rings of the form F plus uF, with u squared equal to one, can serve as reliable factories for quantum codes through both Hermitian and Symplectic constructions, Tang, Xu, Yao, and Kai have widened that repertoire in a rigorous and reusable way. The study appeared in Quantum Information Processing, volume 25, article number 305, after being received in November 2025 and accepted in August 2026, and it stands as a further demonstration that the deepest resources for protecting quantum information often lie in the oldest and most classical branches of algebra.
Subject of Research: Construction of quantum error-correcting codes from Hermitian dual-containing constacyclic codes over finite non-chain rings of the form F plus uF, using Gray maps, the Hermitian construction, and the Symplectic construction.
Subject of Research: Technology and Engineering
Article Title: Quantum codes from constacyclic codes over finite non-chain rings
Article References: Tang, Y., Xu, H., Yao, T., & Kai, X. (2026). Quantum codes from constacyclic codes over finite non-chain rings. Quantum Information Processing, 25(9), Article 305. https://doi.org/10.1007/s11128-026-05334-7
Image Credits: AI Generated
DOI: 10.1007/s11128-026-05334-7
Keywords: quantum codes, constacyclic codes, finite non-chain rings, Hermitian construction, Symplectic construction, Gray maps, quantum BCH codes, dual-containing codes, finite rings, quantum error correction
Cite Scienmag News
APA
MLA
Chicago
Katie Riggs. (September 4, 2026). Quantum Codes Derived from Constacyclic Codes over Non-Chain Finite Rings. Scienmag. https://scienmag.com/quantum-codes-derived-from-constacyclic-codes-over-non-chain-finite-rings/
Katie Riggs. “Quantum Codes Derived from Constacyclic Codes over Non-Chain Finite Rings.” Scienmag, 4 September 2026, https://scienmag.com/quantum-codes-derived-from-constacyclic-codes-over-non-chain-finite-rings/. Accessed 4 September 2026.
Katie Riggs. “Quantum Codes Derived from Constacyclic Codes over Non-Chain Finite Rings.” Scienmag. September 4, 2026. https://scienmag.com/quantum-codes-derived-from-constacyclic-codes-over-non-chain-finite-rings/
Copy citation
Download RIS
Tags: algebraic code constructionalgebraic construction of quantum codesalgebraic structures in quantum error correctionconstacyclic codeserror-correcting codes in quantum informationfinite field algebrafinite fields in quantum computingHefei research in quantum codesHefei research on quantum codesmathematical pipeline for quantum code designmathematical pipeline for quantum codesnon-chain finite ringsnon-chain ring propertiesquantum code developmentquantum coding theoryQuantum Computingquantum error correctionquantum information protectionsuperposition error correctionsuperposition error protectionu-squared equals one ring structure
