Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Deterministic Rational Certificates for Causal Logical Decoding of CSS Codes

Deivison Ramos do Rosario

Published Oct 28, 2026• 0 citations
Publisher

Abstract

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)

DOI
10.5281/zenodo.23749900

Related papers

Certified decoding of quantum LDPC codes

Ragavi Krishnamoorthy, Florian Gerhardt, Johannes Knaute +8 more

Quantum low-density parity-check (qLDPC) codes reduce the qubit overhead of fault-tolerant quantum computation by an order of magnitude, but their decoding is harder than its classical counterpart: because many physical errors are equivalent up to stabilizers, the degenerate maximum-likelihood (ML) decoder must compare the probabilities of entire equivalence classes of errors, that is, partition functions, rather than single errors. The workhorse decoder BP+OSD sidesteps degeneracy heuristically and offers no guarantees. We treat degenerate decoding as probabilistic inference in an undirected graphical model: the probability of each logical class is the partition function of an unconstrained, strictly positive Markov random field over the code's check variables, a construction that generalizes the random-bond Ising mapping of the surface code to arbitrary CSS codes and to spacetime decoding with measurement errors and circuit-level noise. On this model we build two decoders. The first estimates all class partition functions by annealed importance sampling with common random numbers and attaches to every decision a certificate of optimality: a paired bootstrap test, or, composed with constant-factor estimators such as WISH, an exact optimality proof. The second is region-based: the Bethe free energy, whose bias cancels between classes, reproduces exact ML decoding on every tested surface-code instance at millisecond cost, and enlarging the regions to elimination clusters makes exact degenerate ML decoding of the [[72,12,6]] bivariate bicycle code feasible. Across surface codes and the bivariate bicycle codes [[72,12,6]] and [[144,12,12]], under code-capacity, phenomenological, and circuit-level noise, the sampling decoder matches or exceeds BP+OSD while certifying the bulk of its decisions, and the certificate flags exactly the syndromes on which any fast decoder should be distrusted.

quant-pharXiv:2608.25545•Aug 27, 2026•2 citations

Quantum CSS codes: Decoder-aware multiobjective design and bound-certified selection

Jiapei Zhuang, Yaocheng Chen, Xingyao Wu

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.

arXiv:2611.14923•Nov 11, 2026•0 citations

Nearly-optimal CSS code subspace verification with local measurement

Yingying Hu, Congcong Zheng, Xutao Yu +1 more

Abstract Quantum error correction (QEC) is the core mechanism enabling scalable and fault-tolerant quantum computation. Among various QEC schemes, Calderbank–Shor–Steane (CSS) codes play a central role. Efficiently verifying whether a quantum state remains within the target CSS code subspace is therefore essential both for understanding the theoretical performance of these codes and for assessing the error-correcting capability of practical quantum platforms. In this work, we develop an efficient framework for verifying whether a quantum system remains within the encoded subspace of a CSS code. We first show that the stabilizer structure of any CSS code can be mapped to a two-colorable graph, enabling the design of a hybrid verification strategy based solely on local Pauli measurements. We further analytically optimize the measurement probabilities and derive the resulting sample complexities for representative CSS codes. Specifically, for the Toric code, the efficiency of our hybrid strategy increases with lattice size and asymptotically approaches near-optimal performance. These results establish a unified and scalable approach to CSS code subspace verification, providing a foundation for certifiable and fault-tolerant quantum information processing.

Quantum Science and Technology•Feb 10, 2026•0 citations

Exact Robustness Certificates for Five-Qubit Stabilizer Decoding: Decoder Switching and a Deterministic–Randomized Minimax Separation

Md. Amir Khusru Akhtar

We give an exact-arithmetic case study of maximum-likelihood (ML) stabilizer decoding under uncertain dephasing, separating channel-adaptive, fixed deterministic, and fixed randomized recovery decisions. For the five-qubit [[5, 1, 3]] code, we enumerate syndrome–stabilizer-coset masses and certify the homogeneous dephasing success polynomial 1 − 10t³ + 15t⁴ − 6t⁵. On the full homogeneous interval, adaptive ML has robust success 1/2, every fixed deterministic syndrome decoder has worst-case success zero, and fixed randomization attains 1/2. For a heterogeneous but conditionally independent family with site rates (t, t, 2t, 2t, 2t), 0 ≤ t ≤ 1/2, we obtain four algebraic switching thresholds and an exact five-piece adaptive ML curve. The adaptive and optimal fixed randomized worst-case success both equal 3/4, whereas the best fixed deterministic decoder has success min₀≤ₜ≤₁⁄₂ (16t⁵ − 28t⁴ + 10t³ + 3t² − 2t + 1) ≈ 0.749591899. A finite exhaustive reduction and rational witness checks certify strict separation. A CSS-code theorem and independent Steane-code calculation establish a second, strictly separated heterogeneous minimax instance with R_det < 0.4999 < R_rand = R_ML = 1/2. We retain biased-noise orientation sensitivity and two counterexamples to invalid vertex shortcuts, and distinguish these instance-level certificates from general decoding algorithms and established enumerator or robust-optimization methods.

