Quantum error-correcting codes trade decoding reliability against the resources needed to measure their checks. We formulate Calderbank-Shor-Steane (CSS) code design at fixed encoding resources as a decoder-aware multiobjective problem. The objectives are failure probability under sector-wise degenerate maximum-likelihood decoding and check weight, the minimum total weight of an independent pure-type generator basis. For independent bit- and phase-flip noise with perfect syndrome extraction, deterministic truncation bounds support selection under a failure-rate constraint. At a per-sector error probability of 0.01, the bounds certify that a code encoding two logical qubits into 40 physical qubits meets a failure-rate target of 0.001 at check weight 139. The lower bound of every cheaper candidate in the corresponding (40,2) main menu exceeds this target. In paired searches sharing one annealing kernel and equal query budgets, decoder-aware guidance gives significantly higher mean final hypervolume than distance guidance in all eight tested configurations under the reported Holm correction. Against distance-multiplicity guidance, five configurations show significant gains and three do not, including one with a negative mean difference. All arms are scored in common truncated-reliability and normalized-check-weight coordinates. The framework connects reliability-check-weight trade-offs to bound-certified selection within evaluated CSS pools.
Quantum error-correcting codes trade decoding reliability against the resources needed to measure their checks. We formulate Calderbank-Shor-Steane (CSS) code design at fixed encoding resources as a decoder-aware multiobjective problem. The objectives are failure probability under sector-wise degenerate maximum-likelihood decoding and check weight, the minimum total weight of an independent pure-type generator basis. For independent bit- and phase-flip noise with perfect syndrome extraction, deterministic truncation bounds support selection under a failure-rate constraint. At a per-sector error probability of 0.01, the bounds certify that a code encoding two logical qubits into 40 physical qubits meets a failure-rate target of 0.001 at check weight 139. The lower bound of every cheaper candidate in the corresponding (40,2) main menu exceeds this target. In paired searches sharing one annealing kernel and equal query budgets, decoder-aware guidance gives significantly higher mean final hypervolume than distance guidance in all eight tested configurations under the reported Holm correction. Against distance-multiplicity guidance, five configurations show significant gains and three do not, including one with a negative mean difference. All arms are scored in common truncated-reliability and normalized-check-weight coordinates. The framework connects reliability-check-weight trade-offs to bound-certified selection within evaluated CSS pools.
Quantum error correction (QEC) is essential for operating quantum computers in the presence of noise. Here, we accurately decode arbitrary Calderbank-Shor-Steane (CSS) codes via the maximum satisfiability (MaxSAT) problem. We show how to map quantum maximum likelihood problem of CSS codes of arbitrary geometry and parity check weight into MaxSAT problems. We incorporate the syndrome measurements as hard clauses, while qubit and measurement error probabilities, including biased and non-uniform, are encoded as soft MaxSAT clauses. For the code capacity of color codes on a hexagonal lattice, our decoder has a higher threshold and superior scaling in noise suppression compared to belief propagation with ordered statistics post-processing (BP-OSD), while showing similar scaling in computational cost. Further, we decode surface codes and recently proposed bivariate quantum low-density parity check (QLDPC) codes where we find lower error rates than BP-OSD. Finally, we connect the complexity of MaxSAT decoding to a computational phase transition controlled by the clause density of the MaxSAT problem, where we show that our mapping is always in the computationally ''easy`` phase. Our MaxSAT decoder can be further parallelised or implemented on ASICs and FPGAs, promising potential further speedups of several orders of magnitude. Our work provides a flexible platform towards practical applications on quantum computers.
Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting X- and Z-type checks. We introduce CSS-like codes on G-valued qudits for any finite group G that reduce to qubit CSS codes for G=Z2 yet generalize the Kitaev quantum double model for general groups. The X-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while Z-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when G is non-Abelian and simple, every G-covariant group-CSS code with suitably upper-bounded Z-check weight and lower-bounded Z-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.
Deterministic Rational Certificates for Causal Logical Decoding of CSS Codes This work investigates the deterministic certification of logical decoding decisions in Calderbank–Shor–Steane (CSS) quantum error-correcting codes under independent phase errors and noisy intermediate syndrome measurements. The proposed framework combines causal Fourier–Walsh filtering, tensor-train approximations, exact rational arithmetic, and rigorous residual-based error bounds. In addition to global and spectrally refined estimates, the study develops a goal-oriented adjoint certification procedure that establishes whether an approximate logical-class probability contrast has a mathematically guaranteed sign. For the unrotated [[13,1,3]] surface code, the framework is evaluated across 300 correlated experimental configurations involving 25 simulated histories, four temporal horizons, and three tensor-train bond dimensions. The baseline and spectrally refined methods certify 184 and 192 decisions, respectively, while adjoint certification increases coverage to 272 decisions without modifying the frozen tensor candidates. All 300 certified intervals contain their corresponding exact physical-model contrasts, with no incorrect certified signs observed. An additional rationally verified [[41,1,5]] code instance demonstrates finite-size applicability beyond the distance-three benchmark. The accompanying reproducibility archive includes the manuscript, LaTeX sources, Python verification programs, frozen numerical data, rational certificates, adversarial tests, and SHA-256 integrity manifests. The results establish conditional mathematical guarantees under the specified stochastic model. They do not establish universal decoding thresholds, asymptotic scalability, or fault-tolerant hardware performance. Author: Deivison Ramos do Rosario Affiliation: Independent Researcher, Bengui, Belém, Pará, Brazil ORCID: https://orcid.org/0009-0002-7768-5047 License: Creative Commons Attribution 4.0 International (CC BY 4.0)
We construct a three-dimensional Calderbank-Shor-Steane (CSS) stabilizer code on the Face-Centered Cubic (FCC) lattice. Physical qubits reside on the edges of the lattice (coordination K=12); X-stabilizers act on octahedral voids and Z-stabilizers on vertices, both with uniform weight 12. Computational verification confirms CSS validity (HXHZT=0 over GF(2)) and reveals k=2L3+2 logical qubits: k=130 at L=4 and k=434 at L=6, yielding encoding rates of 67.7% and 67.0% respectively. The minimum distance d=3 is proven exactly by exhaustive elimination of all weight-≤2 candidates combined with constructive weight-3 non-stabilizer codewords. The code parameters are [[192, 130, 3]] at L=4 and [[648, 434, 3]] at L=6. This rate is 24x higher than the cubic 3D toric code (2.8% at d=4), though at a lower distance (d=3 vs. d=4); the comparison is across different distances. The high rate originates in a structural surplus: the FCC lattice has 3L3 edges but only L3−2 independent stabilizer constraints, leaving k=2L3+2 logical degrees of freedom. We provide a minimum-weight perfect matching (MWPM) decoder adapted to the FCC geometry, demonstrate a 10x coding gain at p=0.001 (and 63x at p=0.0005), and discuss implications for fault-tolerant quantum computing on neutral-atom and photonic platforms.
Capacity-approaching quantum error correction faces a fundamental tension: the required parity-check matrices need to become increasingly dense, while practical decoding and syndrome extraction favor sparse, bounded-degree structures. Reconciling these competing requirements remains an important open problem in quantum code design. We construct Calderbank-Shor-Steane (CSS) code ensembles that approach the CSS rate over memoryless Pauli channels under maximum-likelihood decoding while retaining sparse, bounded-degree graphical representations. The construction separates parity-check density from graphical complexity: although capacity-approaching components may require dense parity-check matrices, they are represented by sparse concatenated factor graphs. We first study a construction combining low-density parity-check (LDPC) and low-density generator-matrix (LDGM) component codes and numerically analyze the average weight distributions of the resulting codes. Motivated by these results, we introduce a second construction based on concatenated LDPC and LDGM codes and generalized irregular repeat-accumulate (GIRA) codes. We derive bounds on the average weight distribution of the resulting sum ensemble and use the Miller-Burshtein framework to prove simultaneous reliability of the two CSS decoding components. Consequently, the proposed ensemble achieves rates arbitrarily close to the CSS hashing bound under separate bit- and phase-error correction, while maintaining bounded graphical complexity, thus providing a foundation for future iterative decoders and indirect syndrome-extraction architectures.
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group G and two subsets of G whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find [[60,4,10]],[[36,6,6]],[[48,8,6]], and [[85,8,9]] codes, all of which are not CSS; we also find several weight-7 codes with kd>n.
Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of 0.2%, approximately matching that of the [[144,12,12]] BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.