← 研踪 PaperTrailarXiv: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
摘要
Assuming uniform subfield product expansion, we construct quantum low-density parity-check (qLDPC) codes with distances and at least individually addressable logical CCZ gates on pairwise disjoint triples of logical qubits, for every fixed . With all logical qubits outside these triples initialized to , 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 and error suppression of nearly linear order, and a magic state fountain that directly prepares encoded CCZ magic states with nearly linear distance . 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
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 and at least individually addressable logical CCZ gates on pairwise disjoint triples of logical qubits, for every fixed . With all logical qubits outside these triples initialized to , 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 and error suppression of nearly linear order, and a magic state fountain that directly prepares encoded CCZ magic states with nearly linear distance . 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.
查看此版本解读 →查看此版本原文 ↗