•Nov 1, 2026•0 citations

Single-shot state preparation thresholds in quantum LDPC codes: soundness, confinement, and statistical mechanics

Yuanchen Zhao, Yi Yuan, Zhengyi Han +1 more

Single-shot error correction does not by itself establish equally direct and robust logical-state initialization. We study preparation of CSS quantum low-density parity-check code states using one noisy round of the code's checks. We prove that linear confinement over a weight range growing at least logarithmically, together with at least logarithmic distance, suffices for a nonzero threshold under independent local-stochastic readout and data noise in the relevant CSS sector. The threshold is certified by ideal recovery of a decoder-defined logical channel. The key is a correction rule that preserves the logical class under local syndrome changes, allowing the proof to proceed without a local-stochastic bound on the preparation residual. This gives a single-block guarantee for quantum expander codes without dimension jumps or batching. Under the stronger linear-soundness hypothesis, we establish local-stochastic residual noise, enabling composition with compatible fault-tolerant gadgets. For a retained-record formulation, we also derive an exact statistical-mechanical representation of optimal final recovery at fixed preparation decoder. A decoder-dependent logical-sector order parameter characterizes asymptotically successful block decoding. Monte Carlo results for the three-dimensional toric code provide finite-size evidence for a threshold beyond both linear sufficient conditions. These results distinguish logical robustness from local-stochastic residual-noise control and identify decoder consistency as a route to single-shot initialization.

quant-pharXiv:2609.39965•Oct 1, 2026•0 citations

Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding

Kenta Kasai

We study hard-erasure belief-propagation (BP), understood as the sum-product algorithm on erasure messages, for a punctured MacKay-Neal/Hsu-Anastasopoulos (MN/HA) representation of Calderbank-Shor-Steane (CSS) codes. For every integer degree triple $2\leq j_Z<j_X<k\leq60$, we prove that the constituent potential thresholds are $j_Z/k$ and $1-j_X/k$. The proof combines classical HA-MN duality with a completed exact rational certificate for all 1711 MN degree pairs in this range. The certificate establishes strict positivity on every physical nontrivial fixed-point branch, at every erasure probability in $[0,1]$, and has an independent integer-arithmetic verifier. A reduction of the Z-side recursion and a fixed-channel vector-potential argument then prove seeded density-evolution convergence below the smaller constituent threshold for sufficiently large coupling width and an ideal seed interval at least that wide. Under $j_Z+j_X=k$, this threshold equals the quantum-erasure hashing-bound parameter determined by the CSS design rate. In particular, the degree triple $(4,8,12)$ has potential threshold $1/3$ without a positivity hypothesis. The numerical example at erasure probability $0.3325$ reproduces the resulting decoding waves. The theorem uses an ideal auxiliary-message seed; its finite-code realization and logical block-error convergence are separate questions.

