Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2511.02900 · Physical Review Letters

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

Ryohei Kobayashi, Guanyu Zhu, Po-Shen Hsin

quant-phcond-mat.str-elhep-thSubmitted Nov 4, 2025• Announced Nov 6, 2025• 27 citations• Revised May 19, 2026 (v3)
v1 · Nov 4, 2025v2 · Dec 14, 2025v3 · May 19, 2026
arXivHTMLPDF

Abstract

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König 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. Our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

Journal reference
Phys. Rev. Lett. 136, 250802 (2026)
DOI
10.1103/j2q4-bnc6
Comments
5+17 pages, 11 figures. Close to the published version

Related papers

Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes

Alison Warman, Sakura Schafer-Nameki

We present an entirely 2D constant-depth realization of topologically protected 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 by a constant-depth circuit constructed from stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle and boundary counter-terms. 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 limitation, by constructing constant-depth unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, 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. In this context, we propose a non-abelian stabilizer group formalism, which we work out for dihedral groups. For $8N = 2^n$, the logical 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 double surface-code $D(\mathbb{Z}_2\times\mathbb{Z}_2)$, to complete a universal gate-set in this setup.

quant-pharXiv:2512.13777•PRX Quantum•Dec 17, 2025•22 citations

Automorphism in Gauge Theories: Higher Symmetries and Transversal Non-Clifford Logical Gates

Po-Shen Hsin, Ryohei Kobayashi

Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge theories induced by automorphisms of the gauge group, when the gauge theories have nontrivial topological actions in different spacetime dimensions. We discover the automorphism symmetry can be extended, become a higher group symmetry, and/or become a non-invertible symmetry. We illustrate the discussion with various models in field theory and on the lattice. In particular, we use automorphism symmetry to construct new transversal non-Clifford logical gates in topological quantum codes. In particular, we show that 2+1d $\mathbb{Z}_N$ qudit Clifford stabilizer models can implement non-Clifford transversal logical gate in the 4th level $\mathbb{Z}_N$ qudit Clifford hierarchy for $N\geq 3$, extending the generalized Bravyi-König bound proposed in the companion paper [arXiv:2511.02900] for qubits.

cond-mat.str-elCross-listedarXiv:2511.15783•SciPost Physics•Nov 21, 2025•12 citations

Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles

Christopher Fechisin, Kieran Cooney, Mathi Raja +4 more

Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pauli stabilizer phases appear as intermediate codes. We introduce the $X\mathcal C^{(k)}_d$ stabilizer formalism, which generalizes the Pauli stabilizer formalism by combining Pauli-$X$ operators with diagonal operators drawn from a fixed level $k$ of the Clifford hierarchy on prime-dimensional qudits. This yields a natural class of beyond-Pauli stabilizer models, including many twisted quantum double phases. We classify a large class of these $X\mathcal C^{(k)}_d$ stabilizer states, showing that they are uniform superpositions over affine-linear subspaces with diagonal phases. In particular, when the stabilizers of a state require operators from level $k$ of the Clifford hierarchy, we show that the diagonal gates required to produce the phases in the wavefunction sit one level higher. We further show that every 2D twisted quantum double ${\cal D}^ω(\mathbb{Z}_p^n)$ with $ω$ a product of type-III cocycles and $p$ an odd prime admits a realization using only Clifford ($k=2$) stabilizers, and we conjecture that phases where $ω$ contains a type-I or type-II cocycle require level-$p$ Clifford-hierarchy stabilizers for $p$-dimensional qudits. Finally, we demonstrate that a pair of qudit toric codes may be deterministically prepared in a logical magic state by measuring $X\mathcal C^{(k)}_d$ stabilizers. Together, these results provide a concrete stabilizer framework for topological codes beyond Pauli stabilizer models and their logical gates.

quant-pharXiv:2610.00464•Oct 2, 2026•3 citations

Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes

Guanyu Zhu, Ryohei Kobayashi, Po-Shen Hsin

