🔢 mathematics

Extended and Entanglement-assisted Quantum Quasi-twisted Codes

This paper introduces a novel approach utilizing one-generator quasi-twisted codes of index 3 and their extended versions to construct binary stabilizer quantum codes and maximal-entanglement entanglement-assisted quantum codes with improved and optimal parameters.

Original authors: Akram Saleh, Mohammad Reza Soleymani

Published 2026-07-10

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Akram Saleh, Mohammad Reza Soleymani

Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the internet of the future isn't just sending emails, but teleporting thoughts. To make that work, we need a way to protect those fragile thoughts from getting scrambled by the universe's background noise. This is where Quantum Error-Correcting Codes come in. Think of them as a super-strong, magical bubble wrap for information. If a bit of data gets bumped, the bubble wrap knows exactly how to fix it without popping the whole package.

For a long time, scientists have been trying to build these bubbles using a specific type of mathematical structure called Quasi-Cyclic (QC) codes. It's like building a wall out of identical, repeating bricks. But sometimes, the wall needs to be more flexible. That's where this paper steps in.

The New, Bigger Bricks

The authors, Akram Saleh and Mohammad Reza Soleymani, decided to upgrade the construction kit. Instead of just using the standard repeating bricks, they introduced a more complex family called Quasi-Twisted (QT) codes.

Imagine a standard brick wall where every row is just a copy of the one above it. Now, imagine a "Quasi-Twisted" wall where, as you move up a row, the bricks don't just copy; they twist and shift in a specific, rhythmic pattern. The authors focused on a specific version of this "twist" called index 3. It's like having three distinct lanes of traffic that all twist together in a synchronized dance.

The "Self-Checking" Superpower

Here's the tricky part: to turn these mathematical walls into quantum bubble wrap, the code has to be self-orthogonal. In plain English, this means the code has to be its own mirror image in a very specific way. If you try to build a quantum code with a wall that doesn't match its own reflection, the whole thing collapses.

The paper shows that by taking these "index 3" twisted codes and adding a special extension (basically tacking on a few extra "guardian" bits at the end), they can force the code to become self-orthogonal. It's like adding a final, perfect capstone to a bridge that locks the whole structure into place, ensuring it won't wobble.

What they found: By using this extension trick, they successfully built several new stabilizer quantum codes. These are the "standard" quantum codes that don't need any extra help. The paper lists specific examples, like a code that can protect 7 logical bits of information using 18 physical bits, with a safety margin (distance) of 4. They also found even bigger ones, like a code protecting 102 bits using 129 physical bits.

The "Entanglement" Shortcut

But what if you have a code that isn't self-orthogonal? What if the wall doesn't match its reflection? In the past, you'd have to throw that code away.

Enter Entanglement-Assisted Quantum Error-Correcting Codes (EAQECCs). This is the paper's second major trick. Instead of demanding the code be perfect on its own, the authors suggest using a "shared secret" between the sender and receiver. Think of it like two people holding a pair of magic dice that always land on the same number, no matter how far apart they are. This "shared entanglement" acts as a bridge, allowing them to use codes that wouldn't work otherwise.

The authors used their twisted codes to design maximal-entanglement codes. This is the "gold standard" of this method, where the code uses the maximum possible amount of shared magic dice to fix errors. They proved mathematically that their specific twisted codes could generate these maximal-entanglement codes.

The Results:
The team didn't just theorize; they ran the numbers using powerful computer software called Magma.

They found a code with parameters [[15, 2, 6; 13]]. This means it uses 15 physical bits to protect 2 logical bits, has a safety distance of 6, and requires 13 units of shared entanglement.
They confirmed these are "maximal-entanglement" codes, meaning they are using the entanglement as efficiently as possible for that specific setup.

What They Didn't Do (and What They Ruled Out)

It's important to know what this paper didn't do. They didn't claim to have found a code that works for every possible situation. They didn't say their method is the only way to build quantum codes. They specifically focused on index 3 twisted codes and their extensions. They didn't try to extend index 2 codes (though others have done that before) or index 4 codes in this specific study.

They also didn't claim these codes are "solved" for all future quantum computers. They are "good" and "optimal" based on current comparisons with known databases, but the field is always moving.

The Bottom Line

The paper proves that by taking a specific, slightly twisted type of mathematical code and adding a few extra "guardian" bits, you can create a sturdy foundation for quantum error correction. You can either use this foundation to build standard, self-checking quantum codes, or you can use it to build super-efficient codes that rely on shared entanglement.

The authors have shown that this specific "index 3" twist is a fertile ground for finding new, high-quality codes. They've provided the blueprints and the computer-verified examples, showing that this approach yields results that are as good as, or better than, what was known before. It's a solid step forward in the quest to build a noise-proof quantum internet.

Technical Summary: Extended and Entanglement-assisted Quantum Quasi-twisted Codes

