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
σ3,5⋆=0.10 (1911/2000 valid) and
σ5,7⋆=0.1375 (1941/2000 valid), while other decoders show no valid crossing samples. Dense-window scanning over
σ∈[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, 95\% interval
[−0.0104,0.00329]) across
σ∈[0.05,0.35]. Threaded execution preserves statistical fidelity while improving throughput:
1.34× speedup in Pauli mode and
1.94× in native GKP mode, with mean
∣ΔLER∣ 6.07×10−3 and
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.
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 and
ε=0.05, corresponding to GKP squeezing of
20 and
13dB, the estimated thresholds are
γ∗=5.5% (
0.24dB) and
γ∗=5.9% (
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% (
0.45dB) and
γ∗=6.3% (
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.