A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical non-Clifford gates, one needs to resort to 3D product-code constructions. In this work, we extend Kitaev's framework of non-Abelian topological codes on manifolds to non-Abelian qLDPC codes (realized as Clifford-stabilizer codes) and the corresponding combinatorial topological quantum field theories (TQFT) defined on Poincaré CW complexes and certain types of general chain complexes. We also construct the spacetime path integrals as topological invariants on these complexes. Remarkably, we show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants. This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries, which correspond to addressable transversal Clifford gates and become higher-form symmetries when lifted to higher-dimensional CW complexes or manifolds. Building on this structure, we apply the gauging protocol to the magic state fountain scheme for parallel preparation of $O(\sqrt{n})$ disjoint CZ magic states with code distance of $O(\sqrt{n})$, using a total number of $n$ qubits.

quant-pharXiv:2601.06736•Jan 13, 2026•24 citations

Fault-tolerant logical gates in quantum error-correcting codes

Fernando Pastawski, Beni Yoshida

Recently, S. Bravyi and R. K\"onig [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically local circuit and are thus fault tolerant by construction. In particular, they show that, for local stabilizer codes in $D$ spatial dimensions, locality-preserving gates are restricted to a set of unitary gates known as the $D\mathrm{th}$ level of the Clifford hierarchy. In this paper, we explore this idea further by providing several extensions and applications of their characterization to qubit stabilizer and subsystem codes. First, we present a no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. This result implies that non-Clifford gates do not admit such implementations in Haah's cubic code and Michnicki's welded code. Second, we prove that the code distance of a $D$-dimensional local stabilizer code with a nontrivial locality-preserving $m\mathrm{th}$-level Clifford logical gate is upper bounded by $O({L}^{D+1\ensuremath{-}m})$. For codes with non-Clifford gates ($m>2$), this improves the previous best bound by S. Bravyi and B. Terhal [New. J. Phys. 11, 043029 (2009)]. Topological color codes, introduced by H. Bombin and M. A. Martin-Delgado [Phys. Rev. Lett. 97, 180501 (2006); Phys. Rev. Lett. 98, 160502 (2007); Phys. Rev. B 75, 075103 (2007)], saturate the bound for $m=D$. Third, we prove that the qubit erasure threshold for codes with a nontrivial transversal $m\mathrm{th}$-level Clifford logical gate is upper bounded by $1/m$. This implies that no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes and is not restricted to geometrically local codes. Fourth, we extend the result of Bravyi and K\"onig to subsystem codes. Unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of an error threshold in a subsystem code, and a conclusion analogous to that of Bravyi and K\"onig is recovered.

arXiv:1408.1720•Physical Review A•Jan 8, 2015•110 citations

Improved Transversal Non-Clifford Gates from Cup Products

Louis Golowich, Itzhak Tamo, Guanyu Zhu

It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stabilizers that support transversal (i.e. low-depth) implementations of the non-Clifford $C^{r-1}Z$ gate, for every constant $r\geq 3$. In particular, we obtain length-$n$ quantum LDPC codes (with constant-weight stabilizers) of polynomial distance $d\geq n^{(1-ε)/r}$ supporting transversal $C^{r-1}Z$ gates on a close-to-linear number $k\geq n^{1-ε}$ of disjoint tuples of logical qubits, for arbitrarily small $ε>0$. Our construction is the first with constant-weight stabilizers that obtains $dk\gg n$, and as a consequence achieves arbitrarily small magic state overhead exponent $γ=\log(n/k)/\log(d)>0$. Comparable prior constructions instead required at least polylogarithmic stabilizer weight. We also show how to obtain linearly many $k=Ω(n)$ logical $C^{r-1}Z$ gates, though with stabilizer weight and physical circuit depth $n^ε$. We show that our transversal gates also support addressing (i.e. targeting) of specific logical qubits. To obtain our codes, we develop a general transformation based on cup products that maps classical codes satisfying a multiplication property to quantum codes with transversal $C^{r-1}Z$. We apply this transformation to a new family of classical Tanner codes that we construct from punctured tensor products of algebraic codes.

