Quantum Tanner Color Codes on Qubits with Transversal Gates

• URL: http://arxiv.org/abs/2510.07864v1
• Date: Thu, 09 Oct 2025 07:12:00 GMT
• Title: Quantum Tanner Color Codes on Qubits with Transversal Gates
• Authors: Kyle Gulshen, Tali Kaufman,
• Abstract summary: This work focuses on growing our understanding of how high dimensional expanders (HDX) can be utilized to construct highly performant quantum codes.<n>We develop a framework for logical gates that can naturally utilize symmetric non-product simplicial HDX.<n>We demonstrate a particular code in this framework that offers various advantages over prior constructions.
• Score: 1.7202603901525677
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work focuses on growing our understanding of how high dimensional expanders (HDX) can be utilized to construct highly performant quantum codes. While asymptotically good qLDPC codes have been constructed on 2D HDX built from products of graphs, these constructions have a number of limitations, like lack of structure useful for fault-tolerant logic. We develop a framework for transversal logical gates that can naturally utilize symmetric non-product simplicial HDX, and we demonstrate a particular code in this framework that offers various advantages over prior constructions. Specifically, we study the generalization of color codes to \emph{Tanner color codes}, which encompass color, pin, and rainbow codes, and should enable constructions with better parameters. We prove an `unfolding' theorem that characterizes the logical operators of the Tanner color code in terms of logical operators from several colored copies of the companion sheaf code. We leverage this understanding of the logical operators to identify a local condition that ensures such a code on a $D$-dimensional complex has a strictly-transversal $\frac{2 \pi}{2^D}$-phase gate on a single block, $\frac{2 \pi}{2^\ell}$-phase gates on subsets of a single block for $\ell<D$, and $C^{D-1}Z$ across $D$ blocks that preserve the code space. We explicitly instantiate our paradigm in every dimension with codes on highly-symmetric expanding coset complexes. These are the first qubit codes explicitly defined on expanding (non-product) simplicial complexes. We investigate in detail the self-dual 2D family, which has large rate $\geq \frac{7}{64}$ and transversal $CZ$, $S$, and $H$ gates, among many other fault-tolerant (generalizations of) fold-transversal gates arising from the symmetry of the complex. We conjecture that it has constant relative distance. We conclude by describing a Floquet variant of this code with check weight 4.

Related papers

• Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry [48.254879700836376]
  We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces.<n>We prove that many codes and their gates in $SU(q)$ can be inter-converted between the three state spaces.<n>We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters.
  arXiv  Detail & Related papers  (2025-09-24T20:21:30Z)
• Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
  We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry [0.0]
  We construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes.<n>We present a formalism for addressable and parallel logical gates in LDPC codes viasymmetries.<n>As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
  arXiv  Detail & Related papers  (2024-11-24T14:01:37Z)
• Cups and Gates I: Cohomology invariants and logical quantum operations [5.749787074942512]
  We show how to equip quantum codes with a structure that relaxes certain properties of a differential graded algebra. The logical gates obtained from this approach can be implemented by a constant-depth unitary circuit.
  arXiv  Detail & Related papers  (2024-10-21T17:53:17Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Quantum Rainbow Codes [0.0]
  We introduce rainbow codes, a novel class of quantum error correcting codes generalising colour codes and pin codes. Rainbow codes can be defined on any $Ddimensional simplicial complex that admits a valid $(D+1)$colouring of its $0simplices.
  arXiv  Detail & Related papers  (2024-08-23T14:56:55Z)
• Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates [23.22566380210149]
  We construct quantum codes that support $CCZ$ gates over qudits of arbitrary prime power dimension $q$. The only previously known construction with such linear dimension and distance required a growing alphabet size $q$.
  arXiv  Detail & Related papers  (2024-08-17T16:54:51Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes [1.8416014644193066]
  Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of surface codes even with near-term hardware.
  arXiv  Detail & Related papers  (2024-07-04T14:49:35Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.