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

arXiv:2607.19447

Auditing Syndrome-to-Decoder Mappings for Repetition, Surface, CSS, and Digitized-GKP Interfaces

Dennis Delali Kwesi Wayo, Chinonso Onah, Rodrigo Alves Dias, Leonardo Goliatt, Sven Groppe

quant-phSubmitted Jul 21, 2026• Announced Jul 22, 2026• 0 citations• Revised Oct 12, 2026 (v2)
v1 · Jul 21, 2026v2 · Oct 12, 2026
arXivHTMLPDF

Abstract

Quantum error-correction experiments increasingly require a verified interface between measured syndrome bits and decoder-native correction requests. We report a four-branch syndrome-to-decoder mapping audit spanning a five-data-qubit repetition code, a distance-five surface Z-check interface, a compact Steane CSS benchmark, and a digitized-GKP proxy. For the surface interface, an independent noiseless interpreter verifies 40/40 single-X syndrome columns and data-bit round trips, while a reversed-register negative control fails for all 40 targets. Sampled hardware and local-noise streams are then analyzed with exact binary minimum-weight representatives to separate mapping validity from noisy localization. The results establish a narrow interface-conformance claim, not a decoder benchmark, threshold estimate, or logical-QEC demonstration.

DOI
10.1007/s11704-026-61541-6
Comments
The article has been accepted by Frontiers of Computer Science (FCS), with the DOI: 10.1007/s11704-026-61541-6

Related papers

Decoder Comparability Across Quantum Software Stacks: Repeated-Round Surface and Digitized-GKP Syndrome Replay

Dennis Delali Kwesi Wayo, Chinonso Onah, Rodrigo Alves Dias +2 more

We present a contract-preserving, family-aware comparison of decoder behavior across four syndrome-generation stacks (PennyLane, Qiskit, Cirq, and a LiDMaS+ reference) under a fixed replay interface. Request streams from repeated-round surface-code and digitized-GKP circuits are replayed through BP, MWPM, and UF with matched controls. The unified matrix spans 24 cells and achieves line-level integrity: $24\,000$ request lines, $24\,000$ response lines, response ratio $=1.0$ in every cell, zero parse failures, and zero decoder-name mismatches. Fifteen warning-no-syndrome events occur only in GKP-Cirq rows. Within-family ordering is stable in both families ($\mathrm{BP}<\mathrm{MWPM}<\mathrm{UF}$); source-averaged flip counts are 2.435, 4.768, and 5.870 for surface and 1.595, 2.908, and 3.681 for GKP. Relative to MWPM, BP reduces mean intervention volume by $48.9\%$ in surface and $45.1\%$ in GKP. Source-vs-reference effects are family dependent, with larger coherent shifts in GKP. Source-bootstrap ranks remain unchanged, and hidden-truth sidecars add an outer-code logical-parity error-rate check in which UF has the largest source-mean rate in both families. The comparison is stack-aware, contract-verified, and avoids raw cross-family threshold-equivalence claims.

quant-pharXiv:2607.19446•Jul 22, 2026•0 citations

When to Skip Syndrome Extraction in Surface-GKP Codes

Vaughn Sohn, Changhun Oh

Fault-tolerant quantum error correction requires repeated syndrome extraction to address errors induced by the syndrome-extraction circuit itself. However, repeated syndrome extraction incurs significant overhead in terms of gate count and ancilla consumption (e.g., Gottesman-Kitaev-Preskill (GKP) states). Moreover, noisy syndrome extraction can itself inject additional errors into the data qubits. To address these issues, we propose a concrete adaptive skipping scheme for the surface-GKP code, a representative GKP-concatenated architecture, that uses analog information naturally generated during inner GKP correction. At each round, the scheme selects one of four actions: measuring both Z-type and X-type surface-code stabilizers, measuring only one type, or skipping both types and reusing previous syndromes. The decision is based on a reliability comparison between reusing the previous syndrome value and performing a new noisy syndrome extraction. Using circuit-level simulations, we show that the adaptive skipping scheme can reduce the number of surface-code stabilizer measurements while maintaining logical error rates comparable to or lower than those of the full-measurement baseline. The improvement is most pronounced when gate and measurement noise are larger than idle noise, so that avoiding unnecessary syndrome extraction reduces the noise injected into the code. These results indicate that analog information from inner GKP correction can be used not only to improve decoding but also to reduce the measurement overhead of outer-code syndrome extraction.

quant-pharXiv:2606.24469•Jun 24, 2026•0 citations