quant-pharXiv:2606.32001•Jul 1, 2026•2 citations
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)
Quantum low-density parity-check (qLDPC) codes reduce the qubit overhead of fault-tolerant quantum computation by an order of magnitude, but their decoding is harder than its classical counterpart: because many physical errors are equivalent up to stabilizers, the degenerate maximum-likelihood (ML) decoder must compare the probabilities of entire equivalence classes of errors, that is, partition functions, rather than single errors. The workhorse decoder BP+OSD sidesteps degeneracy heuristically and offers no guarantees. We treat degenerate decoding as probabilistic inference in an undirected graphical model: the probability of each logical class is the partition function of an unconstrained, strictly positive Markov random field over the code's check variables, a construction that generalizes the random-bond Ising mapping of the surface code to arbitrary CSS codes and to spacetime decoding with measurement errors and circuit-level noise. On this model we build two decoders. The first estimates all class partition functions by annealed importance sampling with common random numbers and attaches to every decision a certificate of optimality: a paired bootstrap test, or, composed with constant-factor estimators such as WISH, an exact optimality proof. The second is region-based: the Bethe free energy, whose bias cancels between classes, reproduces exact ML decoding on every tested surface-code instance at millisecond cost, and enlarging the regions to elimination clusters makes exact degenerate ML decoding of the [[72,12,6]] bivariate bicycle code feasible. Across surface codes and the bivariate bicycle codes [[72,12,6]] and [[144,12,12]], under code-capacity, phenomenological, and circuit-level noise, the sampling decoder matches or exceeds BP+OSD while certifying the bulk of its decisions, and the certificate flags exactly the syndromes on which any fast decoder should be distrusted.
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.
Abstract Quantum error correction (QEC) is the core mechanism enabling scalable and fault-tolerant quantum computation. Among various QEC schemes, Calderbank–Shor–Steane (CSS) codes play a central role. Efficiently verifying whether a quantum state remains within the target CSS code subspace is therefore essential both for understanding the theoretical performance of these codes and for assessing the error-correcting capability of practical quantum platforms. In this work, we develop an efficient framework for verifying whether a quantum system remains within the encoded subspace of a CSS code. We first show that the stabilizer structure of any CSS code can be mapped to a two-colorable graph, enabling the design of a hybrid verification strategy based solely on local Pauli measurements. We further analytically optimize the measurement probabilities and derive the resulting sample complexities for representative CSS codes. Specifically, for the Toric code, the efficiency of our hybrid strategy increases with lattice size and asymptotically approaches near-optimal performance. These results establish a unified and scalable approach to CSS code subspace verification, providing a foundation for certifiable and fault-tolerant quantum information processing.
We give an exact-arithmetic case study of maximum-likelihood (ML) stabilizer decoding under uncertain dephasing, separating channel-adaptive, fixed deterministic, and fixed randomized recovery decisions. For the five-qubit [[5, 1, 3]] code, we enumerate syndrome–stabilizer-coset masses and certify the homogeneous dephasing success polynomial 1 − 10t³ + 15t⁴ − 6t⁵. On the full homogeneous interval, adaptive ML has robust success 1/2, every fixed deterministic syndrome decoder has worst-case success zero, and fixed randomization attains 1/2. For a heterogeneous but conditionally independent family with site rates (t, t, 2t, 2t, 2t), 0 ≤ t ≤ 1/2, we obtain four algebraic switching thresholds and an exact five-piece adaptive ML curve. The adaptive and optimal fixed randomized worst-case success both equal 3/4, whereas the best fixed deterministic decoder has success min₀≤ₜ≤₁⁄₂ (16t⁵ − 28t⁴ + 10t³ + 3t² − 2t + 1) ≈ 0.749591899. A finite exhaustive reduction and rational witness checks certify strict separation. A CSS-code theorem and independent Steane-code calculation establish a second, strictly separated heterogeneous minimax instance with R_det < 0.4999 < R_rand = R_ML = 1/2. We retain biased-noise orientation sensitivity and two counterexamples to invalid vertex shortcuts, and distinguish these instance-level certificates from general decoding algorithms and established enumerator or robust-optimization methods.
Single-shot error correction does not by itself establish equally direct and robust logical-state initialization. We study preparation of CSS quantum low-density parity-check code states using one noisy round of the code's checks. We prove that linear confinement over a weight range growing at least logarithmically, together with at least logarithmic distance, suffices for a nonzero threshold under independent local-stochastic readout and data noise in the relevant CSS sector. The threshold is certified by ideal recovery of a decoder-defined logical channel. The key is a correction rule that preserves the logical class under local syndrome changes, allowing the proof to proceed without a local-stochastic bound on the preparation residual. This gives a single-block guarantee for quantum expander codes without dimension jumps or batching. Under the stronger linear-soundness hypothesis, we establish local-stochastic residual noise, enabling composition with compatible fault-tolerant gadgets. For a retained-record formulation, we also derive an exact statistical-mechanical representation of optimal final recovery at fixed preparation decoder. A decoder-dependent logical-sector order parameter characterizes asymptotically successful block decoding. Monte Carlo results for the three-dimensional toric code provide finite-size evidence for a threshold beyond both linear sufficient conditions. These results distinguish logical robustness from local-stochastic residual-noise control and identify decoder consistency as a route to single-shot initialization.
We study hard-erasure belief-propagation (BP), understood as the sum-product algorithm on erasure messages, for a punctured MacKay-Neal/Hsu-Anastasopoulos (MN/HA) representation of Calderbank-Shor-Steane (CSS) codes. For every integer degree triple 2≤jZ<jX<k≤602\leq j_Z<j_X<k\leq602≤jZ​<jX​<k≤60, we prove that the constituent potential thresholds are jZ/kj_Z/kjZ​/k and 1−jX/k1-j_X/k1−jX​/k. The proof combines classical HA-MN duality with a completed exact rational certificate for all 1711 MN degree pairs in this range. The certificate establishes strict positivity on every physical nontrivial fixed-point branch, at every erasure probability in [0,1][0,1][0,1], and has an independent integer-arithmetic verifier. A reduction of the Z-side recursion and a fixed-channel vector-potential argument then prove seeded density-evolution convergence below the smaller constituent threshold for sufficiently large coupling width and an ideal seed interval at least that wide. Under jZ+jX=kj_Z+j_X=kjZ​+jX​=k, this threshold equals the quantum-erasure hashing-bound parameter determined by the CSS design rate. In particular, the degree triple (4,8,12)(4,8,12)(4,8,12) has potential threshold 1/31/31/3 without a positivity hypothesis. The numerical example at erasure probability 0.33250.33250.3325 reproduces the resulting decoding waves. The theorem uses an ideal auxiliary-message seed; its finite-code realization and logical block-error convergence are separate questions.