arXiv:2610.06730
Qubit CSS codes with Universal Transversal Gates
Arpit Dua, Adam Holmes, Michael J. Gullans, Victor V. Albert
Abstract
The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors. The theorem constrains one partition of the qubits at a time. We show that depth-one layers of few-qubit gates, each respecting its own partition, can together generate a universal logical gate set on an error-correcting code. Each logical gate generator is then a single depth-one layer followed by error correction of the same stabilizer code, with no magic-state distillation, code switching, gauge fixing, lattice surgery, or other gadgets. We show that such codes can be found by applying an entangling circuit to a lower-distance "seed" code admitting a depth-one non-Clifford gate and an appropriate "kernel" code. We construct 47 codes with depth-one generating sets that tolerate at least one faulty gate per layer, including a [[37,1,7]] and a [[59,1,9]] code, both of check weight at most eight.
AI Summary
Can a fixed error-correcting code support universal computation using depth-one logical gates if different generators respect different qubit partitions? Eastin–Knill constrains a fixed partition. This paper constructs CSS codes with universal generating sets of disjoint few-qubit gates on changing partitions, interleaved with syndrome extraction on the same code, without magic-state injection or code switching. A seed–kernel construction couples a seed carrying a diagonal non-Clifford logical gate to an auxiliary CSS code through CNOTs. Seed bits become parities of small qubit sets, transferring the gate’s logical action while potentially increasing distance. Binary stabilizer formulas establish distances and gate-transfer conditions; explicit searches supply missing Clifford generators. The catalog includes 47 codes satisfying $d\geq2\ell+1$, guaranteeing correction of one arbitrary faulty native gate per layer. Examples include $[[37,1,7]]$ and $[[59,1,9]]$ codes with gate width $\ell=3$ and check weight at most eight. Fault tolerance is characterized by partition distance $D_{\mathcal B}$, with $\lceil d/\ell\rceil\leq D_{\mathcal B}\leq d$. The transferred parity layer obeys $D_{\mathcal B}\leq d_Z(\mathrm{seed})$, limiting protection despite increased code distance. For the 37-qubit code, an 88-qubit, 192-CNOT extraction round has verified circuit distance seven. Circuit-level simulations at $p=10^{-3}$ give memory failure $3.1\times10^{-7}$ per round but direct logical-$T$ failure $2.5\times10^{-4}$ per cycle. Limitations include partition distance three for the small examples, optimistic native-three-qubit-gate and coherence assumptions, and omitted leakage, loss, and correlated hardware errors. Practical low-check-weight constructions with larger partition distance remain open.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 25 pages, 5 figures, 6 tables. The ancillary file depth_one_universal_codes.json lists all 110 codes with their stabilizers, logical operators, depth-one generators, seed and kernel codes, and coupling circuits