Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic

• URL: http://arxiv.org/abs/2511.02900v1
• Date: Tue, 04 Nov 2025 19:00:00 GMT
• Title: Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic
• Authors: Ryohei Kobayashi, Guanyu Zhu, Po-Shen Hsin,
• Abstract summary: 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.
• Score: 1.1087735229999818
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Due to the potential single-shot code-switching properties of these codes, one could achieve the 4th level of Clifford hierarchy with an $O(d^3)$ space-time overhead, avoiding the tradeoff observed in 2D. We propose a conjecture extending the Bravyi-K\"onig bound to Clifford hierarchy stabilizer codes, with our explicit constructions providing an upper bound of spatial dimension $(N-1)$ for achieving the logical gates in the $N^\text{th}$-level of Clifford hierarchy.

Related papers

• Qudit stabiliser codes for $\mathbb{Z}_N$ lattice gauge theories with matter [42.418429168532406]
  We show that a $mathbbZ_N$ gauge theory with prime dimension $N$ coupled to dynamical matter can be expressed as a qudit stabilizer code.<n>Using the stabilizer formalism we show how to formulate an exact mapping of the encoded $mathbbZ_N$ gauge theory onto two different bosonic models.
  arXiv  Detail & Related papers  (2026-02-24T08:07:05Z)
• Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes [1.1087735229999818]
  We show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants.<n>This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries.
  arXiv  Detail & Related papers  (2026-01-11T01:20:36Z)
• 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)
• Universal Fault Tolerance with Non-Transversal Clifford Gates [0.4870012761464388]
  We extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit.<n>This framework allows implementation of $T$ gates alongside fault-tolerant realization of selected non-transversal Clifford gates using flags.<n>We also apply our construction to magic-state preparation, general state preparation using Clifford circuits, and data-syndrome codes.
  arXiv  Detail & Related papers  (2025-10-09T16:21:40Z)
• 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)
• A Classification of Transversal Clifford Gates for Qubit Stabilizer Codes [2.784326023586333]
  We show that for any stabilizer code, its group of diagonal Clifford gates on $ell$ code blocks must be one of six distinct families of matrix groups.<n>We further develop the theory of classifying stabilizer codes by via matrix algebras of endomorphisms first introduced by Rains.
  arXiv  Detail & Related papers  (2025-07-14T17:43:30Z)
• 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)
• A topological theory for qLDPC: non-Clifford gates and magic state fountain on homological product codes with constant rate and beyond the $N^{1/3}$ distance barrier [1.472161528588343]
  topological theory for fault-tolerant quantum computation in quantum low-density parity-check (qLDPC) codes.<n>We show that there exist hidden simplicial or CW complex structures encoding the topological data for all qLDPC and CSS codes.
  arXiv  Detail & Related papers  (2025-01-31T18:25:24Z)
• 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)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes.<n>Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• Genons, Double Covers and Fault-tolerant Clifford Gates [2.5866180357107242]
  We show a construction that produces symplectic double code with naturally occurring fault-tolerant logical Clifford gates. We demonstrate this experimentally on Quantinuum's H1-1 trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2024-06-14T11:57:51Z)
• Climbing the Diagonal Clifford Hierarchy [0.6445605125467572]
  We introduce a method of synthesizing codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy. The method combines three basic operations: concatenation, removal of $Z$-stabilizers, and addition of $X$-stabilizers. For the coherent noise model, we describe how to switch between computation and storage of intermediate results in a decoherence-free subspace.
  arXiv  Detail & Related papers  (2021-10-22T17:08:18Z)
• 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.