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.

The work, published in the journal Quantum Information Processing by Ruihu Li and Yang Liu of Air Force Engineering University in Xi’an, Yuezhen Ren of Xi’an Polytechnic University, and Chaofeng Guan of Zhengzhou University, establishes a systematic correspondence between symplectic subspaces—geometric structures living inside the symplectic group over finite fields—and quaternary additive codes, the algebraic objects that encode the parameters of entanglement-assisted stabilizer codes. This correspondence is more than an aesthetic curiosity. It provides a constructive bridge that allows the authors to translate long-standing open problems about optimal EAQECCs into geometric questions about subspaces, where powerful counting and classification techniques become available. In doing so, the team has resolved several open problems concerning optimal entanglement-assisted codes and entanglement-assisted quantum maximum distance separable codes, a class of codes that achieve the best possible trade-off between length, dimension, and error-correcting capability.

To appreciate why this matters, it helps to trace the lineage of the field. Quantum error correction was born in the mid-1990s, when Peter Shor demonstrated in 1995 that a quantum state could be protected by spreading it across nine physical qubits, and Andrew Steane independently showed shortly afterward that error-correcting ideas from classical coding theory could be imported into the quantum setting. The modern framework of stabilizer codes, crystallized in Daniel Gottesman’s 1997 doctoral thesis, recast the problem in the language of the Pauli group: quantum states are protected by measuring operators that form an abelian subgroup, the stabilizer, whose eigenvalues reveal the syndrome of an error without revealing the encoded information. In 1998, Calderbank, Rains, Shor, and Sloane made a decisive connection to classical coding theory by showing that stabilizer codes over qubits correspond to self-orthogonal additive codes over the finite field GF(4). This correspondence turned the search for good quantum codes into a problem about classical codes satisfying a self-orthogonality constraint, and it has driven the field ever since.

But the self-orthogonality requirement is a straitjacket. Requiring the stabilizer to be an abelian group means the associated classical code must be self-orthogonal with respect to a suitable inner product, and many excellent classical codes fail that test. Entanglement assistance, introduced by Todd Brun, Igor Devetak, and Min-Hsiu Hsieh in a landmark 2006 paper in Science, removes this restriction. The central idea is elegant: if the stabilizer generators fail to commute, the anticommuting parts can be absorbed by sharing pre-existing entangled pairs—ebits—between the sender and receiver. With a supply of entanglement, essentially any classical quaternary code, self-orthogonal or not, can be converted into a quantum code. An EAQECC with parameters [[n, k, d; c]] encodes k logical qubits into n physical qubits, corrects errors of weight up to the floor of (d−1)/2, and consumes c shared ebits in the process. The entanglement acts as a catalytic resource, purchased in advance and consumed to buy superior error-correcting performance.

The cost of that resource makes the parameter c a central object of study. Researchers including Mark Wilde and Todd Brun derived optimal entanglement formulas that determine the minimum number of ebits a code needs, while Chi-Kwong Lai and collaborators developed duality theories and linear-programming bounds tailored to the entanglement-assisted setting. A rich landscape of bounds—the quantum Singleton bound, the quantum Hamming bound, and entanglement-assisted variants—governs what parameter triples are achievable, and codes that meet these bounds with equality are prized as optimal. Entanglement-assisted quantum maximum distance separable codes, or EAQMDS codes, are the quantum analogues of the celebrated classical MDS codes: they saturate the Singleton bound, meaning their minimum distance is as large as algebraically possible for their length and dimension. Constructing such codes explicitly, for many different lengths and over many field sizes, is one of the most active pursuits in quantum coding theory, and one where the new work makes its most striking contribution.

