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:2603.25757

Decoder Dependence in Surface-Code Threshold Estimation with Native Gottesman-Kitaev-Preskill Digitization and Parallelized Sampling

Dennis Delali Kwesi Wayo, Chinonso Onah, Leonardo Goliatt, Sven Groppe

quant-phcs.ITSubmitted Mar 25, 2026• Announced Mar 27, 2026• 0 citations• Revised Mar 31, 2026 (v2)
v1 · Mar 25, 2026v2 · Mar 31, 2026
arXivHTMLPDF

Abstract

We quantify decoder dependence in surface-code threshold studies under two matched regimes: Pauli noise and native GKP-style Gaussian displacement digitization. Using LiDMaS+ v1.1.0, we benchmark MWPM, Union-Find (UF), Belief Propagation (BP), and neural-guided MWPM with fixed seeds, identical sweep grids, and unified reporting across runs 06--14. At $d=5$ and $σ=0.20$, MWPM and UF define the Pareto frontier, with (runtime, LER) = (1.341 s, 0.2273) and (1.332 s, 0.2303); neural-guided MWPM is slower and less accurate (1.396 s, 0.3730), and BP is dominated (7.640 s, 0.6107). Crossing-bootstrap diagnostics are stable only for MWPM, with median $σ^\star_{3,5}=0.10$ (1911/2000 valid) and $σ^\star_{5,7}=0.1375$ (1941/2000 valid), while other decoders show no valid crossing samples. Dense-window scanning over $σ\in [0.08,0.24]$ returns NaN crossings for all decoders, confirming estimator- and window-sensitive threshold localization. Rank-stability and effect-size bootstrap analyses reinforce ordering robustness: BP remains rank 4, neural-guided MWPM rank 3, and MWPM-UF differences are small ($Δ_{\mathrm{MWPM-UF}}=-0.00383$, 95\% interval $[-0.0104,0.00329]$) across $σ\in [0.05,0.35]$. Threaded execution preserves statistical fidelity while improving throughput: $1.34\times$ speedup in Pauli mode and $1.94\times$ in native GKP mode, with mean $|Δ\mathrm{LER}|$ $6.07\times10^{-3}$ and $5.20\times10^{-3}$, respectively. We therefore recommend estimator-conditional threshold reporting coupled to runtime-fidelity checks for reproducible hardware-facing practical future decoder benchmarking workflows.

Related papers

Decoder Dependence in Surface-Code Threshold Estimation under Digitized Hybrid Continuous-Variable and Discrete Noise

Dennis Delali Kwesi Wayo, Chinonso Onah, Leonardo Goliatt +1 more

Surface-code threshold estimates depend on the inference pipeline, including decoder and estimator choices. We compare decoders within a single LiDMaS+ workflow under Pauli-reference and digitized hybrid continuous-variable/discrete sweeps. In the Pauli-reference mode, the matching-style backend outperforms Union-Find and yields crossing median $p_c=0.0531$ (bootstrap interval $[0.0415,0.0572]$) and collapse fit $p_c=0.052$ ($ν=1.35$). For the hybrid mode, a dense transition-window sweep at $d=3,5,7$ uses $σ\in[0.30,0.50]$ with step $0.01$ and $3000$ trials per point. After the initial exact-zero plateau is excluded from crossing localization, the matching-style backend gives interior crossing estimates $σ_c=0.4707$ for $(d=3,5)$ and $σ_c=0.3275$ for $(d=5,7)$; the latter lies in a low-LER region and remains estimator-sensitive. A targeted $d=9$ extension shows larger Union-Find LER at moderate-to-high $σ$ and matching-fallback rates up to $0.747$ at $σ=0.50$. In a $d=5$ neural-guidance sensitivity sweep, full learned reweighting reduces the sampled mean LER from $0.1773$ to $0.1663$ over $σ\in[0.35,0.55]$. These results show that estimator resolution and backend fallback diagnostics are part of an auditable decoder comparison.

quant-pharXiv:2603.06730•Fortschritte der Physik•Mar 9, 2026•0 citations

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

Decoder Dependence in Surface-Code Threshold Estimation with Native Gottesman-Kitaev-Preskill Digitization and Parallelized Sampling

