REVIEW 8 cited by
Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry
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
We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logical gates are obtained from unitary operators given by symmetry-protected topological responses, which correspond to generators of group cohomology and can be expressed explicitly on the lattice using cohomology operations including cup product, Steenrod squares and new combinations of higher cup products called higher Pontryagin powers. Our study covers most types of the cohomology operations in the literature. This hence gives rise to logical $C^{n-1}Z$ gates in $n$ copies of quantum codes via the $n$-fold cup product in the usual color code paradigm, as well as several new classes of diagonal and non-diagonal logical gates in increasing Clifford hierarchies beyond the color code paradigm, including the logical $R_k$ and multi-controlled $C^m R_k$ gates for codes defined in projective spaces. Implementing these gates could make it more efficient to compile specific types of quantum algorithms such as Shor's algorithm. We further extend the construction to quantum codes with boundaries, which generalizes the folding approach in color codes. We also present a formalism for addressable and parallelizable logical gates in LDPC codes via higher-form symmetries. We further construct logical Clifford gates in expander-based codes including the asymptotically good LDPC codes and hypergraph-product codes. As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
Forward citations
Cited by 8 Pith papers
-
Pauli stabilizer formalism for topological quantum field theories and generalized statistics
Explicit Pauli stabilizer models are constructed for higher-form Dijkgraaf-Witten TQFTs and new fermionic/anyonic statistics of loop, membrane, and volume excitations are computed on the lattice.
-
Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes
Non-Abelian surface codes based on dihedral groups D_{4N} implement transversal phase gates T^{1/N} at any Clifford-hierarchy level in 2D, with a qubit-only version when 8N is a power of two.
-
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.
-
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.
-
Stratified Cohomological Quantum Codes via Colimits in Ch(R)
Colimit gluing of chain complexes over posets is proposed as a universal language for quantum CSS codes, but the worked examples contain errors.
Discussion (0). Continue with ORCID to comment.