Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
Varun Menon et al. · 2025 · Physical Review X
| 编号 QE319 | 主题 容错协议 | 链接 arXiv:2508.10714 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
The preparation of high-fidelity non-Clifford (magic) states is an essential subroutine for universal quantum computation, but imposes substantial space-time overhead. Magic state factories based on high rate and distance quantum low-density parity check (LDPC) codes equipped with transversal non-Clifford gates can potentially reduce these overheads significantly, by circumventing the need for multiple rounds of distillation and by producing a large number of magic states in a single code-block. As a step towards realizing efficient, fault-tolerant magic state production, we introduce a class of finite block-length quantum LDPC codes which we name tricycle codes, generalizing the well-known bicycle codes to three homological dimensions. These codes can support constant-depth physical circuits that implement logical gates between three code blocks. To construct these constant-depth circuits, we develop new analytical and numerical techniques that apply to a broad class of three-dimensional homological and balanced product codes. We further show that tricycle codes enable single-shot state-preparation and error correction, leading to a highly efficient magic-state generat
本站词条在引用该文献时，会以 wikilink（sources/QE319）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。