Dennis Delali Kwesi Wayo, Chinonso Onah, Leonardo Goliatt +1 more

•Jan 1, 2026•0 citations

Achieving Thresholds via Standalone Belief Propagation on Surface Codes

Pedro Hack, Luca Menti, Francisco Lazaro +1 more

The standard approach to Belief Propagation (BP) decoding passes messages on the Tanner graph of the quantum error-correcting (QEC) code, and is known to lack a threshold for the surface code. We propose novel BP decoders that exchange messages on the decoding graph and obtain thresholds (both for code capacity and circuit-level noise) via standalone BP for the surface code under depolarizing noise. Our approach, similarly to the minimum weight perfect matching (MWPM) decoder, is applicable to any graphlike QEC code. The thresholds observed with our decoders are close to those obtained by MWPM. This result opens the path towards scalable hardware-accelerated implementations of MWPM-compatible decoders.

quant-pharXiv:2603.05381•Mar 6, 2026•2 citations

Enhanced noise resilience of the surface–Gottesman-Kitaev-Preskill code via designed bias

Lisa Hänggli, Margret Heinze, Robert König

We study the code obtained by concatenating the standard single-mode Gottesman-Kitaev-Preskill (GKP) code with the surface code. We show that the noise tolerance of this surface--GKP code with respect to (Gaussian) displacement errors improves when a single-mode squeezing unitary is applied to each mode, assuming that the identification of quadratures with logical Pauli operators is suitably modified. We observe noise-tolerance thresholds of up to $\ensuremath{\sigma}\ensuremath{\approx}0.58$ shift-error standard deviation when the surface code is decoded without using GKP syndrome information. In contrast, prior results by K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction, Phys. Rev. X 8, 021054 (2018) and C. Vuillot, H. Asasi, Y. Wang, L. P. Pryadko, and B. M. Terhal, Quantum error correction with the toric Gottesman-Kitaev-Preskill code, Phys. Rev. A 99, 032344 (2019) report a threshold between $\ensuremath{\sigma}\ensuremath{\approx}0.54$ and $\ensuremath{\sigma}\ensuremath{\approx}0.55$ for the standard (toric, respectively) surface--GKP code. The modified surface--GKP code effectively renders the mode-level physical noise asymmetric, biasing the logical-level noise on the GKP qubits. The code can thus benefit from the resilience of the surface code against biased noise. We use the approximate maximum likelihood decoding algorithm of S. Bravyi, M. Suchara, and A. Vargo, Efficient algorithms for maximum likelihood decoding in the surface code, Phys. Rev. A 90, 032326 (2014) to obtain our threshold estimates. Throughout, we consider an idealized scenario where measurements are noiseless and GKP states are ideal. Our paper demonstrates that Gaussian encodings of individual modes can enhance concatenated codes.

arXiv:2004.00541•Physical Review A•Nov 10, 2020•41 citations

Photon-loss tolerance of the surface-GKP code with anti-photon-loss decoding

Guan-Ju Yan, Pei-Lin Du, Ke-Min Hu +7 more

Photon loss somewhat limits fault-tolerant photonic quantum computing. We investigate its effect on finite-energy Gottesman--Kitaev--Preskill (GKP) states by modeling the pure-loss channel directly. We obtain photon-loss threshold estimates for the surface-GKP code using nearest-lattice-point inner GKP decoding and minimum-weight perfect matching for the outer surface code. For GKP states with $ε=0.01$ and $ε=0.05$, corresponding to GKP squeezing of $20$ and $13\,\mathrm{dB}$, the estimated thresholds are $γ^\ast=5.5\%$ ($0.24\,\mathrm{dB}$) and $γ^\ast=5.9\%$ ($0.26\,\mathrm{dB}$), respectively. We then introduce an anti-photon-loss inner decoder that compensates for the contraction of the measured quadrature. It increases the corresponding threshold estimates to $γ^\ast=9.8\%$ ($0.45\,\mathrm{dB}$) and $γ^\ast=6.3\%$ ($0.28\,\mathrm{dB}$). Our results highlight the importance of accounting for loss-induced lattice contraction in inner decoding and demonstrate that quadrature compensation enhances the photon-loss tolerance of surface-GKP codes for both high- and moderate-quality GKP states, providing a route toward more photon-loss-robust optical quantum computing.

