Parsimonious Quantum Low-Density Parity-Check Code Surgery

Andrew C. Yuan et al. · 2026 · arXiv

| 编号 QE334 | 主题 容错协议 | 链接 arXiv:2603.05082 |

摘要

摘要保留原文（英文）

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

Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schemes, including parallel surgery, universal adapters and fast surgery, and serves as the key primitive in extractor architectures. The efficiency of these schemes crucially depends on constructing low-overhead ancilla systems for measuring arbitrary logical operators in general quantum Low-Density Parity-Check (qLDPC) codes. In this work, we introduce a method to construct an ancilla system of qubit size $O(W\log W)$ to measure an arbitrary logical Pauli operator of weight $W$ in any qLDPC stabilizer code. This new construction immediately reduces the asymptotic overhead across various quantum code surgery schemes.

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