⚛️ quantum physics

Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q)PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance

This paper introduces Q(q,d), a novel family of q-ary non-CSS qudit stabilizer codes constructed from Singer difference sets and non-degenerate quadrics in PG(d,q), which achieve an asymptotic rate of one-half and demonstrate significant performance gains over the Steane code through rigorous structural theorems and Monte-Carlo simulations.

Original authors: Michel Kulhandjian, Lajos Hanzo

Published 2026-10-05

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Michel Kulhandjian, Lajos Hanzo

Original paper licensed under CC BY 4.0 (http://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

Quantum computers hold the promise of solving problems that are currently impossible for classical machines, from designing new medicines to cracking complex encryption. However, these machines are incredibly fragile. The information they store, carried by particles like atoms or photons, is easily disturbed by the slightest heat or vibration, causing the data to corrupt and the calculation to fail. To build a useful quantum computer, scientists must develop a way to protect this delicate information, much like wrapping a fragile artifact in layers of shock-absorbing foam. This protection is achieved through quantum error-correcting codes, which spread a single piece of information across many physical particles. If a few particles are disturbed, the code can detect the damage and fix it without ever looking at the information directly, which would destroy it.

For decades, researchers have focused on protecting bits of information that can only be in one of two states, similar to a coin that is either heads or tails. But nature offers more possibilities. Many physical systems, such as the spin of an atom or the path of a photon, can naturally exist in three, five, or even seven distinct states at once. Using these multi-state units, known as qudits, could allow quantum computers to pack more information into fewer particles and potentially withstand errors more effectively. The challenge has been finding a way to organize these complex states into a robust code. A new study by Michel Kulhandjian and Lajos Hanzo has successfully designed a new family of such codes, creating a mathematical blueprint that protects multi-state quantum information with remarkable efficiency.

The researchers built their new codes using a clever combination of two ancient mathematical ideas: the geometry of projective spaces and the patterns of difference sets. Imagine a vast, multi-dimensional grid where every point and every flat surface has a specific relationship to every other. The team used a special arrangement of points within this grid, known as a Singer difference set, which creates a highly ordered, repeating pattern. They then overlaid a second pattern derived from a shape called a non-degenerate quadric, which is a curved surface defined by a specific algebraic rule. By weaving these two patterns together, they created a parity-check matrix, a mathematical tool that acts as a set of rules for the quantum code. This matrix tells the system how to check for errors and how to correct them.

What makes this construction unique is that it works for any number of states, not just the standard two. The team proved that their method creates a valid code for any prime number of states, such as three, five, or seven. They discovered that the specific combination of the repeating point pattern and the curved surface pattern cancels out mathematical conflicts that usually prevent such codes from working. This cancellation allows the code to function without needing extra, pre-shared entangled particles, which are difficult to maintain in real-world conditions. The result is a self-contained system that can protect quantum information purely through its own internal structure.

The researchers tested their theory by calculating the exact properties of these codes for several specific cases. They found that for a system with five states, they could create a code that protects fifteen logical units of information using thirty-one physical particles. This code is powerful enough to correct any two errors that might occur simultaneously. In simulations, this five-state code performed dramatically better than the best-known standard code for two-state systems. When subjected to a high rate of random noise, the new code reduced the chance of a logical failure by a factor of seventy compared to the older standard. This improvement is significant because it means the new code can operate reliably in noisier environments where older codes would fail.

The study also revealed a surprising limitation. While the new codes work beautifully for systems with an odd number of states, they hit a hard ceiling when the number of states is even. Specifically, for the simplest case of two states, the code can only detect errors but cannot correct them. This finding rules out the idea that this specific mathematical construction could simply replace existing two-state codes; instead, it points toward a future where quantum computers use three, five, or seven states to achieve higher performance. The researchers also showed that their new codes are mathematically equivalent to a known type of classical communication pattern used in non-orthogonal multiple-access systems, bridging a gap between classical signal processing and quantum error correction.

In their simulations, the team observed a particularly useful behavior in the five-state code. When the noise level was high, the code never made a silent mistake where it corrected the data incorrectly. Instead, it always either fixed the error perfectly or admitted that the damage was too severe to fix. This "erase-don't-mistake" property is highly valuable for real-world applications, as it prevents the system from silently producing wrong results, which is often more dangerous than simply stopping to ask for a retransmission. The researchers confirmed these results through over one and a half million simulated trials, ensuring that the performance gains were real and not just a statistical fluke.

While the paper provides a complete mathematical proof for the existence and structure of these codes, the exact maximum distance they can correct for larger systems remains a subject for further investigation. The team proved that for a seven-state system, the code can correct at least eight errors, but they suspect it might be able to correct even more. They have also identified that the current method of decoding these codes, while effective, is not the fastest possible. The mathematical structure they uncovered suggests that even faster decoding algorithms, similar to those used in classical telecommunications, could be developed in the future to make these codes even more practical.

The work represents a significant step forward in the design of quantum error-correcting codes. By moving beyond the binary world of zeros and ones and embracing the richer landscape of multi-state systems, the researchers have opened a new path for building more robust quantum computers. Their findings suggest that the future of quantum computing may rely on these higher-dimensional codes to handle the inevitable noise of the physical world. The study provides a clear, mathematically rigorous foundation for building these codes, offering a concrete set of parameters that engineers can use to design the next generation of quantum hardware. As the field moves toward practical quantum machines, the ability to correct errors efficiently in multi-state systems will likely become a cornerstone of reliable quantum technology.

Technical Summary: Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d, q)

