Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression

• URL: http://arxiv.org/abs/2604.12684v1
• Date: Tue, 14 Apr 2026 12:53:00 GMT
• Title: Quasi-Orthogonal Stabilizer Design for Efficient Quantum Error Suppression
• Abstract summary: We introduce a quasi-orthogonal geometric framework for stabilizer codes.<n>We preserve the symplectic commutation structure on the binary symplectic space $mathbbF_22$.<n>This relaxation expands the stabilizer design space, enabling codes that approach the Gilbert-Varshamov regime with improved logical rates at moderate distances.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Stable and Scalable Bundle Adjustment of Holistic 3D Structures [99.03818732955783]
  We present a new version of Bundle Adjustment (BA) for 3D computer vision.<n>BA is developed to jointly optimize cameras, poses and 3D points.<n>By group-induced measurements and cross-feature reprojection, we preserve the sparsity of classical point-only 3D regularization.
  arXiv  Detail & Related papers  (2026-09-03T16:08:03Z)
• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• Quantum XYZ Stabilizer Codes [5.383800628085301]
  We introduce quantum XYZ stabilizer codes, whose parity-check matrix (PCM) is built from three pairwise binary PCMs.<n>A nontrivial point is that an XYZ code instance is not automatically genuinely non-CSS.<n>We also derive upper and lower bounds on the quantum minimum distance, including bounds for mixed Pauli logical operators.
  arXiv  Detail & Related papers  (2026-07-16T13:38:00Z)
• Covariant Approximate Quantum Codes for Protected Analog Computation [0.0]
  Eastin-Knill theorem forbids exact codes with continuous symmetries.<n>We construct explicit $SU(d)$-covariant approximate codes that exploit permutation symmetry.<n>These results provide explicit non-Abelian covariant codes and a framework for robust analog quantum simulation.
  arXiv  Detail & Related papers  (2026-07-08T16:25:25Z)
• Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers [1.3599288060332324]
  We show that exact quantum codes often form connected continuous families rather than collections of disjoint solution regions.<n>Within these continuous landscapes, stabilizer codes occupy only discrete, measure-zero subsets of the attainable $*$-spectrum.<n>These results place stabilizer, symmetric, and nonadditive code families within a unified higher-rank variance framework.
  arXiv  Detail & Related papers  (2026-04-23T15:59:05Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Breaking the Orthogonality Barrier in Quantum LDPC Codes [0.0]
  We develop a quantum low-density parity-check (LDPC) code that achieves a frame error rate as low as $10-8$ on the depolarizing channel with error probability $4%$.
  arXiv  Detail & Related papers  (2026-01-13T18:57:43Z)
• Pauli Stabilizer Models for Gapped Boundaries of Twisted Quantum Doubles and Applications to Composite Dimensional Codes [0.0]
  We provide new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite dimensional twisted quantum doubles.<n>Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers.<n>We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates and decoding.
  arXiv  Detail & Related papers  (2025-08-26T17:59:45Z)
• Planar quantum low-density parity-check codes with open boundaries [7.741302957350027]
  We introduce the first systematic procedure to convert BB codes into fully planar, open-boundary qLDPC codes.<n>We present code families with logical dimensions $6 leq kleq13$, e.g., $[[78, 6, 6]]$, $[[107, 7, 7]]$, $[268, 8, 12]]$, $[405, 9, 15]]$, $[[348, 10, 13]]$, $[[450, 11, 15]]$, $[[386, 12, 12]]$, $[362, 13, 11]]$,
  arXiv  Detail & Related papers  (2025-04-11T18:00:05Z)
• Generalized toric codes on twisted tori for quantum error correction [9.623534315687825]
  Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation.<n>Direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads.<n>We introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions.
  arXiv  Detail & Related papers  (2025-03-05T19:00:05Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Pseudonorm Approachability and Applications to Regret Minimization [73.54127663296906]
  We convert high-dimensional $ell_infty$-approachability problems to low-dimensional pseudonorm approachability problems. We develop an algorithmic theory of pseudonorm approachability, analogous to previous work on approachability for $ell$ and other norms.
  arXiv  Detail & Related papers  (2023-02-03T03:19:14Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Orthogonalizing Convolutional Layers with the Cayley Transform [83.73855414030646]
  We propose and evaluate an alternative approach to parameterize convolutional layers that are constrained to be orthogonal. We show that our method indeed preserves orthogonality to a high degree even for large convolutions.
  arXiv  Detail & Related papers  (2021-04-14T23:54:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.