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
Fault-Tolerant Logical Clifford Gates from Code Automorphisms
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.
-
Symmetry-enriched topological order and quasifractonic behavior in $\mathbb{Z}_N$ stabilizer codes
Z_N bivariate-bicycle codes have essential topological properties determined by their Z_p prime-factor counterparts, enabling generalization of algebraic-geometric methods to anyon fusion rules and resolution of quasi...
-
Parallel Logical Measurements via Quantum Code Surgery
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
-
Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes
An algorithm converts topological data of 2D bulk stabilizer codes into 1D boundary subsystem codes via operator algebra and normal forms, enabling automatic generation of boundaries and defects demonstrated on toric,...
-
CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling
CAbLECAR provides a robotics-inspired shuttle scheduler that enables QLDPC codes on tileable spin-qubit hardware, yielding up to 86% faster schedules and orders-of-magnitude gains in encoding efficiency and logical er...
-
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.
-
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 with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.