The key technical insight of the new paper lies in how it characterizes EA stabilizer codes. In the additive-code picture, an entanglement-assisted code is built from a pair of codes C and D over GF(4), or equivalently from a single additive code together with information about its symplectic dual. The number of ebits required, the dimension of the encoded space, and the minimum distance all translate into combinatorial properties of these codes. What Li and colleagues show is that these properties can be understood through the geometry of the symplectic group Sp(2m, q), the group of linear transformations preserving a symplectic form on a 2m-dimensional vector space over a finite field. Subspaces of this vector space come in families classified by their dimension and by how they intersect their own symplectic orthogonal complements—whether they are totally isotropic, nonisotropic, or something in between. The authors establish precise relations between such symplectic subspaces and the quaternary additive codes arising in EAQECC constructions, allowing parameters of EA stabilizer codes to be read off directly from geometric data.

This geometric dictionary pays off immediately. Counting arguments over families of symplectic subspaces—an approach pioneered by Zhexian Wan in his monograph on the geometry of classical groups over finite fields, and long a staple of finite-geometry-based coding constructions—let the researchers establish the existence of EAQECCs with parameter sets that had eluded previous constructions, and in several cases to prove optimality where only bounds existed before. The work also builds on the authors’ own earlier discoveries: in 2023, Guan, Li, Liu, and Ma showed in IEEE Transactions on Information Theory that certain quaternary additive codes genuinely outperform their linear counterparts, a finding that highlighted how relaxing linearity enlarges the space of good codes. The additive setting is technically delicate—quaternary additive codes need not be linear over GF(4), which complicates classical duality theory—but the symplectic geometric framework embraces them naturally, since symplectic orthogonality is defined at the level of vector spaces over the base field GF(2).

Beyond resolving existence and optimality questions, the authors point to a second, practical payoff: the design of encoding and decoding quantum circuits for EA stabilizer codes. The stabilizer formalism translates directly into Clifford-group circuits, with each stabilizer generator corresponding to a measured operator implemented by controlled-Pauli gates, and the symplectic representation makes these circuits explicit: Clifford operations act as symplectic transformations on the binary representation of Pauli operators. By grounding EAQECC parameters in symplectic subspace structure, the new framework provides a cleaner route from a code’s abstract definition to the concrete circuitry a hardware engineer would deploy, potentially easing the path from mathematical construction to working fault-tolerant logic.

The broader context makes the contribution timely. As quantum processors scale from hundreds toward thousands of qubits, the overhead of error correction dominates resource estimates for useful quantum computation. Entanglement-assisted schemes occupy an interesting position in this economy: they demand a communication and entanglement-distribution infrastructure, since ebits must be established between communicating parties before coding begins, but in exchange they relax the algebraic constraints on the underlying classical codes, often yielding shorter codes or larger minimum distances for the same block length. In settings where entanglement distribution is feasible—such as future quantum networks and quantum repeater chains, where entanglement is precisely the commodity being distributed—EAQECCs could be the natural encoding layer. Knowing exactly which parameter sets are attainable, and which are optimal, tells network architects what protection they can buy for a given budget of qubits and ebits.

The paper also contributes to a longer-running conversation about fundamental bounds. Recent years have seen intense scrutiny of the quantum Singleton bound and its entanglement-assisted generalizations, including entropic proofs by Markus Grassl, Florian Huber, and Andreas Winter, and results showing that entanglement can allow codes to beat the ordinary Singleton bound. Precise constructions that saturate or approach these bounds, anchored in firm geometric ground as the new work proposes, sharpen our understanding of the ultimate limits of quantum communication. With the field’s standard reference tables, maintained by Grassl at codetables.de, still containing many open entries for EAQECC parameters, techniques that systematically generate new codes and prove their optimality are exactly what the community needs to fill in the map.

The research was supported by the National Natural Science Foundation of China under Grant No. U21A20428 and by the Natural Science Foundation of Shaanxi Province. It arrives as part of a visible surge of mathematical sophistication in quantum coding theory, where finite geometry, combinatorial design theory, and algebraic curves over finite fields all supply construction tools. What distinguishes the present contribution is the systematic nature of the link it forges: rather than producing isolated parameter sets, it offers a framework in which entire families of entanglement-assisted codes can be analyzed, compared, and optimized through the lens of symplectic geometry. As the demand for efficient, hardware-compatible error correction intensifies, such unifying mathematical structures may prove to be among the most valuable assets the field has.

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.

