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

Abstract

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$ ($\nu =1.35$). For the hybrid mode, a dense transition-window sweep at $d=3,5,7$ uses $\sigma \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 ${\sigma }_c=0.4707$ for $(d=3,5)$ and ${\sigma }_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 $\sigma$ and matching-fallback rates up to $0.747$ at $\sigma =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 $\sigma \in [0.35,0.55]$. These results show that estimator resolution and backend fallback diagnostics are part of an auditable decoder comparison.

References in corpus (21)

• Suppressing quantum errors by scaling a surface code logical qubit
• Quantum error correction below the surface code threshold
• High-threshold and low-overhead fault-tolerant quantum memory
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• The XZZX Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Beating the break-even point with a discrete-variable-encoded logical qubit
• Quantum error correction with silicon spin qubits
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Quantum control of a cat-qubit with bit-flip times exceeding ten seconds
• Parallel window decoding enables scalable fault tolerant quantum computation
• Fault-tolerant quantum computation with static linear optics
• Proof of finite surface code threshold for matching
• Tailored XZZX codes for biased noise
• Clifford-deformed Surface Codes
• Error correction of transversal CNOT gates for scalable surface code computation
• Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code
• Mitigating errors in logical qubits