跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.23762 · v1

Addressable transversal CCZ gates on almost good quantum LDPC codes and nearly optimal magic state protocols

首次提交 2026-11-18 11:16
版本更新 2026-11-18 11:16
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

Assuming uniform subfield product expansion, we construct quantum low-density parity-check (qLDPC) codes with distances Ωε(N/log⁡2N)Ω_ε(N/\log^2N) and at least N1−εN^{1-ε} individually addressable logical CCZ gates on pairwise disjoint triples of logical qubits, for every fixed 0<ε<10<ε<1. With all logical qubits outside these triples initialized to ∣0⟩|0\rangle, any subset of the corresponding logical CCZ gates can be implemented with a transversal physical CCZ circuit. As applications, we obtain two nearly optimal magic state protocols: CCZ distillation with arbitrarily small overhead exponent γ→0γ\rightarrow 0 and error suppression of nearly linear order, and a magic state fountain that directly prepares N1−εN^{1-ε} encoded CCZ magic states with nearly linear distance Ωε(N/log⁡2N)Ω_ε(N/\log^2N). The construction uses balanced products of expanding graph covers. The assumption concerns Reed--Solomon codes on three subfields of characteristic two and pairwise coprime extension degrees, a local hypothesis studied in a companion manuscript. We design the expanding graph covers to admit many common classical codewords, which yield logical operators whose pairings select the logical CCZ gates independently. Without the product expansion assumption, the graph covers also yield classical LDPC codes over a fixed field with almost linear dimension and linear distance that satisfy a multiplication property: the coordinatewise product of any three codewords lies in a second LDPC code of linear distance.

作者备注:69 pages + Appendices

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 11:16 · 最新观测版本

Addressable transversal CCZ gates on almost good quantum LDPC codes and nearly optimal magic state protocols

Assuming uniform subfield product expansion, we construct quantum low-density parity-check (qLDPC) codes with distances Ωε(N/log⁡2N)Ω_ε(N/\log^2N) and at least N1−εN^{1-ε} individually addressable logical CCZ gates on pairwise disjoint triples of logical qubits, for every fixed 0<ε<10<ε<1. With all logical qubits outside these triples initialized to ∣0⟩|0\rangle, any subset of the corresponding logical CCZ gates can be implemented with a transversal physical CCZ circuit. As applications, we obtain two nearly optimal magic state protocols: CCZ distillation with arbitrarily small overhead exponent γ→0γ\rightarrow 0 and error suppression of nearly linear order, and a magic state fountain that directly prepares N1−εN^{1-ε} encoded CCZ magic states with nearly linear distance Ωε(N/log⁡2N)Ω_ε(N/\log^2N). The construction uses balanced products of expanding graph covers. The assumption concerns Reed--Solomon codes on three subfields of characteristic two and pairwise coprime extension degrees, a local hypothesis studied in a companion manuscript. We design the expanding graph covers to admit many common classical codewords, which yield logical operators whose pairings select the logical CCZ gates independently. Without the product expansion assumption, the graph covers also yield classical LDPC codes over a fixed field with almost linear dimension and linear distance that satisfy a multiplication property: the coordinatewise product of any three codewords lies in a second LDPC code of linear distance.

查看此版本解读 →查看此版本原文 ↗