The challenge arises from the unusual nature of quantum information. A classical bit can be copied, measured and retransmitted relatively directly, but an unknown quantum state cannot be cloned without disturbing it. Quantum networks therefore rely on methods such as entanglement distribution, teleportation and quantum error correction rather than simply amplifying a weakening signal. Optical fibre is particularly hostile to single photons, with transmission losses accumulating exponentially as distance increases. Conventional repeaters can divide a long channel into shorter segments, but many proposed architectures require classical signals to travel backward through the network before a repeater knows whether an operation succeeded. Over thousands of kilometres, those round-trip communications introduce latency and can reduce the rate at which useful quantum states are delivered. One-way repeaters seek to avoid that bottleneck by processing incoming quantum information continuously, without waiting for two-way confirmation. That makes them faster in principle, but it also places a heavy burden on the encoding scheme: the system must tolerate loss and operational errors as the quantum state moves forward from node to node.

The architecture examined in the study combines photonic tree structures with a small stabilizer code. In broad terms, a photonic tree spreads information across multiple photons arranged in a branching pattern. If some photons disappear in transit, measurements on surviving branches can provide enough information to reconstruct the logical state or determine which parts of the encoded state have been erased. The outer stabilizer code then adds another layer of protection against errors introduced during processing and re-encoding. Stabilizer codes work by measuring carefully chosen parity-like properties of a group of physical qubits. These measurements, called a syndrome, reveal information about the error without directly revealing the logical quantum state. A decoder uses the syndrome to infer a correction operation. The design is therefore not simply sending one photon through a fibre; it is distributing a logical qubit across multiple physical carriers and repeatedly using structured measurements to keep that logical information intact.

The researchers compared two quantum codes that encode one logical qubit while correcting a single physical-qubit error. The five-qubit code, written as [[5,1,3]], is the smallest quantum error-correcting code capable of correcting arbitrary single-qubit errors. The notation indicates a block of five physical qubits encoding one logical qubit, with a distance of three, meaning that the code can detect errors affecting up to two qubits and correct any single-qubit error. The Steane code, written as [[7,1,3]], also has distance three but uses seven physical qubits. At first glance, that larger block appears disadvantageous. More qubits mean more photons or hardware operations, a larger amount of information to manage, and more opportunities for faults. Yet the study focuses on a subtle structural difference between the codes: the Steane code has an underpopulated syndrome space, whereas the five-qubit code is described as having a fully populated syndrome space. That unused capacity in the Steane code can be exploited by its decoder to identify and correct all single-qubit erasures, along with a subset of two-qubit errors.

An erasure is different from an ordinary unknown error. In an erasure event, the system knows that a particular qubit has been lost, even though it does not know the state that qubit carried. Photon loss and failed detection often produce this kind of information: a detector registers no photon, or the architecture identifies a missing branch in the photonic tree. Because the location of the missing qubit is known, an erasure can be easier to correct than an arbitrary error, whose location and type must both be inferred. The Steane code’s syndrome structure gives the decoder additional room to exploit that knowledge. According to the study, this lets the code correct every single-qubit erasure and some cases involving two-qubit errors. The distinction matters in a repeater because loss is not a rare edge case but a central feature of long-distance optical transmission. A code that uses information about where the loss occurred can therefore deliver a higher logical transmission success rate, even if it requires more physical qubits per encoded message.

