pith. sign in

arxiv: 2604.12684 · v1 · submitted 2026-04-14 · 🪐 quant-ph · math-ph· math.MP

Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression

Valentine Nyirahafashimana , Sharifah Kartini Said Husain , Umair Abdul Halim , Ahmed Jellal , Nurisya Mohd Shah This is my paper

Pith reviewed 2026-05-10 14:54 UTC · model grok-4.3

classification 🪐 quant-ph math-phmath.MP
keywords stabilizer codesquantum error correctionquasi-orthogonal constructionsgeometric frameworksdepolarizing noiselogical error rates
0
0 comments X

The pith

A quasi-orthogonal framework relaxes strict orthogonality in stabilizer codes while preserving commutation rules to improve error suppression.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper introduces a geometric framework for quantum stabilizer codes that allows controlled overlaps between the supports of X and Z checks. By relaxing the usual requirement of strict orthogonality, the approach keeps the essential symplectic structure intact but opens up more possibilities for code design. The result is a set of codes that achieve higher logical rates and show substantially better performance in suppressing errors under depolarizing noise. Readers should care because quantum error correction currently struggles with resource constraints, and this method provides a concrete way to design more efficient codes that still work with existing decoding methods.

Core claim

The paper claims that quasi-orthogonal variants of codes such as the [[8,3,≈3]], [[10,4,≈3]], [[13,1,5]], and [[29,1,11]] demonstrate consistent improvements over strictly orthogonal counterparts, with logical error rates, fidelities, and trace distances improving by up to two orders of magnitude under depolarizing noise with error rates up to p=0.30. These gains come from the increased connectivity in the stabilizer geometry while maintaining compatibility with standard decoding schemes.

What carries the argument

The quasi-orthogonal geometric framework that defines Pauli operators with controlled overlap between X- and Z-check supports and uses induced anti-commutation to define an effective distance for the code.

If this is right

  • Quasi-orthogonal codes can approach the Gilbert-Varshamov regime with improved logical rates at moderate distances.
  • Finite-length constructions show up to two orders of magnitude better error suppression metrics compared to orthogonal designs.
  • The relaxation expands the design space for stabilizer codes without breaking compatibility with existing decoders.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Such designs could enable more flexible hardware layouts for quantum processors by reducing the strict separation of check supports.
  • Future work might combine this quasi-orthogonality with other optimizations to push closer to theoretical performance limits.

Load-bearing premise

That controlled overlap between X- and Z-check supports preserves the symplectic commutation structure on the binary symplectic space and that the anti-commutation definition of effective distance accurately predicts actual error suppression performance.

What would settle it

A numerical simulation or physical experiment at depolarizing error rate p=0.30 where the quasi-orthogonal code versions show no improvement or worse logical error rates than their orthogonal counterparts would falsify the performance gains.

Figures

Figures reproduced from arXiv: 2604.12684 by Ahmed Jellal, Nurisya Mohd Shah, Sharifah Kartini Said Husain, Umair Abdul Halim, Valentine Nyirahafashimana.