quant-pharXiv:2611.00694•Nov 3, 2026•0 citations
We quantify decoder dependence in surface-code threshold studies under two matched regimes: Pauli noise and native GKP-style Gaussian displacement digitization. Using LiDMaS+ v1.1.0, we benchmark MWPM, Union-Find (UF), Belief Propagation (BP), and neural-guided MWPM with fixed seeds, identical sweep grids, and unified reporting across runs 06--14. At d=5d=5d=5 and σ=0.20σ=0.20σ=0.20, MWPM and UF define the Pareto frontier, with (runtime, LER) = (1.341 s, 0.2273) and (1.332 s, 0.2303); neural-guided MWPM is slower and less accurate (1.396 s, 0.3730), and BP is dominated (7.640 s, 0.6107). Crossing-bootstrap diagnostics are stable only for MWPM, with median σ3,5⋆=0.10σ^\star_{3,5}=0.10σ3,5⋆​=0.10 (1911/2000 valid) and σ5,7⋆=0.1375σ^\star_{5,7}=0.1375σ5,7⋆​=0.1375 (1941/2000 valid), while other decoders show no valid crossing samples. Dense-window scanning over σ∈[0.08,0.24]σ\in [0.08,0.24]σ∈[0.08,0.24] returns NaN crossings for all decoders, confirming estimator- and window-sensitive threshold localization. Rank-stability and effect-size bootstrap analyses reinforce ordering robustness: BP remains rank 4, neural-guided MWPM rank 3, and MWPM-UF differences are small (ΔMWPM−UF=−0.00383Δ_{\mathrm{MWPM-UF}}=-0.00383ΔMWPM−UF​=−0.00383, 95% interval [−0.0104,0.00329][-0.0104,0.00329][−0.0104,0.00329]) across σ∈[0.05,0.35]σ\in [0.05,0.35]σ∈[0.05,0.35]. Threaded execution preserves statistical fidelity while improving throughput: 1.34×1.34\times1.34× speedup in Pauli mode and 1.94×1.94\times1.94× in native GKP mode, with mean ∣ΔLER∣|Δ\mathrm{LER}|∣ΔLER∣ 6.07×10−36.07\times10^{-3}6.07×10−3 and 5.20×10−35.20\times10^{-3}5.20×10−3, respectively. We therefore recommend estimator-conditional threshold reporting coupled to runtime-fidelity checks for reproducible hardware-facing practical future decoder benchmarking workflows.
Surface-code threshold estimates depend on the inference pipeline, including decoder and estimator choices. We compare decoders within a single LiDMaS+ workflow under Pauli-reference and digitized hybrid continuous-variable/discrete sweeps. In the Pauli-reference mode, the matching-style backend outperforms Union-Find and yields crossing median pc=0.0531p_c=0.0531pc​=0.0531 (bootstrap interval [0.0415,0.0572][0.0415,0.0572][0.0415,0.0572]) and collapse fit pc=0.052p_c=0.052pc​=0.052 (ν=1.35ν=1.35ν=1.35). For the hybrid mode, a dense transition-window sweep at d=3,5,7d=3,5,7d=3,5,7 uses σ∈[0.30,0.50]σ\in[0.30,0.50]σ∈[0.30,0.50] with step 0.010.010.01 and 300030003000 trials per point. After the initial exact-zero plateau is excluded from crossing localization, the matching-style backend gives interior crossing estimates σc=0.4707σ_c=0.4707σc​=0.4707 for (d=3,5)(d=3,5)(d=3,5) and σc=0.3275σ_c=0.3275σc​=0.3275 for (d=5,7)(d=5,7)(d=5,7); the latter lies in a low-LER region and remains estimator-sensitive. A targeted d=9d=9d=9 extension shows larger Union-Find LER at moderate-to-high σσσ and matching-fallback rates up to 0.7470.7470.747 at σ=0.50σ=0.50σ=0.50. In a d=5d=5d=5 neural-guidance sensitivity sweep, full learned reweighting reduces the sampled mean LER from 0.17730.17730.1773 to 0.16630.16630.1663 over σ∈[0.35,0.55]σ\in[0.35,0.55]σ∈[0.35,0.55]. These results show that estimator resolution and backend fallback diagnostics are part of an auditable decoder comparison.
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.
The standard approach to Belief Propagation (BP) decoding passes messages on the Tanner graph of the quantum error-correcting (QEC) code, and is known to lack a threshold for the surface code. We propose novel BP decoders that exchange messages on the decoding graph and obtain thresholds (both for code capacity and circuit-level noise) via standalone BP for the surface code under depolarizing noise. Our approach, similarly to the minimum weight perfect matching (MWPM) decoder, is applicable to any graphlike QEC code. The thresholds observed with our decoders are close to those obtained by MWPM. This result opens the path towards scalable hardware-accelerated implementations of MWPM-compatible decoders.
We study the code obtained by concatenating the standard single-mode Gottesman-Kitaev-Preskill (GKP) code with the surface code. We show that the noise tolerance of this surface--GKP code with respect to (Gaussian) displacement errors improves when a single-mode squeezing unitary is applied to each mode, assuming that the identification of quadratures with logical Pauli operators is suitably modified. We observe noise-tolerance thresholds of up to $\ensuremath{\sigma}\ensuremath{\approx}0.58$ shift-error standard deviation when the surface code is decoded without using GKP syndrome information. In contrast, prior results by K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction, Phys. Rev. X 8, 021054 (2018) and C. Vuillot, H. Asasi, Y. Wang, L. P. Pryadko, and B. M. Terhal, Quantum error correction with the toric Gottesman-Kitaev-Preskill code, Phys. Rev. A 99, 032344 (2019) report a threshold between $\ensuremath{\sigma}\ensuremath{\approx}0.54$ and $\ensuremath{\sigma}\ensuremath{\approx}0.55$ for the standard (toric, respectively) surface--GKP code. The modified surface--GKP code effectively renders the mode-level physical noise asymmetric, biasing the logical-level noise on the GKP qubits. The code can thus benefit from the resilience of the surface code against biased noise. We use the approximate maximum likelihood decoding algorithm of S. Bravyi, M. Suchara, and A. Vargo, Efficient algorithms for maximum likelihood decoding in the surface code, Phys. Rev. A 90, 032326 (2014) to obtain our threshold estimates. Throughout, we consider an idealized scenario where measurements are noiseless and GKP states are ideal. Our paper demonstrates that Gaussian encodings of individual modes can enhance concatenated codes.
Photon loss somewhat limits fault-tolerant photonic quantum computing. We investigate its effect on finite-energy Gottesman--Kitaev--Preskill (GKP) states by modeling the pure-loss channel directly. We obtain photon-loss threshold estimates for the surface-GKP code using nearest-lattice-point inner GKP decoding and minimum-weight perfect matching for the outer surface code. For GKP states with ε=0.01ε=0.01ε=0.01 and ε=0.05ε=0.05ε=0.05, corresponding to GKP squeezing of 202020 and 13 dB13\,\mathrm{dB}13dB, the estimated thresholds are γ∗=5.5%γ^\ast=5.5\%γ∗=5.5% (0.24 dB0.24\,\mathrm{dB}0.24dB) and γ∗=5.9%γ^\ast=5.9\%γ∗=5.9% (0.26 dB0.26\,\mathrm{dB}0.26dB), respectively. We then introduce an anti-photon-loss inner decoder that compensates for the contraction of the measured quadrature. It increases the corresponding threshold estimates to γ∗=9.8%γ^\ast=9.8\%γ∗=9.8% (0.45 dB0.45\,\mathrm{dB}0.45dB) and γ∗=6.3%γ^\ast=6.3\%γ∗=6.3% (0.28 dB0.28\,\mathrm{dB}0.28dB). Our results highlight the importance of accounting for loss-induced lattice contraction in inner decoding and demonstrate that quadrature compensation enhances the photon-loss tolerance of surface-GKP codes for both high- and moderate-quality GKP states, providing a route toward more photon-loss-robust optical quantum computing.