The study’s central comparison involved the re-encoding error rate, represented by εr. This parameter describes the probability that an error is introduced when a quantum state is re-encoded at a repeater node. Re-encoding is essential in a one-way architecture: each node must transform the incoming information into a form that can be forwarded, and imperfect gates, measurements, photon sources and detectors can all corrupt the process. The simulations found that the Steane-based repeater became particularly advantageous at realistic re-encoding error rates of at least 0.05 per cent. At εr = 0.2 per cent, the performance gap was striking in the researchers’ stated cost comparison. The Steane design maintained a competitive threshold out to 5,000 kilometres, while the five-qubit baseline reached only about 800 kilometres. “Cost” here refers to the resource burden required to achieve useful transmission performance, rather than a direct financial price. That burden can include the number of physical qubits, photons, operations and repeater resources needed to preserve a logical message.

The result illustrates why quantum-network design cannot be judged by qubit count alone. The five-qubit code has an unbeatable minimality advantage, but a code that is smaller on paper may become less efficient when its limited syndrome structure leaves it less able to handle the dominant failure modes of the network. The Steane code pays an overhead by encoding the logical qubit into seven rather than five physical qubits, but its stronger erasure-handling capability can compensate for that overhead as distances and operational noise increase. The finding is especially relevant to hybrid systems that combine photonic loss tolerance with discrete-variable quantum error correction. Such systems are designed around the reality that no single layer can solve every problem: photonic trees address transmission loss and known missing components, while stabilizer codes address residual errors in the surviving quantum information. The study’s algorithms include procedures for constructing logical states, generating error-correction operators, producing flag-based correction tables and building erasure-correction tables, providing a computational framework for comparing these layers.

Still, the findings should be read as a modelling result rather than a demonstration that quantum messages can now be sent 5,000 kilometres. The article reports no experimental data, and its data-availability statement says that no datasets were generated or analysed during the study. A practical repeater would need reliable single-photon sources, high-efficiency detectors, low-loss optical interfaces, accurate synchronisation and quantum operations with error rates low enough for the assumed model. The authors also acknowledge that the Steane code’s larger block size creates additional overhead, even as its erasure-correction capacity improves robustness. Real devices may experience correlated errors, imperfect photon distinguishability, memory decay, detector dark counts and hardware-specific noise patterns that are not captured by a single re-encoding parameter. Future experiments will need to test whether the predicted advantage survives those complications. Even so, the work points to a provocative route for quantum networking: rather than always chasing the smallest possible code, engineers may gain more by matching a code’s syndrome structure to the actual pattern of photon loss and repeater faults. For one-way architectures, that could turn a modest increase in hardware into a major extension of communication distance.

A new computational study has brought physicists closer to identifying a realistic material system capable of hosting one of the strangest predicted forms of quantum matter: a fracton quantum spin liquid. The proposed phase, described in Nature Communications, combines nearly immobile quasiparticles known as fractons with collective excitations that behave like emergent photons. Although the work does not report an experimental discovery of fractons, it shows that the unusual phase may arise in a more physically plausible solid-state model rather than only in highly abstract mathematical theories.

Fractons are quasiparticles whose movement is severely restricted by the underlying rules of a quantum system. Unlike ordinary particles, which can generally travel through a material when supplied with enough energy, an isolated fracton may be unable to move at all. In some theoretical models, a fracton can change position only when another fracton participates in the process, or when several excitations combine in a carefully constrained way. This unusual mobility restriction has attracted interest because it could help protect quantum information from local disturbances, potentially offering a route toward more robust information storage.

The new study focuses on a quantum spin liquid, an exotic state in which the magnetic moments associated with atoms do not settle into a conventional pattern, even at temperatures approaching absolute zero. In an ordinary magnet, neighboring spins tend to align or arrange themselves in a repeating structure. In a quantum spin liquid, competing interactions and quantum fluctuations prevent this long-range order. The spins remain highly entangled and continue to fluctuate, creating a collective state whose behavior cannot be understood by examining individual particles in isolation.