Syndrome resampling enhances quantum error correction thresholds

Luis Colmenarez, Áron Márton, Markus Müller

Quantum error correction (QEC) enables fault-tolerant quantum computation but requires operating quantum hardware at physical error rates below code-dependent thresholds, which remains challenging for current devices. We introduce syndrome resampling, a general method that increases QEC thresholds of any decoder and suppresses logical errors without additional hardware, decoding modifications, or code-specific assumptions beyond syndrome statistics. The method exploits the fact that syndromes with low probability are likely to lead to logical failure, therefore biasing syndrome averages towards most likely syndromes effectively increases logical fidelities. We establish a direct connection between the Rényi coherent information (RCI) and powers of the syndrome probability distribution, showing that resampling syndromes according to these powers combined with maximum likelihood decoding (MLD) realizes a family of optimal thresholds associated with phase transitions in the RCI. Numerical simulations of surface codes demonstrate that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders and reduces logical error rates by up to four orders of magnitude in experimentally relevant regimes. We further show that syndrome resampling can be effectively implemented from finite data and combined with decoding-based post-selection to achieve additional gains. Finally, applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates without requiring additional measurements. Our results provide a practical and decoder-agnostic route to improved logical fidelities in near-term QEC experiments.

quant-pharXiv:2605.06101•Physical Review Letters•May 8, 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

Layer codes as quantum memories: syndrome extraction, thresholds and idle robustness

Zhu Sun, Zhenyu Cai

Layer codes are three-dimensional local CSS codes of check weight at most six, obtained by quasi-concatenating a CSS input code with unrotated surface code patches. What is established about them describes the code, not the circuit that measures it. In this work, we evaluate them as active memories under circuit-level noise. Doing so first requires a syndrome extraction circuit, and the junction stabilizers that couple the patches rule out borrowing a surface code patch's CNOT schedule. We present a decoder-free scheduler that constrains hook propagation first and compresses depth afterwards, generate circuits for eighteen layer codes across four input codes, and compare them with surface codes of the same distance, simulated and decoded in the same way. The circuits lose no distance to hook errors on [[4,2,2]]-input codes wherever a circuit-distance proof is affordable, and reach a lower logical error rate than those of a general-purpose scheduler for CSS codes at roughly half its CNOT depth per round. Our primary family built from a [[4,2,2]] input code reaches a circuit-level threshold of $5.06(7)\times10^{-3}$. The layer code outperforms the surface code in terms of idle robustness: at the same distance it tolerates an interval between syndrome extraction rounds 1.7-3.0 times longer than the rotated surface code. This comes at the cost of 1.7-5.0 times more operations per unit time and approximately five times more physical qubits, both per logical qubit. Finally, we model the cost of the beyond-2D cross-plane CNOTs that the construction demands, and find that their speed matters far more than their fidelity.

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

Exact Syndrome Measurement Budgets for Quantum Erasure Correction: Stabilizer-Code Rank Profiles, Distance Bounds, and Linear-Time Surface-Code Check Selection

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.

