Transversal Clifford-Hierarchy Gates via Non-Abelian Surface Codes

• URL: http://arxiv.org/abs/2512.13777v1
• Date: Mon, 15 Dec 2025 19:00:00 GMT
• Title: Transversal Clifford-Hierarchy Gates via Non-Abelian Surface Codes
• Authors: Alison Warman, Sakura Schafer-Nameki,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a purely 2D transversal realization of phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian group $G$ on a triangular spatial patch. The logical gate is implemented transversally by stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle. The Bravyi--König theorem limits the unitary gates implementable by constant-depth quantum circuits on Pauli stabilizer codes in $D$ dimensions to the $D$-th level of the Clifford hierarchy. We bypass this, by constructing transversal unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, however at the cost of using the quantum double of a non-Abelian group $G$. Specifically, for $G = D_{4N}$, the dihedral group of order $8N$, we realize the phase gate $T^{1/N} = \mathrm{diag}(1, e^{iπ/(4N)})$ in the logical $\overline{Z}$ basis. For $8N = 2^n$, this gate lies at the $n$-th level of the Clifford hierarchy and, importantly, has a qubit-only realization: we show that it can be constructed in terms of Clifford-hierarchy stabilizers for a code with $n$ physical qubits on each edge of the lattice. We also discuss code-switching to the $\mathbb{Z}_2 \times \mathbb{Z}_2$ and $\mathbb{Z}_2$ toric codes, which can be utilized for the quantum error correction in this setup.

Related papers

• Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates [0.0]
  We present a full logical group using only and foldbits for a family of Clifford gates in which $k$ grows near $linearly in $n$ up to a $1/sqrtt$ factor.<n>This is the first group using only and foldbits for a family of Clifford gates in which $k$ grows near $linearly in $n$ up to a $1/sqrtt$ factor.
  arXiv  Detail & Related papers  (2026-02-10T13:49: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)
• Clifford quantum cellular automata from topological quantum field theories and invertible subalgebras [10.600087006666332]
  We present a framework for constructing quantum cellular automata (QCA) from topological quantum field theories (TQFT) and invertible subalgebras (ISA)<n>This approach explicitly realizes all $mathbbZ$ and $mathbbZ_p$ Clifford QCAs in all admissible dimensions.
  arXiv  Detail & Related papers  (2025-09-08T18:00:13Z)
• Transversal Gates in Nonadditive Quantum Codes [3.980076328494117]
  We search codes with specified groups by parametrizing logical subspaces on the Stiefel manifold.<n>Applying this method, we uncover a new $((6,2,3))$ code admitting a $Zbigl(tfrac2pi5bigr)$ gate.<n>Several new $(7,2,3))$ codes realize the binary icosahedral group $2I$.
  arXiv  Detail & Related papers  (2025-04-29T15:18:33Z)
• Quantum Codes with Addressable and Transversal Non-Clifford Gates [8.194994143531677]
  We study codes that support gates which induce $textitaddressable$ logical gates.<n>We develop a formalism for constructing quantum codes with $textitaddressable and $ell neq 2$ gates.
  arXiv  Detail & Related papers  (2025-02-03T22:24:34Z)
• Geometric bound on structure factor [44.99833362998488]
  We show that a quadratic form of quantum geometric tensor in $k$-space sets a bound on the $q4$ term in the static structure factor $S(q)$ at small $vecq$.<n> Bands that saturate this bound satisfy a condition similar to Laplace's equation, leading us to refer to them as $textitharmonic bands$.
  arXiv  Detail & Related papers  (2024-12-03T18:30:36Z)
• 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)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• 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.