The researchers investigated a two-dimensional spin-1 model designed to reproduce the interactions that could support a fracton phase. The model is described as “gapless,” meaning that its lowest-energy excitations can occur at arbitrarily small energies rather than being separated from the ground state by a finite energy gap. This property is important because it allows the system to support long-wavelength collective modes. Among these modes are emergent photons, quasiparticles that resemble the photons of ordinary electromagnetism even though they arise from coordinated fluctuations of microscopic spins rather than from the electromagnetic field itself.

Fractons have previously been predicted most successfully using generalized gauge field theories, including rank-2 U(1) gauge theories. Gauge theories provide an elegant language for describing constraints, conservation laws and emergent forces, but they do not automatically correspond to a material that can be synthesized in a laboratory. A central challenge has therefore been to translate the mathematical idea of a fracton into a microscopic model built from realistic degrees of freedom, such as atomic spins and their interactions. The study led by Johannes Reuther and Nils Niggemann addresses this challenge by connecting the abstract gauge-theory description to a quantum solid-state Hamiltonian.

The calculations were performed using numerical methods that account for quantum effects rather than treating the spins as fixed classical arrows. The team used an improved solid-state modeling approach, including a newly developed Green’s-function Monte Carlo framework, or GFMC, to examine the system’s ground state and its excitations. Numerical simulations of strongly interacting quantum systems are notoriously difficult because the number of possible configurations grows rapidly with system size. Quantum entanglement further complicates the calculation, making it essential to compare several signatures of the proposed phase instead of relying on a single measurement.

One important signature came from the distribution of spin correlations in momentum space. Spin correlations describe how the orientation of one spin is related to that of another, while their Fourier transform converts this information from real space into momentum space. The resulting pattern can reveal hidden forms of order and characteristic constraints imposed by an emergent gauge structure. In the simulations, the correlation distribution produced by the spin-1 solid-state model was almost identical to the pattern expected from an established rank-2 gauge field theory. That agreement provides numerical evidence that the realistic model may belong to the same unusual quantum phase.

The simulations also indicate that quantum fluctuations do not necessarily destroy the fracton behavior. Earlier attempts to construct related models produced an unfavorable balance: when quantum effects were too strong, the proposed fracton phase disappeared; when they were too weak, the excitations behaved more like classical defects and lost the quantum properties needed for a genuine quantum spin liquid. The newly tuned interactions appear to occupy a narrower but more promising regime in which the unusual quasiparticles survive alongside quantum dynamics. This balance is crucial because a material must remain sufficiently quantum to exhibit emergent behavior while retaining enough structure to stabilize the phase.

The result could have implications beyond the search for an exotic state of matter. Because fractons are difficult to move independently, information encoded in their collective configurations may be less vulnerable to local noise than information stored in ordinary mobile excitations. This concept is related to ideas in topological quantum computing, where information is protected by global properties of a system rather than by the precise state of a single particle. However, the practical value of the proposed phase remains speculative. The calculations do not yet demonstrate a functioning memory, and significant theoretical and experimental obstacles must be overcome before fracton-based information storage becomes realistic.

The next step is to identify or engineer a physical platform that reproduces the required spin interactions. Candidate systems could include specially designed magnetic materials, engineered arrays of atoms or programmable quantum simulators. The researchers point particularly to Rydberg atom platforms, in which highly excited atoms are arranged and controlled with lasers. Because the interactions between Rydberg atoms can be adjusted and their positions monitored with high precision, such systems may provide a flexible environment for testing whether the predicted correlation patterns and excitation constraints can be observed directly.

An experimental detection would require more than seeing a single unusual excitation. Researchers would need to establish that the system supports the characteristic conservation laws, restricted mobility and momentum-space correlations associated with a fracton phase. They would also need to distinguish the proposed state from conventional magnetic order, finite-size effects or other types of quantum disorder. The computational results provide a target: if a material or simulator displays the predicted structure in its spin correlations and low-energy response, it could offer compelling evidence for a gapless fracton quantum spin liquid.

