REVIEW 9 cited by
Fault-Tolerant Logical Clifford Gates from Code Automorphisms
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
read the original abstract
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted. We provide a rigorous formulation of the method for finding automorphisms of stabilizer codes and generalize ZX-dualities to non-CSS codes. We provide a Python package implementing our algorithms which uses the computational algebra system MAGMA. Our algorithms map automorphism group generators to physical circuits, calculate Pauli corrections based on the destabilizers of the code, and determine their logical action. We discuss the fault tolerance of the circuits and include examples of gates through automorphisms for the [[4,2,2]] and perfect [[5,1,3]] codes, bivariate bicycle codes, and the best known distance codes.
Forward citations
Cited by 9 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.
-
Finding diagonal logical gates in CSS codes and circuits
Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.
-
Hardware-tailored logical Clifford circuits for stabilizer codes
A discrete optimization over Clifford gauges compiles hardware-tailored logical Clifford circuits for arbitrary stabilizer codes, demonstrated on iceberg, twisted toric, and color codes.
-
No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits
No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.
-
Sequences of Bivariate Bicycle Codes from Covering Graphs
Bivariate bicycle quantum codes form infinite families via graph covers: the [[144,12,12]] gross code is a double cover of [[72,12,6]], with logical-operator lifting and parameter bounds.
-
Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors
New minimum-distance bounds for generalized bicycle codes are used to construct two degree-4 check families, [[d^2+1,2,d]] and [[d^2,2,d]], with surface-code-comparable simulated thresholds and a logical CNOT via relabeling.
-
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...
-
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.
Discussion (0). Sign in to comment.