Scholarlink

<p>Quantum error correction is essential for building utility-scale quantum computers that outperform classical machines, yet leading approaches incur substantial physical qubit overhead. Quantum low-density parity check (QLDPC) codes offer a promising alternative by significantly reducing the number of physical qubits required per logical qubit. However, existing work on QLDPC codes has focused primarily on quantum memories, with no efficient method known for implementing arbitrary logical Clifford operations at low circuit depth. Here, we introduce a new family of QLDPC codes that enables efficient implementation of the full Clifford group via transversal operations, allowing any <i>m</i>-qubit Clifford operation to be executed in at most <i>O</i>(<i>m</i>) syndrome extraction rounds. We run circuit-level simulations of depth-126 logical circuits to demonstrate the near-memory logical performance of these logical operations. In combination with known methods for implementing <i>T</i> gates, these results establish QLDPC codes as a viable route toward resource-efficient universal quantum computation.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Computing efficiently in QLDPC codes

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月20日

查看全文
  • Alexander J. Malcolm,
  • Andrew N. Glaudell,
  • Patricio Fuentes,
  • Daryus Chandra,
  • Alexis Schotte,
  • Colby DeLisle,
  • Rafael Haenel,
  • Amir Ebrahimi,
  • Joschka Roffe,
  • Armanda O. Quintavalle,
  • Stefanie J. Beale,
  • Nicholas R. Lee-Hone,
  • Stephanie Simmons

摘要

Quantum error correction is essential for building utility-scale quantum computers that outperform classical machines, yet leading approaches incur substantial physical qubit overhead. Quantum low-density parity check (QLDPC) codes offer a promising alternative by significantly reducing the number of physical qubits required per logical qubit. However, existing work on QLDPC codes has focused primarily on quantum memories, with no efficient method known for implementing arbitrary logical Clifford operations at low circuit depth. Here, we introduce a new family of QLDPC codes that enables efficient implementation of the full Clifford group via transversal operations, allowing any m-qubit Clifford operation to be executed in at most O(m) syndrome extraction rounds. We run circuit-level simulations of depth-126 logical circuits to demonstrate the near-memory logical performance of these logical operations. In combination with known methods for implementing T gates, these results establish QLDPC codes as a viable route toward resource-efficient universal quantum computation.