The study therefore represents a bridge between ambitious theoretical physics and the practical search for new quantum materials. Fractons remain unobserved, and the proposed phase has not yet been realized in a laboratory. Nevertheless, demonstrating that a two-dimensional spin-1 model can reproduce the fingerprints of a rank-2 gauge theory marks an important advance. It suggests that the strange combination of immobile quasiparticles, quantum spin-liquid behavior and emergent light may not be confined to abstract equations. With improved simulations and carefully engineered experiments, one of the most counterintuitive predictions in quantum matter could soon become testable.

Subject of Research: Computational modeling of a fracton quantum spin liquid and emergent photons in a two-dimensional spin-1 model

Article Title: Gapless fracton quantum spin liquid and emergent photons in a 2D spin-1 model

News Publication Date: 11-Jul-2026

Web References: https://doi.org/10.1038/s41467-026-74797-0

References: Nature Communications

Image Credits: HZB

Keywords

Fractons, quantum spin liquids, quantum magnetism, condensed matter physics, quantum mechanics, emergent photons, quantum materials, Green’s-function Monte Carlo, Rydberg atom simulators, topological quantum information

At the heart of the quantum computing challenge lies the extraordinary sensitivity of qubits—the fundamental units of quantum information. Unlike classical bits, qubits exploit the principles of quantum mechanics, existing in coherent superpositions of states and entangled correlations. However, these delicate states are perilously vulnerable to minuscule environmental fluctuations such as thermal variations, stray magnetic fields, or mechanical vibrations. Such perturbations cause decoherence, effectively collapsing the quantum information encoded within the qubit. Developing qubits that resist these disturbances is an urgent, unmet need in quantum technology.

One promising strategy to protect qubits involves the use of topologically ordered materials. These exotic phases of matter derive their remarkable stability from the global properties of their quantum wavefunctions rather than local symmetries. Accordingly, topological excitations—quasiparticles or modes arising from such order—experience protection against local noise, dramatically enhancing qubit resilience. Despite intensive research, naturally occurring materials exhibiting the necessary topological characteristics have proven elusive, restricting experimental realization and computational applications.

Traditionally, the engineering of topological quantum states has relied heavily on spin-orbit coupling, a relativistic quantum effect coupling an electron’s intrinsic spin to its orbital motion. Spin-orbit interactions can give rise to topological insulators and superconductors that host protected edge or surface states. Unfortunately, spin-orbit coupling is a relatively rare phenomenon and requires heavy elements or complex structures, significantly narrowing the pool of suitable materials and complicating device fabrication.

In this pioneering study, the research team sidesteps these limitations by unveiling a new quantum design principle centered on magnetism—a ubiquitous and well-understood interaction. By constructing an engineered Kondo lattice, where localized magnetic moments intricately interact with mobile conduction electrons, the researchers successfully generate topologically nontrivial quantum states. This approach creates zero-energy modes and correlation pumping mechanisms that are inherently stable against disorder and perturbations, key requirements for functional qubits.

Magnetism-based topological engineering affords a remarkable advantage: it opens an extensive array of candidate materials for exploration. Since magnetic interactions are inherent to numerous compounds and systems, from conventional magnets to transition metal oxides, this method dramatically broadens the horizon of quantum materials research. By leveraging widely available "ingredients," quantum hardware development can potentially accelerate and diversify, reducing dependence on rare or difficult-to-synthesize substances.

The team’s breakthrough is underpinned by meticulous experimental and theoretical analyses. They employed cutting-edge spectroscopic techniques and computational modeling to validate the existence of topologically protected zero modes within their designed lattice. These zero modes manifest as localized electronic states at the edges of the material, shielded by the collective quantum correlations emergent from magnetic coupling. This stability against external noise marks a transformative step toward fault-tolerant quantum computing architectures.

Complementing their material design, the researchers developed a computational tool capable of quantifying topological behaviour in candidate substances. This software enables high-throughput screening of materials, directly computing topological invariants and correlation functions essential to diagnose quantum resilience. Such computational frameworks are indispensable for guiding experimental efforts, offering predictive insights that streamline material synthesis and characterization.