Problem Statement
The construction of high-performance Quantum Error-Correcting Codes (QECCs) and Entanglement-Assisted Quantum Error-Correcting Codes (EAQECCs) remains a critical challenge in quantum information theory. A primary constraint in constructing stabilizer QECCs from classical linear codes is the requirement for the classical code to be Hermitian self-orthogonal. While Quasi-Cyclic (QC) codes have been extensively utilized to meet this requirement, they represent a specific subset of the broader class of Quasi-Twisted (QT) codes. Furthermore, existing methods often struggle to optimize code parameters or maximize entanglement utilization without strict self-orthogonality constraints. This paper addresses the need to extend the scope of code construction beyond index-2 QC codes to index-3 QT codes and to develop techniques that preserve self-orthogonality under extension while enabling maximal-entanglement EAQECCs.

Methodology
The authors propose a dual generalization of prior research by focusing on one-generator $\lambda$ -quasi-twisted (QT) codes of index 3 over the finite field $\mathbb{F}_{q^2}$ . The methodology proceeds in three main stages:

Algebraic Framework: The study defines a family of 1-generator $\lambda$ -QT codes of length $3m$ and index 3. The generator matrix is structured as $G = (g(x), g(x)f(x), g(x)u(x))$ , where $g(x)$ divides $x^m - \lambda$ . The authors establish conditions for Hermitian self-orthogonality, specifically requiring $\lambda^{q+1} = 1$ and the divisibility condition $g^{\perp q}(x) \mid g(x)$ .
Code Extension: The paper introduces an extended construction technique. By appending specific rows to the generator matrix based on codewords from the Hermitian duals of the component codes, the authors create an extended code $C'$ . They prove that if specific conditions regarding the Hamming weight (or characteristic $p$ ) of these appended vectors are met, the extended code $C'$ retains Hermitian self-orthogonality. This allows the derivation of stabilizer QECCs with improved parameters (increased length and dimension).
Entanglement-Assisted Construction: For cases where self-orthogonality is not strictly required or to maximize entanglement, the authors analyze the rank of the matrix $HH^\dagger$ (where $H$ is the parity-check matrix). They derive algebraic conditions involving the spectrum of specific matrix products to ensure $HH^\dagger$ is full-rank. This condition guarantees the construction of maximal-entanglement EAQECCs, where the number of required entangled ebits ( $c$ ) equals $n-k$ .

Key Contributions

Generalization of Code Class: The work extends previous research on index-2 QC codes to index-3 QT codes, a broader class that naturally encompasses index-2 cases when a component is zero.
Self-Orthogonal Extension: A novel extension method is presented that preserves the Hermitian self-orthogonality of 1-generator index-3 QT codes. This enables the systematic construction of stabilizer QECCs with parameters $[[3m+3, m+2\deg(g(x))-3, d]]_q$ .
Maximal-Entanglement EAQECCs: The paper provides specific algebraic criteria to construct maximal-entanglement EAQECCs from this QT code family. It demonstrates that these codes can achieve parameters $[[3m, m-\deg(g(x)), d; 2m+\deg(g(x))]]_q$ and $[[3m, 2m+\deg(g(x)), d^\perp_H; m-\deg(g(x))]]_q$ .
Computational Verification: Using the Magma algebraic software, the authors computed specific instances of these codes over $\mathbb{F}_4$ (quaternary codes) to generate binary quantum codes.

Results
The authors present numerical results derived from extended quaternary QT codes with index 3.

Stabilizer Codes: Several binary stabilizer QECCs with improved parameters were constructed. Notable examples include:
- $[[18, 7, 4]]_2$ derived from a $[15, 4, 8]_4$ code.
- $[[66, 31, 9]]_2$ derived from a $[63, 16, 22]_4$ code.
- $[[81, 42, 8]]_2$ derived from a $[78, 18, 32]_4$ code.
  These results were compared against existing tables of best-known linear codes (e.g., [25]), showing that the constructed codes attain optimal or near-optimal parameters for their respective lengths and dimensions.
EAQECCs: A specific example of a maximal-entanglement EAQECC was constructed with parameters $[[15, 2, 6; 13]]_2$ , utilizing 13 entangled ebits.

Significance and Claims
The paper claims that its primary significance lies in the successful adaptation of code extension techniques to the broader class of index-3 QT codes. By doing so, it overcomes limitations found in previous works restricted to index-2 QC codes. The authors assert that this approach yields "optimal quantum codes" and "good maximal-entanglement EAQECCs." The work demonstrates that the QT framework is a robust foundation for generating quantum codes with enhanced parameters, offering a practical pathway to improve quantum communication reliability through both stabilizer and entanglement-assisted mechanisms. The study concludes that these constructions provide a dual generalization that effectively expands the library of available quantum codes with superior performance characteristics.

The New, Bigger Bricks

The "Self-Checking" Superpower

The "Entanglement" Shortcut

What They Didn't Do (and What They Ruled Out)

The Bottom Line

More like this