Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid

Georgia M. Nixon, Campbell K. McLauchlan, Charles C. L. van Rest · 2026 · arXiv 2026

| 编号 QE167 | 主题 qLDPC 码 | 链接 arXiv:2606.20263 |

摘要

摘要保留原文（英文）

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

The surface code is a promising route towards large-scale quantum computing, requiring only nearest-neighbour gates amenable to superconducting hardware. However, surface codes incur large qubit overheads. Novel quantum low-density parity check (qLDPC) codes promise to reduce overheads but require long-range connections that are difficult to achieve on superconducting platforms. Here, we introduce “Vine Codes” - qLDPC codes that are implementable on a planar square grid through nearest-neighbour, two-qubit gates native to superconducting platforms (iSWAP and CZ). Our approach generalises “Directional Codes” recently introduced by Gehér et. al. (2025) which are constrained to a torus. In cont

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