The dynamic 4.8.8 Floquet code

Aliki A. Capatos · 2026 · arXiv

| 编号 QE110 | 主题 拓扑码 | 链接 arXiv:2606.09678 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Fault-tolerant quantum memories depend on the syndrome extraction circuit as much as on the underlying code. Ancilla-free or dynamic circuits are an effective way to improve this circuit layer. For the 6.6.6 honeycomb Floquet code, making the circuit dynamic raises the threshold and lowers the qubit overhead, but at the cost of halving the spatial code distance. A dynamic construction for the 4.8.8 lattice layout was conjectured to preserve full distance. I confirm this and give a dynamic measurement circuit for the CSS 4.8.8 Floquet code. To benchmark it, I construct and compare four circuit-level implementations on a torus, including two dynamic variants (with and without mid-circuit resets), the standard ancilla-based circuit, and a pipelined ancilla-based circuit. Under circuit-level depolarising noise, the reset dynamic circuit reaches a per-round threshold of $0.463$ $(0.490$ with MWPM (BP+matching), while the no-reset variant reaches the highest threshold of all four circuits at $0.512$ $(0.574$. The standard ancilla-based circuit only achieves $0.228$ $(0.240$, but the pipelined schedule reaches $0.478$ $(0.489$. The reset dynamic circuit also has a fast

本站词条在引用该文献时，会以 wikilink（sources/QE110）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。