Beyond transversality: structure of Clifford circuits for CSS codes

• URL: http://arxiv.org/abs/2608.05688v1
• Date: Thu, 06 Aug 2026 07:28:20 GMT
• Title: Beyond transversality: structure of Clifford circuits for CSS codes
• Abstract summary: We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes.<n>We find 78 codes whose full logical Clifford group is generated by two-fold-transversal circuits.
• Score: 0.2417342411475111
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes that are relevant to fault-tolerant logical operations. First, we show that every code-preserving Clifford circuit is a product of Z-diagonal circuits, composed of S and CZ gates, and their X-basis analogues. Second, we define the two-fold transversal group, generated by depth-one two-local code-preserving circuits, and show that each of its elements can be expressed as a product of layers consisting of either Z-diagonal, X-diagonal, or CNOT gates. As a corollary, every transversal gate is a product of three transversal diagonal circuits; for connected non-self-dual codes, two such circuits suffice. We further show that every code-preserving automorphism circuit, consisting of single-qubit Clifford gates and permutations, has a normal form comprising a Hadamard layer, a permutation, and two diagonal circuits. We also define a two-fold automorphism group, in which a depth-one two-local circuit may be code-preserving up to a permutation, and show that its logical image can be larger than that of the two-fold transversal group. For 136 CSS codes, we provide explicit generators and determine the logical image of the two-fold transversal group. We find 78 codes whose full logical Clifford group is generated by two-fold-transversal circuits, including codes of distances 3, 4, 5, 6, 8, and 12, with respective rates $2/5$, $3/4$, $1/9$, $1/5$, $2/5$, and $3/56$. We construct three families of CSS codes from bipartite grids, cut-complements, and quadrics, many of which realize the full logical Clifford group in this way. More generally, the induced logical group can be large even when it is not full logical Clifford group: it has order at least $460\,800$ for the gross code and roughly $10^{26}$ for a clustered-cyclic code.

Related papers

• Finding diagonal logical gates in CSS codes and circuits [0.2320648715016106]
  Finding efficient schemes for non-Clifford logic or magic state preparation is one of the central challenges on the way to fault-tolerant quantum computation.<n>Here we propose and implement algorithms to find all (spacetime) logical gates of a given CSS code (circuit) composed from a prescribed set of ansatz gates.
  arXiv  Detail & Related papers  (2026-07-29T05:09:15Z)
• Transversal gates for quantum CSS codes [10.827497136745551]
  We focus on the problem of computing the set of diagonal gates fixing a CSS code.<n>We determine the logical actions of the gates as well as the groups of gates that induce non-trivial logical gates and logical identities.
  arXiv  Detail & Related papers  (2026-01-29T10:28:58Z)
• Transversal Clifford-Hierarchy Gates via Non-Abelian Surface Codes [0.0]
  We present a purely 2D realization of phase gates at any level of the Clifford hierarchy.<n>Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian group $G$ on a triangular spatial patch.
  arXiv  Detail & Related papers  (2025-12-15T19:00:00Z)
• Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic [1.1087735229999818]
  We extend the Bravyi-K"onig bound for $n-dimensional topological stabilizer codes to a broad class of $n$-dimensional hierarchy stabilizer codes.<n>We construct non-Clifford gates through automorphism symmetries represented by spatial products.<n>In 3D, we construct a logical $sqrttextT$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy.
  arXiv  Detail & Related papers  (2025-11-04T19:00:00Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes [51.205673783866146]
  We propose and simulate a set of fault-tolerant and constant-depth logical gates on 2D toric codes.<n>This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
  arXiv  Detail & Related papers  (2024-11-27T12:17:56Z)
• 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)
• 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)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• 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)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

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.