quant-pharXiv:2609.27801•Aug 19, 2026•2 citations
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for nnn-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of nnn-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the (n+1)(n+1)(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 Z23\mathbb{Z}_2^3Z23​ gauge theory (equivalent to D4\mathbb{D}_4D4​ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in O(d)O(d)O(d) rounds via code switching. In 3D, we construct a transversal logical T\sqrt{\text{T}}T​ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted Z24\mathbb{Z}_2^4Z24​ gauge theory. Our constructions surpass the Bravyi-König bound by achieving the logical gates in the (n+1)(n+1)(n+1)-th level of Clifford hierarchy in nnn spatial dimension.
We present an entirely 2D constant-depth realization of topologically protected 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)D(G)D(G) of a non-Abelian group GGG on a triangular spatial patch. The logical gate is implemented by a constant-depth circuit constructed from stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle and boundary counter-terms. The Bravyi-König theorem limits the unitary gates implementable by constant-depth quantum circuits on Pauli stabilizer codes in DDD dimensions to the DDD-th level of the Clifford hierarchy. We bypass this limitation, by constructing constant-depth unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, at the cost of using the quantum double of a non-Abelian group GGG. Specifically, for G=D4NG = D_{4N}G=D4N​, the dihedral group of order 8N8N8N, we realize the phase gate T1/N=diag(1,eiπ/(4N))T^{1/N} = \mathrm{diag}(1, e^{iπ/(4N)})T1/N=diag(1,eiπ/(4N)) in the logical Z‾\overline{Z}Z basis. In this context, we propose a non-abelian stabilizer group formalism, which we work out for dihedral groups. For 8N=2n8N = 2^n8N=2n, the logical gate lies at the nnn-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 nnn physical qubits on each edge of the lattice. We also discuss code-switching to the double surface-code D(Z2×Z2)D(\mathbb{Z}_2\times\mathbb{Z}_2)D(Z2​×Z2​), to complete a universal gate-set in this setup.
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge theories induced by automorphisms of the gauge group, when the gauge theories have nontrivial topological actions in different spacetime dimensions. We discover the automorphism symmetry can be extended, become a higher group symmetry, and/or become a non-invertible symmetry. We illustrate the discussion with various models in field theory and on the lattice. In particular, we use automorphism symmetry to construct new transversal non-Clifford logical gates in topological quantum codes. In particular, we show that 2+1d ZN\mathbb{Z}_NZN​ qudit Clifford stabilizer models can implement non-Clifford transversal logical gate in the 4th level ZN\mathbb{Z}_NZN​ qudit Clifford hierarchy for N≥3N\geq 3N≥3, extending the generalized Bravyi-König bound proposed in the companion paper [arXiv:2511.02900] for qubits.
Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pauli stabilizer phases appear as intermediate codes. We introduce the XCd(k)X\mathcal C^{(k)}_dXCd(k)​ stabilizer formalism, which generalizes the Pauli stabilizer formalism by combining Pauli-XXX operators with diagonal operators drawn from a fixed level kkk of the Clifford hierarchy on prime-dimensional qudits. This yields a natural class of beyond-Pauli stabilizer models, including many twisted quantum double phases. We classify a large class of these XCd(k)X\mathcal C^{(k)}_dXCd(k)​ stabilizer states, showing that they are uniform superpositions over affine-linear subspaces with diagonal phases. In particular, when the stabilizers of a state require operators from level kkk of the Clifford hierarchy, we show that the diagonal gates required to produce the phases in the wavefunction sit one level higher. We further show that every 2D twisted quantum double Dω(Zpn){\cal D}^ω(\mathbb{Z}_p^n)Dω(Zpn​) with ωωω a product of type-III cocycles and ppp an odd prime admits a realization using only Clifford (k=2k=2k=2) stabilizers, and we conjecture that phases where ωωω contains a type-I or type-II cocycle require level-ppp Clifford-hierarchy stabilizers for ppp-dimensional qudits. Finally, we demonstrate that a pair of qudit toric codes may be deterministically prepared in a logical magic state by measuring XCd(k)X\mathcal C^{(k)}_dXCd(k)​ stabilizers. Together, these results provide a concrete stabilizer framework for topological codes beyond Pauli stabilizer models and their logical gates.
A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical non-Clifford gates, one needs to resort to 3D product-code constructions. In this work, we extend Kitaev's framework of non-Abelian topological codes on manifolds to non-Abelian qLDPC codes (realized as Clifford-stabilizer codes) and the corresponding combinatorial topological quantum field theories (TQFT) defined on Poincaré CW complexes and certain types of general chain complexes. We also construct the spacetime path integrals as topological invariants on these complexes. Remarkably, we show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants. This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries, which correspond to addressable transversal Clifford gates and become higher-form symmetries when lifted to higher-dimensional CW complexes or manifolds. Building on this structure, we apply the gauging protocol to the magic state fountain scheme for parallel preparation of O(n)O(\sqrt{n})O(n​) disjoint CZ magic states with code distance of O(n)O(\sqrt{n})O(n​), using a total number of nnn qubits.
Recently, S. Bravyi and R. K\"onig [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically local circuit and are thus fault tolerant by construction. In particular, they show that, for local stabilizer codes in DDD spatial dimensions, locality-preserving gates are restricted to a set of unitary gates known as the DthD\mathrm{th}Dth level of the Clifford hierarchy. In this paper, we explore this idea further by providing several extensions and applications of their characterization to qubit stabilizer and subsystem codes. First, we present a no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. This result implies that non-Clifford gates do not admit such implementations in Haah's cubic code and Michnicki's welded code. Second, we prove that the code distance of a DDD-dimensional local stabilizer code with a nontrivial locality-preserving mthm\mathrm{th}mth-level Clifford logical gate is upper bounded by $O({L}^{D+1\ensuremath{-}m})$. For codes with non-Clifford gates (m>2m>2m>2), this improves the previous best bound by S. Bravyi and B. Terhal [New. J. Phys. 11, 043029 (2009)]. Topological color codes, introduced by H. Bombin and M. A. Martin-Delgado [Phys. Rev. Lett. 97, 180501 (2006); Phys. Rev. Lett. 98, 160502 (2007); Phys. Rev. B 75, 075103 (2007)], saturate the bound for m=Dm=Dm=D. Third, we prove that the qubit erasure threshold for codes with a nontrivial transversal mthm\mathrm{th}mth-level Clifford logical gate is upper bounded by 1/m1/m1/m. This implies that no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes and is not restricted to geometrically local codes. Fourth, we extend the result of Bravyi and K\"onig to subsystem codes. Unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of an error threshold in a subsystem code, and a conclusion analogous to that of Bravyi and K\"onig is recovered.
It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stabilizers that support transversal (i.e. low-depth) implementations of the non-Clifford Cr−1ZC^{r-1}ZCr−1Z gate, for every constant r≥3r\geq 3r≥3. In particular, we obtain length-nnn quantum LDPC codes (with constant-weight stabilizers) of polynomial distance d≥n(1−ε)/rd\geq n^{(1-ε)/r}d≥n(1−ε)/r supporting transversal Cr−1ZC^{r-1}ZCr−1Z gates on a close-to-linear number k≥n1−εk\geq n^{1-ε}k≥n1−ε of disjoint tuples of logical qubits, for arbitrarily small ε>0ε>0ε>0. Our construction is the first with constant-weight stabilizers that obtains dk≫ndk\gg ndk≫n, and as a consequence achieves arbitrarily small magic state overhead exponent γ=log⁡(n/k)/log⁡(d)>0γ=\log(n/k)/\log(d)>0γ=log(n/k)/log(d)>0. Comparable prior constructions instead required at least polylogarithmic stabilizer weight. We also show how to obtain linearly many k=Ω(n)k=Ω(n)k=Ω(n) logical Cr−1ZC^{r-1}ZCr−1Z gates, though with stabilizer weight and physical circuit depth nεn^εnε. We show that our transversal gates also support addressing (i.e. targeting) of specific logical qubits. To obtain our codes, we develop a general transformation based on cup products that maps classical codes satisfying a multiplication property to quantum codes with transversal Cr−1ZC^{r-1}ZCr−1Z. We apply this transformation to a new family of classical Tanner codes that we construct from punctured tensor products of algebraic codes.