AI 中文总结
研究推测性窗口解码的验证器方面，基于重构的SWIPER框架构建，确定跨边界决策的可预测性范围和爆炸半径界限，通过编译器和运行时执行器实现准确恢复并消除停顿，还明确了与解码器无关的结果。
AI 中文摘要
推测性窗口解码器通过猜测连接相邻解码窗口的跨边界决策、对猜测进行下游工作并延迟验证来隐藏量子纠错解码器延迟。SWIPER和ARTERY各构建一个预测器，准确率约为90%，均未构建验证器方面。我们在重构的SWIPER框架上构建验证器。仅预测器范围表明跨边界决策是局部的，三轮内可达到约0.999的准确率。我们建立了最坏情况的时间爆炸半径界限，其概率核心在Lean4中进行机器检查。我们通过逐次验证发现实际机制是全局最小权重重新配对。编译器从这些数据得出SWIPER的重启策略，运行时执行器在框架上确认循环能准确恢复并消除串行提交链停顿。第二个解码器确定哪些结果与解码器无关。
英文摘要
Speculative window decoders hide quantum error-correction decoder latency by guessing the cross-boundary decisions that link adjacent decoding windows, running downstream work on the guess, and verifying lazily. SWIPER and ARTERY each build one predictor, about 90% accurate; neither built the verifier side. We build it on a reconstructed SWIPER harness (Stim rotated surface code, minimum-weight matching). A predictor-only bracket shows the cross-boundary decision is local, the achievable accuracy reaching about 0.999 within three rounds, with small, diffuse headroom over SWIPER. We establish a worst-case temporal blast-radius bound, its probability core machine-checked in Lean4 and conditional on a modeling reduction we then test: a misprediction's effect decays exponentially in the commit width, so the radius is one and speculation adds no error floor. We falsify that reduction shot by shot and find the real mechanism, clearest at near-threshold noise, is a global minimum-weight re-pairing. A compiler pass derives SWIPER's restart policy from these numbers; a runtime executor confirms on the harness that the loop recovers exactly and removes the serial commit-chain stall up to a small penalty. A second decoder (union-find) settles which results are decoder-agnostic: the predict-verify-recover wrapper and the structural phenomenology, while the absolute magnitudes and the min-weight mechanism are matching-specific.
Comments8 pages, 4 figures, 3 tables