Problem Statement
The paper addresses the construction of structured, non-CSS (Calderbank-Shor-Steane) quantum error-correcting codes for qudits (quantum systems with $q$ levels, where $q$ is a prime power). While stabilizer codes derived from finite geometries and difference sets exist, there is a lack of constructions that simultaneously offer:

Explicit, closed-form parameters for logical dimension ( $k$ ).
Provable structural theorems regarding distance and cross-correlation.
A direct algebraic bridge to classical low-density spreading (LDS) signatures used in non-orthogonal multiple-access (NOMA) systems.
High performance in the qudit regime ( $q \ge 3$ ), avoiding the distance ceilings often found in binary ( $q=2$ ) or specific parity-driven regimes.

The authors specifically investigate the limitations of applying classical "Waterloo decomposition" techniques (which partition difference sets) to quantum stabilizer codes, noting that integer-lattice obstructions often vanish when reduced modulo the field characteristic $p$ , rendering standard entanglement-assisted (EA) lifting strategies ineffective.

Methodology
The authors propose a new family of codes, denoted $Q(q, d)$ , constructed over the projective geometry $PG(d, q)$ . The methodology relies on the following algebraic components:

Singer Difference Sets: The construction utilizes the Singer-circulant point-hyperplane incidence matrix $A$ of $PG(d, q)$ . The points and hyperplanes are indexed by the cyclic group $G = \mathbb{F}_{q^{d+1}}^* / \mathbb{F}_q^*$ .
Non-Degenerate Quadrics: A formal trace-of-square quadric indicator $\tau_Q$ is defined. For $q$ odd, $Q = \{z \in \mathbb{F}_{q^{d+1}}^* : \text{Tr}(z^2) = 0\}$ . This generates a circulant matrix $M_Q$ .
Parity-Check Matrix (PCM): The core construction defines the PCM as $H = (A \mid M_Q A)$ . This couples the incidence matrix with the quadric-derived circulant.
Cancellation Lemma: The authors prove that the symplectic deficit $S = H_x H_z^T - H_z H_x^T$ vanishes modulo $p$ because the difference-set order $(k-\lambda) = q^{d-1}$ is divisible by $p$ . This ensures $H$ is symplectic-isotropic, defining a valid stabilizer code without requiring pre-shared entanglement (i.e., $c=0$ ).
Structural Analysis: The paper employs tools from finite field theory, including the Chinese Remainder Theorem (CRT) decomposition of the group ring, Hamada-Smith rank formulas, and Witt-index theory for quadratic forms to analyze the code's properties.

Key Contributions

