Explicit construction of low-overhead gadgets for gates on quantum LDPC codes

Paul Webster, Samuel C. Smith, Lawrence Z. Cohen · 2025 · arXiv 2025

| 编号 QE131 | 主题 qLDPC 码 | 链接 arXiv:2511.15989 |

摘要

摘要保留原文（英文）

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

Quantum low-density parity check (QLDPC) codes can significantly reduce the overhead of quantum computing, provided the methods for performing logical operations do not require substantial space and time resources. A popular method for performing logical operations is by measuring logical Pauli operators. We present a simple, explicit construction for fixed gadgets that can measure arbitrary logical Pauli operators on QLDPC codes when dynamically connected to the code block. We apply this construction to a family of generalised bicycle codes with distances relevant to utility-scale quantum computation ($10\le d\le 24$) and show that it reduces the space overhead by at least an order of ma

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