REVIEW 8 cited by
Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
For every integer $r\geq 2$ and every $\epsilon>0$, we construct an explicit infinite family of quantum LDPC codes supporting a transversal $C^{r-1}Z$ gate with length $N$, dimension $K\geq N^{1-\epsilon}$, distance $D\geq N^{1/r}/\operatorname{poly}(\log N)$, and stabilizer weight $w\leq\operatorname{poly}(\log N)$. The previous state of the art construction (in most parameter regimes) was the $r$-dimensional color code, which has only constant dimension $K=O(1)$, and otherwise has the same parameters up to polylogarithmic factors. Our construction provides the first known codes with low-weight stabilizers that are capable of magic state distillation with arbitrarily small yield parameter $\gamma=\log(N/K)/\log(D)>0$. A classical analogue of transversal $C^{r-1}Z$ gates is given by the multiplication property, which requires component-wise products of classical codewords to belong to another similar code. As a byproduct of our techniques, we also obtain a new construction of classical locally testable codes with such a multiplication property. We construct our codes as products of chain complexes associated to classical LDPC codes, which in turn we obtain by imposing local Reed-Solomon codes on a specific spectral expander that we construct. We prove that our codes support the desired transversal $C^{r-1}Z$ gates by using the multiplication property to combine local circuits based on the topological structure.
Forward citations
Cited by 8 Pith papers
-
Logical computation with canonical lifted product codes
Canonical lifted-product qLDPC codes admit a row/column cyclic logical basis that enables constant-seed modular surgery, compact extractors, and parallel Clifford and magic primitives.
-
Restrictions on non-Clifford fault tolerance and ruling out beyond-SQL quantum metrology
Constant signal-aligned noise makes asymptotic beyond-SQL quantum sensing impossible for any protocol, including encoded, biased, adaptive, and nonstabilizer schemes.
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
-
Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization
Parity-aware BPE, which prioritizes the worst-compressed language at each merge, cuts cross-lingual tokenization inequality by up to 89% at negligible global cost.
-
Automorphism gadgets in homological product codes
Permutation automorphisms of input codes induce logical operations on homological product codes, implementable by physical qubit permutations plus a subsystem circuit, with effective distance preservation when permuta...
-
Transversal non-Clifford gates on qLDPC codes breaking the $\sqrt{N}$ distance barrier and quantum-inspired geometry with $\mathbb{Z}_2$ systolic freedom
A triple homological product of good quantum LDPC codes achieves distance N^(2/3) with transversal CCZ gates and prepares N^(1/3) magic states in a single round.
-
Multivariate Multicycle Codes for Complete Single-Shot Decoding
Koszul complexes built from four polynomial generators over cyclic group rings yield CSS codes with both X and Z metachecks, giving small, high-confinement, single-shot-decodable quantum codes.
-
Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits
The main theorem claiming constant-depth logical CCZ gates exist from many 'magic-friendly triples' has mutually inconsistent hypotheses, and its key local-implementation step is unproved.
Discussion (0). Sign in to comment.