Figure 1
Figure 1. Figure 1: Visualization of the totally singular subspace [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Quasi-orthogonal geometric realization of the [[9 [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Quasi-orthogonal error E(ej , 0) displaces state off S¯A, breaking total singularity. 2.4 Quasi-Orthogonal Structure of the qubit mapping The quasi-orthogonal structure underlying the qubit mapping can be viewed through the lens of additive codes over GF(4) that satisfy a trace inner product condition. This perspective supports the construction of stabilizer codes and has been applied effectively to system… view at source ↗
Figure 4
Figure 4. Figure 4: Logical error probability comparison between orthogonal and quasi-orthogonal geometric [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Metric performance of qubits transformation across four compact families: [[8 [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: GVB under quasi-orthogonal geometric properties, highlighting how relaxing orthogonality [PITH_FULL_IMAGE:figures/full_fig_p012_6.png] view at source ↗
read the original abstract

Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework for stabilizer codes that relaxes these constraints while preserving the symplectic commutation structure on the binary symplectic space $\mathbb{F}_{2}^{2}$. The approach permits controlled overlap between X- and Z-check supports, leading to quasi-orthogonal Pauli operators and a generalized notion of effective distance defined via induced anti-commutation with logical operators. This relaxation expands the stabilizer design space, enabling codes that approach the Gilbert-Varshamov regime with improved logical rates at moderate distances. Finite-length constructions, including quasi-orthogonal variants of the $[[8,3,\approx 3]]$, $[[10,4,\approx 3]]$, $[[13,1,5]]$, and $[[29,1,11]]$ codes, demonstrate consistent improvements over strictly orthogonal counterparts. Under depolarizing noise with error rates up to $p=0.30$, logical error rates, fidelities, and trace distances improve by up to two orders of magnitude. These improvements reflect the increased connectivity of the underlying stabilizer geometry while remaining compatible with standard decoding schemes. The proposed framework offers a principled extension of stabilizer code design through quasi-orthogonal geometric structures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces a quasi-orthogonal geometric framework for stabilizer quantum error-correcting codes. It relaxes strict orthogonality between X- and Z-type Pauli checks while claiming to preserve the symplectic commutation structure on F_2^{2n}. This permits controlled overlaps in check supports, yielding quasi-orthogonal operators and a generalized effective distance defined via induced anti-commutation with logical operators. Finite-length constructions are presented for quasi-orthogonal variants of the [[8,3,≈3]], [[10,4,≈3]], [[13,1,5]], and [[29,1,11]] codes. Numerical simulations under depolarizing noise (p ≤ 0.30) report up to two orders of magnitude improvement in logical error rate, fidelity, and trace distance relative to strictly orthogonal counterparts, while remaining compatible with standard decoding.

Significance. If the effective-distance definition and numerical gains are rigorously validated, the framework would meaningfully enlarge the design space for stabilizer codes, potentially improving rate-distance trade-offs and moving closer to the Gilbert-Varshamov regime at moderate distances. The explicit compatibility with existing decoders is a practical strength. However, the absence of a proof relating the new distance metric to actual undetectable-error weight limits the immediate impact.

major comments (2)
  1. [Section defining the effective distance and quasi-orthogonal operators] The generalized effective distance is introduced via induced anti-commutation with logical operators, yet no theorem or derivation is supplied showing that this quantity lower-bounds the minimum weight of logical operators or bounds the probability of logical errors under standard syndrome decoding. This definition is load-bearing for all performance claims (e.g., the reported gains for the [[13,1,5]] and [[29,1,11]] constructions).
  2. [Finite-length constructions and numerical-results sections] The abstract asserts that the constructions preserve the symplectic commutation structure on F_2^{2n} while allowing controlled X/Z overlap, but no explicit verification (e.g., explicit generator matrices or commutation-check equations) is referenced for the listed codes. Without this, it is impossible to confirm that the resulting operators still form a valid stabilizer group.
minor comments (2)
  1. The approximate-distance notation (≈3, ≈3) should be replaced by exact minimum distances or accompanied by a clear definition of how the effective distance is computed for each code.
  2. All simulation parameters (number of shots, decoder implementation, exact noise model) should be stated explicitly so that the reported order-of-magnitude gains can be reproduced.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. We address each major comment point by point below, indicating the revisions we will make to improve the rigor and clarity of the presentation.

read point-by-point responses

  1. Referee: [Section defining the effective distance and quasi-orthogonal operators] The generalized effective distance is introduced via induced anti-commutation with logical operators, yet no theorem or derivation is supplied showing that this quantity lower-bounds the minimum weight of logical operators or bounds the probability of logical errors under standard syndrome decoding. This definition is load-bearing for all performance claims (e.g., the reported gains for the [[13,1,5]] and [[29,1,11]] constructions).

    Authors: We thank the referee for identifying this gap. The effective distance is defined directly from the anti-commutation relations that the quasi-orthogonal overlaps induce between errors and logical operators, while the symplectic commutation relations among the stabilizers themselves remain strictly preserved. Although the manuscript currently supports the utility of this metric through explicit numerical simulations under depolarizing noise, we acknowledge that an explicit derivation relating it to the minimum weight of undetectable logical errors is not supplied. In the revised manuscript we will add a short proposition in the effective-distance section that derives this lower-bound property from the definition of quasi-orthogonality and the preservation of the symplectic inner product on the stabilizer generators. revision: yes

  2. Referee: [Finite-length constructions and numerical-results sections] The abstract asserts that the constructions preserve the symplectic commutation structure on F_2^{2n} while allowing controlled X/Z overlap, but no explicit verification (e.g., explicit generator matrices or commutation-check equations) is referenced for the listed codes. Without this, it is impossible to confirm that the resulting operators still form a valid stabilizer group.

    Authors: We agree that explicit verification is necessary for independent confirmation. The listed codes were constructed by controlled modification of the support of the original orthogonal generators so that the symplectic product between every pair of new generators remains zero. In the revised version we will append the explicit generator matrices (in standard X/Z block form) for the quasi-orthogonal [[8,3,≈3]], [[10,4,≈3]], [[13,1,5]], and [[29,1,11]] codes, together with a brief table or statement confirming that the symplectic inner product of every pair of generators is identically zero. This will establish that the operators continue to form a valid stabilizer group while remaining compatible with standard syndrome decoding. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper defines a quasi-orthogonal stabilizer framework by relaxing strict orthogonality while preserving symplectic commutation on F_2^{2n}, introduces a generalized effective distance via induced anti-commutation with logical operators, presents explicit finite-length code constructions such as quasi-orthogonal variants of [[13,1,5]] and [[29,1,11]], and reports numerical simulation results under depolarizing noise. These steps constitute an independent design proposal followed by empirical evaluation; no prediction or central claim reduces by construction to fitted inputs, self-definitional loops, or load-bearing self-citations. The performance improvements are obtained from direct simulation of the constructed codes rather than tautological renaming or parameter fitting that forces the reported gains. The derivation remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Based solely on the abstract, the central claim rests on the assumption that relaxing orthogonality while preserving symplectic structure yields valid codes with improved distance properties; no explicit free parameters or invented entities are detailed beyond the new quasi-orthogonal operators.

axioms (1)
  • domain assumption The binary symplectic space F_2^{2n} commutation relations must be preserved under controlled overlaps.
    Invoked to ensure the quasi-orthogonal operators still define a valid stabilizer code.
invented entities (1)
  • quasi-orthogonal Pauli operators no independent evidence
    purpose: Allow controlled overlap between X- and Z-check supports while maintaining commutation rules.
    New concept introduced to expand the stabilizer design space beyond strict orthogonality.

pith-pipeline@v0.9.0 · 5560 in / 1285 out tokens · 47066 ms · 2026-05-10T14:54:58.039680+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages · 1 internal anchor

  1. [1]

    Calderbank A R, Rains E M, Shor P W, Sloane N J A 1997 Quantum error correction and orthogonal geometryPhysical Review Letters78(3) 405

    work page 1997

  2. [2]

    Ball S, Centelles A, Huber F 2023 Quantum error-correcting codes and their geometries Annales de l’Institut Henri Poincar´ e D, Combinatorics, Physics and their Interactions10(2) 337–405

    work page 2023

  3. [3]

    Mahmoud A A, Ali K M, Rayan S 2025 A Systematic Approach to Hyperbolic Quantum Error Correction CodesarXiv preprint arXiv:2504.07800

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  4. [4]

    WCNC 2002 (Cat

    Sharma N, Papadias C B 2002 Improved quasi-orthogonal codes2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609) 169-171 vol.1 DOI: 10.1109/WCNC.2002.993484

    work page doi:10.1109/wcnc.2002.993484 2002

  5. [5]

    Kasai K, Hagiwara M, Imai H, Sakaniwa K 2011 Non-binary quasi-cyclic quantum LDPC codes2011 IEEE International Symposium on Information Theory Proceedings653–657

    work page 2011

  6. [6]

    Cao M 2020 Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matricesarXiv preprint arXiv:2012.15691. 13

    work page arXiv 2020

  7. [7]

    Nyirahafashimana V, Mohd Shah N, Abdul Halim U, Othman M 2025 Exploring quasi-geometric frameworks for quantum error-correcting codes: a systematic reviewQuantum Information Processing24(9) DOI: 10.1007/s11128-025-04904-5

    work page doi:10.1007/s11128-025-04904-5 2025

  8. [8]

    Komoto D, Kasai K 2025 Explicit Construction of Quantum Quasi-Cyclic Low-Density Parity-Check Codes with Column Weight 2 and Girth 12arXiv preprint arXiv:2501.13444

    work page arXiv 2025

  9. [9]

    Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications37–40

    Turcsany M, FarkaS P 2003 Two-dimensional quasi orthogonal complete complementary codes SympoTIC’03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications37–40

    work page 2003

  10. [10]

    Lv J, Li R, Yao Y 2021 Quasi-cyclic constructions of asymmetric quantum error-correcting codesCryptography and Communications13(5) 661–680

    work page 2021

  11. [11]

    Valentine N, Shah N M, Halim U A, Husain S K S, Jellal A 2024 Transforming qubits via quasi-geometric approachesarXiv preprint arXiv:2407.07562

    work page arXiv 2024

  12. [12]

    Roga W, Fannes M, ˙Zyczkowski K 2010 Davies maps for qubits and qutritsReports on Mathematical Physics66(3) 311–329

    work page 2010

  13. [13]

    Schotte A, Zhu G, Burgelman L, Verstraete F 2022 Quantum error correction thresholds for the universal Fibonacci Turaev-Viro codePhysical Review X12(2) 021012

    work page 2022

  14. [14]

    Li Z, Boyle L 2023 The Penrose Tiling is a Quantum Error-Correcting CodearXiv preprint arXiv:2311.13040

    work page arXiv 2023

  15. [15]

    Akers C, Penington G 2022 Quantum minimal surfaces from quantum error correctionSciPost Physics12(5) 157 DOI: 10.21468/scipostphys.12.5.157

    work page doi:10.21468/scipostphys.12.5.157 2022

  16. [16]

    Li Y, Fisher M P A 2021 Statistical mechanics of quantum error correcting codesPhysical Review B103(10) 104306 DOI: 10.1103/physrevb.103.104306

    work page doi:10.1103/physrevb.103.104306 2021

  17. [17]

    Bravyi S, Poulin D, Terhal B 2010 Tradeoffs for Reliable Quantum Information Storage in 2D SystemsPhysical Review Letters104(5) 050503 DOI: 10.1103/physrevlett.104.050503

    work page doi:10.1103/physrevlett.104.050503 2010

  18. [18]

    Bombin H, Martin-Delgado M A 2007 Homological error correction: Classical and quantum codesJournal of Mathematical Physics48(5) 1–13 DOI: 10.1063/1.2731356

    work page doi:10.1063/1.2731356 2007

  19. [19]

    Dennis E, Kitaev A, Landahl A, Preskill J 2002 Topological quantum memoryJournal of Mathematical Physics43(9) 4452–4505 DOI: 10.1063/1.1499754

    work page doi:10.1063/1.1499754 2002

  20. [20]

    Exponential suppression of bit or phase errors with cyclic error correc- tion.Nature, 595(7867):383–387, 2021

    Chen Z, et al. 2021 Exponential suppression of bit or phase errors with cyclic error correction Nature595(7867) 383–387 DOI: 10.1038/s41586-021-03588-y

    work page doi:10.1038/s41586-021-03588-y 2021

  21. [21]

    Series A: Mathematical, Physical and Engineering Sciences 452(1954) 2551–2577

    Steane A 1996 Multiple-particle interference and quantum error correctionProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452(1954) 2551–2577

    work page 1996

  22. [22]

    Barnett S M, Croke S 2009 Quantum state discriminationAdvances in Optics and Photonics 1(2) 238–278

    work page 2009

  23. [23]

    Calderbank A R, Rains E M, Shor P M, Sloane N J A 1998 Quantum error correction via codes over GF (4)IEEE Transactions on Information Theory44(4) 1369–1387

    work page 1998

  24. [24]

    Laflamme R, Miquel C, Paz J P, Zurek W H 1996 Perfect quantum error correcting code Physical Review Letters77(1) 198

    work page 1996

  25. [25]

    Fuchs C A, Van De Graaf J 2002 Cryptographic distinguishability measures for quantum-mechanical statesIEEE Transactions on Information Theory45(4) 1216–1227

    work page 2002

  26. [26]

    A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)

    Kasami, Tadao 1974. A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.). IEEE Transactions on Information Theory20(5): 679-679

    work page 1974

  27. [27]

    and Wu, L., 2005

    Vu, V. and Wu, L., 2005. Improving the Gilbert-Varshamov bound for q-ary codes.IEEE transactions on information theory,51(9) 3200-3208. 14

    work page 2005