By integrating magnetic interactions with engineered lattice geometry, the study heralds a powerful paradigm shift in topological quantum materials. The realization of robust zero-energy modes through magnetism redefines strategies for constructing qubits with intrinsic noise resistance. It implies that future quantum processors could be systematically built from more abundant and manipulable materials, paving the way for scalable quantum information platforms that transcend current physical constraints.

The implications resonate beyond quantum computing alone. The fundamental physics elucidated here deepen our understanding of correlated electron systems, Kondo lattice phenomena, and quantum phase transitions. Moreover, the approach may catalyze innovations in spintronics, quantum sensors, and other quantum-enabled technologies, where control over topological and magnetic properties is paramount.

Guangze Chen, postdoctoral researcher at Chalmers and lead author of the study, remarked on the significance: “Our method leverages magnetism—an everyday, widely accessible interaction—to induce robust topological quantum states. It is akin to baking with common ingredients instead of rare spices. This democratizes the search for resilient quantum materials and could revolutionize the landscape of quantum computing.”

The scientific paper, titled Topological Zero Modes and Correlation Pumping in an Engineered Kondo Lattice, was published in Physical Review Letters and represents a collaborative effort involving Chalmers University of Technology, Aalto University, and the University of Helsinki. This achievement sharply advances the quest for practical topological qubits, bringing the vision of stable, noise-resistant quantum computers closer to reality.

As quantum technology marches forward, discoveries like this illuminate the path to new generations of quantum devices. Employing magnetism as a cornerstone for robust quantum states not only expands the materials toolkit but also enhances the feasibility of integrating quantum components into functional, scalable architectures. The next era of quantum computing may well be grounded in this magnetic blueprint, where exotic quantum phenomena meet practical engineering to unleash transformational computational power.

Subject of Research: Not applicable

Article Title: Topological Zero Modes and Correlation Pumping in an Engineered Kondo Lattice

News Publication Date: 18-Mar-2025

Web References: http://dx.doi.org/10.1103/PhysRevLett.134.116605

References: Guangze Chen et al., "Topological Zero Modes and Correlation Pumping in an Engineered Kondo Lattice," Physical Review Letters, DOI: 10.1103/PhysRevLett.134.116605

Image Credits: Illustration: Jose L. Lado

Keywords

Quantum computing, topological excitations, magnetism, Kondo lattice, zero-energy modes, quantum materials, quantum coherence, topological quantum computing, spin-orbit coupling alternative, quantum stability, exotic quantum materials, computational materials science

Published in the esteemed journal Nature Communications, the study explores the delicate nature of quantum entanglement, the phenomenon that allows quantum particles to remain connected irrespective of distance. Quantum entanglement has been a subject of fascination in physics, lauded for its potential applications in secure communication, computation, and even the fundamental understanding of the universe. However, the fragility of these entangled states poses significant challenges, as they are prone to decay when subjected to external disturbances, such as background radiation, noisy instruments, or stray photons—common inconveniences in today’s quantum experimental setups.

The researchers, led by Professor Andrew Forbes, have managed to turn this narrative on its head by demonstrating that specific quantum states can retain crucial information even amid considerable environmental noise. Their approach hinges upon the concept of topology, a mathematical discipline that studies properties preserved under continuous transformations. By engineering quantum states with particular topological features, the team discovered a method to maintain quantum information integrity even when entanglement begins to dissipate. Forbes highlights that their findings underscore topology as a powerful resource in the realm of quantum information encoding, suggesting that it could render the transmission of quantum information more robust against disruptions.

