Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression
Valentine Nyirahafashimana, Sharifah Kartini Said Husain, Umair Abdul Halim, Ahmed Jellal, Nurisya Mohd Shah

TL;DR
This paper introduces a quasi-orthogonal geometric framework for stabilizer codes that relaxes orthogonality constraints, enabling more flexible and efficient quantum error correction with significant performance improvements.
Contribution
It presents a novel quasi-orthogonal stabilizer code design framework that broadens the code construction space and enhances error suppression capabilities.
Findings
Quasi-orthogonal codes approach the Gilbert-Varshamov regime with better logical rates.
Finite-length quasi-orthogonal codes outperform strictly orthogonal ones in simulations.
Logical error rates improve by up to two orders of magnitude under depolarizing noise.
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 . 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 , ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
