Metraipolis › archive › dc_ade8b48b45e2
Layer codes as quantum memories: syndrome extraction, thresholds and idle robustness — arXiv:2609.39522
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39522
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:21:27.349Z
- SHA-256 of the archived text
a29377f27048eab596e1e239311f2837e09505f99d748f63e116958d4aa6f63f- Stable URL of this page
https://metraipolis.com/documento/dc_ade8b48b45e2
How to cite
Layer codes as quantum memories: syndrome extraction, thresholds and idle robustness — arXiv:2609.39522 — arXiv (en), https://arxiv.org/abs/2609.39522 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ade8b48b45e2 (Metraipolis archive dc_ade8b48b45e2, sha256 a29377f27048eab596e1e239311f2837e09505f99d748f63e116958d4aa6f63f)
BibTeX
@misc{dcade8b48b45e2,
title = {Layer codes as quantum memories: syndrome extraction, thresholds and idle robustness — arXiv:2609.39522},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39522},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ade8b48b45e2; sha256 a29377f27048eab596e1e239311f2837e09505f99d748f63e116958d4aa6f63f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39522. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Layer codes are three-dimensional local CSS codes of check weight at most six, obtained by quasi-concatenating a CSS input code with unrotated surface code patches. What is established about them describes the code, not the circuit that measures it. In this work, we evaluate them as active memories under circuit-level noise. Doing so first requires a syndrome extraction circuit, and the junction stabilizers that couple the patches rule out borrowing a surface code patch's CNOT schedule. We present a decoder-free scheduler that constrains hook propagation first and compresses depth afterwards, generate circuits for eighteen layer codes across four input codes, and compare them with surface codes of the same distance, simulated and decoded in the same way. The circuits lose no distance to hook errors on [[4,2,2]]-input codes wherever a circuit-distance proof is affordable, and reach a lower logical error rate than those of a general-purpose scheduler for CSS codes at roughly half its CNOT depth per round. Our primary family built from a [[4,2,2]] input code reaches a circuit-level threshold of $5.06(7)\times10^{-3}$. The layer code outperforms the surface code in terms of idle robustness: at the same distance it tolerates an interval between syndrome extraction rounds 1.7-3.0 times longer than the rotated surface code. This comes at the cost of 1.7-5.0 times more operations per unit time and approximately five times more physical qubits, both per logical qubit. Finally, we model the cost of the beyond-2D cross-plane CNOTs that the construction demands, and find that their speed matters far more than their fidelity.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.39522 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:53:56.698Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).