It’s well acknowledged that traditional attempts to safeguard quantum entanglement have met with limited success, often relegating researchers to the theoretical or impractical. Yet, the innovative strategies proposed by the Wits team unlock new methodologies for preserving quantum data, demonstrating that engineering the quantum wave function can effectively stabilize quantum information. By manipulating the topological aspects of quantum states, the researchers aim to transform how quantum information is encoded, thus offering a robust framework against noise that permeates real-world applications.

As our understanding of quantum mechanics deepens, it becomes increasingly evident that harnessing this delicate balance between entanglement and information preservation is critical. With quantum entangled states being notoriously sensitive, any minor disturbance can render their linked status ineffective. However, the Wits team’s manipulation of quantum waveforms represents a paradigm shift in how scientists might approach quantum communication and computation, ushering in an era where quantum technology can thrive under realistic conditions.

Notably, the researchers have likened their technique to the digitization of quantum information. By employing distinct topological observables that represent binary states, the encoded quantum signals gain greater immunity against noise. In this framework, digital quantum systems could parallel the successes observed in classical computation and communication, opening a world of possibilities where quantum technologies become not only feasible but integral to the fabric of modern technology.

The applications of such a breakthrough are vast and varied. For instance, more stable quantum computers could yield enhanced processing speeds while bolstering security measures against cyber threats. Furthermore, medical imaging techniques that rely on quantum information may witness significant improvements, leading to sharper diagnostics and personalized healthcare solutions. The implications also extend to artificial intelligence systems, where the harnessing of entangled states could result in more sophisticated computational capabilities and decision-making processes.

In addition to the theoretical advancements, this research holds promise for tangible improvements in global quantum networks. The safeguarding of quantum communications from environmental noise is particularly tantalizing for industries reliant on extreme data security, such as finance and healthcare. Ensuring that data transfer remains secure despite the vicissitudes of the external environment could transform the landscape of secure communications.

Additionally, the willingness to explore such innovative avenues emphasizes the collaborative essence of contemporary scientific inquiry. The partnership between Wits University and Huzhou University embodies a growing trend in STEM fields where cross-border collaboration yields ground-breaking results that transcend cultural and geographical boundaries.

Professor Robert de Mello Koch, another key figure in the study, articulates the significance of their findings in demystifying the complex interconnectedness within quantum systems. By illustrating how topological properties can fortify quantum connections, he emphasizes that the journey to robust quantum technologies is becoming less encumbered by prior limitations. Rather than being constrained by the inherent fragility of quantum entanglement, researchers are now equipped with strategies to manipulate and preserve quantum states for practical use.

Moving forward, the implications of this research extend beyond the laboratory. The ability to overcome the obstacles posed by environmental noise challenges preconceived notions of operational limits within quantum technologies. As practical quantum applications draw nearer to realization, society might soon harness quantum networks and computing systems in ways previously deemed impossible.

Ultimately, this study serves as a beacon of hope and innovation, embodying the spirit of human ingenuity. As scientists navigate the complexities of quantum mechanics, the potential for transformative solutions becomes increasingly tangible. This groundbreaking work not only contributes to academic discourse but lays the foundation for a future where advanced quantum technologies may seamlessly integrate into everyday life.

The research signifies that we stand at the cusp of a quantum revolution, where discoveries are not merely theoretical but are stepping stones toward a practical reality. As researchers continue to unlock the mysteries of the quantum realm, the anticipated advancements could redefine what is achievable in technology, science, and even our understanding of the universe itself.

As the foundation of quantum technology fortifies, we find ourselves on the threshold of unprecedented possibilities, inspired by the tenacity and brilliance of minds that are daring to challenge the limits of current knowledge.

Subject of Research: Quantum information preservation through topological methods
Article Title: Topological rejection of noise by quantum skyrmions
News Publication Date: 26-Mar-2025
Web References: Nature Communications
References: Not applicable
Image Credits: Credit: Wits University

Keywords: Quantum computing, Quantum entanglement, Topology, Quantum noise, Quantum information, Secure communication, Advanced imaging technologies, Artificial intelligence, Digital quantum signals, Collaboration in science.