New Code Family $Q(q, d)$ : A non-CSS $F_q$ -ary stabilizer code family parameterized by prime power $q$ and dimension $d \ge 2$ .
Five Structural Theorems:
- Cross-Correlation Modular Constancy: For $q$ odd and $d \ge 3$ , the cyclic cross-correlation $\nu[k] = |E \cap (k-Q)|$ is congruent to $1 \pmod q$ .
- Two-Value Pattern: Under the same conditions, $\nu[k]$ takes exactly two values with a sharp difference of $q^{(d-1)/2}$ .
- CRT Zero-Count Theorem: The number of irreducible factors of $X^n-1$ over $\mathbb{F}_p$ for which the trace-zero indicator vanishes is exactly $(|F|-1)/2$ .
- Explicit Clifford Bridge: For $d=2$ , the authors construct an explicit Clifford gate $U_M = H^{\otimes n} CZ(M) H^{\otimes n}$ that maps the trivial Z-only CSS code to $Q(q, 2)$ . This identifies the quantum code as Clifford-equivalent to a graph-state encoding of the classical Singer incidence.
- Paired-Rigidity-Distance Equality: The minimum distance is exactly $d_{min} = R_P + 1$ , where $R_P$ is the paired column rigidity index of the centralizer matrix.
Closed-Form Logical Dimension: Using Hamada-Smith rank specialization, the authors derive $k(p, d) = \theta_d(p) - \binom{p+d-1}{d} - 1$ for prime $p$ . The flagship family $Q(p, 2)$ achieves an asymptotic rate of $1/2$ .
Distance Bounds and Ceilings:
- 2-Torsion Obstruction: The paper proves that for $q$ odd and $d$ odd ( $d \ge 3$ ), the code suffers a distance ceiling of $d_{min} \le 2$ due to a weight-2 logical operator.
- Flagship Conjecture: For $d=2$ and odd primes $p$ , it is conjectured that $d_{min}(Q(p, 2)) = p+1$ . This is proven exactly for $p=5$ ( $d_{min}=6$ ) and rigorously lower-bounded for $p=7$ ( $d_{min} \ge 8$ ).
Negative Results on Waterloo Lifting: The paper demonstrates that attempts to lift the classical Waterloo decomposition (which fails for odd $d$ in integer lattices) to entanglement-assisted quantum codes fail because the integer obstruction vanishes modulo $p$ . The "Waterloo defect" is invisible to the standard Pauli stabilizer formalism over $\mathbb{F}_p$ .

Results

Concrete Instances:
- $Q(3, 2) = [[13, 6, 3]]_3$ : Single-error correcting.
- $Q(5, 2) = [[31, 15, 6]]_5$ : Double-error correcting ( $d_{min}=6$ ).
- $Q(7, 2) = [[57, 28, d]]_7$ with $d \ge 8$ .
- $Q(3, 4) = [[121, 105, 3]]_3$ : Single-error correcting.
Performance: Monte-Carlo simulations over $1.5 \times 10^6$ trials using a bounded-distance decoder show that $Q(5, 2)$ achieves a $\sim 70\times$ improvement in per-logical-qudit failure rate over the Steane $[[7, 1, 3]]_2$ code at a depolarizing rate of $10^{-3}$ .
"Erase-Don't-Mistake" Property: For $Q(5, 2)$ , no silent logical errors were observed; all decoder failures were declared uncorrectable. This is attributed to the code's distance and the bounded-distance decoder's behavior.
Comparison: The proposed codes outperform prior Singer-difference-set constructions (e.g., Gandhi [5]) and projective-geometry QLDPC codes (e.g., Tang-Bai-Feng [6]) by combining non-CSS structure, qudit support, and explicit structural theorems.

Significance and Claims
The paper claims to be the first to combine a Singer difference set with a non-degenerate quadric Gram matrix in a quantum stabilizer construction. Its significance lies in:

Unification: Bridging the algebraic primitives of classical LDS-NOMA spreading codes (specifically the 2021 construction) with quantum stabilizer codes via a rigorous Clifford equivalence.
Interpretability: Providing a set of five proven structural theorems that explain why the construction works, moving beyond empirical parameter selection.
Performance: Demonstrating that structured qudit codes can achieve high error-correction capabilities (double-error correction) with moderate block lengths and rates near $1/2$ , significantly outperforming standard binary qubit codes in the qudit regime.
Methodological Clarity: Explicitly identifying the limitations of lifting integer-lattice combinatorial defects (Waterloo decomposition) to the quantum domain via entanglement assistance, thereby clarifying the boundaries of current EAQECC frameworks.

The authors maintain modesty regarding the general $p$ case of the distance conjecture ( $d_{min} = p+1$ ), noting it remains open for $p > 7$ , and acknowledge that the current numerical evaluation uses a standard bounded-distance decoder, leaving Berlekamp-Massey-style cyclic decoding as a natural future direction.

Technical Summary: Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d, q)

More like this