arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.25757quant-phcs.ITmath.IT
收藏

表面码阈值估计中的解码器依赖性:基于原生Gottesman-Kitaev-Preskill数字化与并行化采样

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

College of Computing, Georgia Institute of Technology(佐治亚理工学院计算学院);SchroSIM Quantum Software Project(SchroSIM量子软件项目);Volkswagen AG(大众汽车股份公司);Department of Physics, RWTH Aachen(亚琛工业大学物理系);Department of Computational and Applied Mechanics, Federal University of Juiz de Fora(茹伊斯德福拉联邦大学计算与应用力学系);Institute of Information Systems, University of Lübeck(吕贝克大学信息系统研究所)

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

AI总结:

本文研究了在Pauli噪声和原生GKP风格高斯位移数字化下表面码阈值估计中的解码器依赖性,通过LiDMaS+ v1.1.0对多种解码器进行基准测试,发现MWPM和UF在性能上占据帕累托前沿,而其他解码器表现较差,同时并行化执行提升了效率和统计保真度。

摘要:

本文量化了在Pauli噪声和原生GKP风格高斯位移数字化下表面码阈值研究中的解码器依赖性。使用LiDMaS+ v1.1.0,我们对MWPM、Union-Find (UF)、Belief Propagation (BP) 和神经引导的MWPM进行了基准测试,使用固定种子、相同的扫描网格和统一的报告方式。在d=5和σ=0.20时,MWPM和UF定义了帕累托前沿,其(运行时间,误码率)分别为(1.341秒,0.2273)和(1.332秒,0.2303);神经引导的MWPM较慢且不准确(1.396秒,0.3730),而BP被主导(7.640秒,0.6107)。交叉-bootstrap诊断仅在MWPM中稳定,中位数σ*_{3,5}=0.10(1911/2000有效)和σ*_{5,7}=0.1375(1941/2000有效),而其他解码器没有有效的交叉样本。在σ∈[0.08,0.24]范围内密集窗口扫描返回所有解码器的NaN交叉,证实了估计器和窗口敏感的阈值定位。排名稳定性和效应大小bootstrap分析加强了排序的稳健性:BP保持第4名,神经引导的MWPM排名第3,MWPM-UF差异很小(Δ_{MWPM-UF}=-0.00383,95%区间[-0.0104,0.00329])在σ∈[0.05,0.35]范围内。线程执行在保持统计保真度的同时提高了吞吐量:在Pauli模式下速度提高了1.34倍,在原生GKP模式下提高了1.94倍,平均|ΔLER|分别为6.07×10^{-3}和5.20×10^{-3}。因此,我们建议结合运行时间-保真度检查的估计器条件阈值报告,以实现可重复的面向硬件的未来解码器基准测试工作流程。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