•Oct 30, 2026•0 citations
Quantum error-correction experiments increasingly require a verified interface between measured syndrome bits and decoder-native correction requests. We report a four-branch syndrome-to-decoder mapping audit spanning a five-data-qubit repetition code, a distance-five surface Z-check interface, a compact Steane CSS benchmark, and a digitized-GKP proxy. For the surface interface, an independent noiseless interpreter verifies 40/40 single-X syndrome columns and data-bit round trips, while a reversed-register negative control fails for all 40 targets. Sampled hardware and local-noise streams are then analyzed with exact binary minimum-weight representatives to separate mapping validity from noisy localization. The results establish a narrow interface-conformance claim, not a decoder benchmark, threshold estimate, or logical-QEC demonstration.
We present a contract-preserving, family-aware comparison of decoder behavior across four syndrome-generation stacks (PennyLane, Qiskit, Cirq, and a LiDMaS+ reference) under a fixed replay interface. Request streams from repeated-round surface-code and digitized-GKP circuits are replayed through BP, MWPM, and UF with matched controls. The unified matrix spans 24 cells and achieves line-level integrity: 24 00024\,00024000 request lines, 24 00024\,00024000 response lines, response ratio =1.0=1.0=1.0 in every cell, zero parse failures, and zero decoder-name mismatches. Fifteen warning-no-syndrome events occur only in GKP-Cirq rows. Within-family ordering is stable in both families (BP<MWPM<UF\mathrm{BP}<\mathrm{MWPM}<\mathrm{UF}BP<MWPM<UF); source-averaged flip counts are 2.435, 4.768, and 5.870 for surface and 1.595, 2.908, and 3.681 for GKP. Relative to MWPM, BP reduces mean intervention volume by 48.9%48.9\%48.9% in surface and 45.1%45.1\%45.1% in GKP. Source-vs-reference effects are family dependent, with larger coherent shifts in GKP. Source-bootstrap ranks remain unchanged, and hidden-truth sidecars add an outer-code logical-parity error-rate check in which UF has the largest source-mean rate in both families. The comparison is stack-aware, contract-verified, and avoids raw cross-family threshold-equivalence claims.
Fault-tolerant quantum error correction requires repeated syndrome extraction to address errors induced by the syndrome-extraction circuit itself. However, repeated syndrome extraction incurs significant overhead in terms of gate count and ancilla consumption (e.g., Gottesman-Kitaev-Preskill (GKP) states). Moreover, noisy syndrome extraction can itself inject additional errors into the data qubits. To address these issues, we propose a concrete adaptive skipping scheme for the surface-GKP code, a representative GKP-concatenated architecture, that uses analog information naturally generated during inner GKP correction. At each round, the scheme selects one of four actions: measuring both Z-type and X-type surface-code stabilizers, measuring only one type, or skipping both types and reusing previous syndromes. The decision is based on a reliability comparison between reusing the previous syndrome value and performing a new noisy syndrome extraction. Using circuit-level simulations, we show that the adaptive skipping scheme can reduce the number of surface-code stabilizer measurements while maintaining logical error rates comparable to or lower than those of the full-measurement baseline. The improvement is most pronounced when gate and measurement noise are larger than idle noise, so that avoiding unnecessary syndrome extraction reduces the noise injected into the code. These results indicate that analog information from inner GKP correction can be used not only to improve decoding but also to reduce the measurement overhead of outer-code syndrome extraction.
Quantum error correction (QEC) enables fault-tolerant quantum computation but requires operating quantum hardware at physical error rates below code-dependent thresholds, which remains challenging for current devices. We introduce syndrome resampling, a general method that increases QEC thresholds of any decoder and suppresses logical errors without additional hardware, decoding modifications, or code-specific assumptions beyond syndrome statistics. The method exploits the fact that syndromes with low probability are likely to lead to logical failure, therefore biasing syndrome averages towards most likely syndromes effectively increases logical fidelities. We establish a direct connection between the Rényi coherent information (RCI) and powers of the syndrome probability distribution, showing that resampling syndromes according to these powers combined with maximum likelihood decoding (MLD) realizes a family of optimal thresholds associated with phase transitions in the RCI. Numerical simulations of surface codes demonstrate that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders and reduces logical error rates by up to four orders of magnitude in experimentally relevant regimes. We further show that syndrome resampling can be effectively implemented from finite data and combined with decoding-based post-selection to achieve additional gains. Finally, applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates without requiring additional measurements. Our results provide a practical and decoder-agnostic route to improved logical fidelities in near-term QEC experiments.
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.
Layer codes are three-dimensional local CSS codes of check weight at most six, obtained by quasi-concatenating a CSS input code with unrotated surface code patches. What is established about them describes the code, not the circuit that measures it. In this work, we evaluate them as active memories under circuit-level noise. Doing so first requires a syndrome extraction circuit, and the junction stabilizers that couple the patches rule out borrowing a surface code patch's CNOT schedule. We present a decoder-free scheduler that constrains hook propagation first and compresses depth afterwards, generate circuits for eighteen layer codes across four input codes, and compare them with surface codes of the same distance, simulated and decoded in the same way. The circuits lose no distance to hook errors on [[4,2,2]]-input codes wherever a circuit-distance proof is affordable, and reach a lower logical error rate than those of a general-purpose scheduler for CSS codes at roughly half its CNOT depth per round. Our primary family built from a [[4,2,2]] input code reaches a circuit-level threshold of 5.06(7)×10−35.06(7)\times10^{-3}5.06(7)×10−3. The layer code outperforms the surface code in terms of idle robustness: at the same distance it tolerates an interval between syndrome extraction rounds 1.7-3.0 times longer than the rotated surface code. This comes at the cost of 1.7-5.0 times more operations per unit time and approximately five times more physical qubits, both per logical qubit. Finally, we model the cost of the beyond-2D cross-plane CNOTs that the construction demands, and find that their speed matters far more than their fidelity.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.