Abstract:We identify a period-4 measurement schedule for the checks of the Bacon-Shor code that fully covers spacetime with constant-weight detectors, and is numerically observed to provide the code with a threshold. Unlike previous approaches, our method does not rely on code concatenation and instead arises as the solution to a coloring game on a square grid. Under a uniform circuit-level noise model, we observe a threshold of approximately $0.3\%$ when decoding with minimum weight perfect matching, and we conjecture that this could be improved using a more tailored decoder.
From: Jun Zen [view email]
[v1]
Thu, 3 Apr 2025 16:36:03 UTC (603 KB)
[v2]
Fri, 6 Feb 2026 03:03:27 UTC (601 KB)
[v3]
Wed, 12 Aug 2026 05:42:16 UTC (2,293 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。