WorksPhysics and Astronomy
The Clifford Hierarchy from Clifford Stabilizers in 2D
Abstract
The Bravyi-König theorem limits the constant-depth logical gates of 2D topological Pauli stabilizer codes to be in the Clifford group. Known qubit codes with Clifford stabilizers exceed it by only one level of the Clifford hierarchy, and this was conjectured to hold generally. We show that this bound can be completely bypassed, and that topological codes with Clifford stabilizers in 2D can realize transversal logical gates at any level of the Clifford hierarchy. We present two explicit constructions of codes based on copies of the quantum doubles of and , with logical qubits and a logical gate, which is at level of the Clifford hierarchy. The physical circuits realizing the gates consist only of physical or gates. The main new ingredient comes from the logical encoding, which depends crucially on non-Abelian group multiplication.
Introduction
Introduction. Transversal logical gates are the simplest fault-tolerant gates, since they do not spread errors within a code block. However, the Bravyi-König (BK) theorem [1] limits them, and more generally all constant-depth logical gates, in topological 2D Pauli stabilizer codes, to be in the Clifford group. In particular, non-Clifford gates that are needed for universal quantum computation require further resources, such as magic states. It was recently shown that non-Abelian codes, whose stabilizers are not simply Pauli operators, can evade this restriction and host non-Clifford constant-depth gates. For example, the twisted gauge theory , or equivalently , [2, 3, 4], has Clifford stabilizers and a constant-depth logical gate in 2D [4, 5, 6], and can be implemented [7] and decoded with a high threshold [4, 8]. On the other hand, the quantum doubles host constant-depth logical gates [6] at the cost of more complex stabilizers that include non-Clifford gates [9]. However, thus far in all known topological qubit codes in 2D, the constant-depth logical gates lie at most one level above the stabilizers, and this was recently conjectured to be a general bound in [10].
Main Result: Clifford Hierarchy Gates from Clifford Stabilizer Codes. In this Letter we show that Clifford stabilizers in 2D suffice for transversal logical gates in every level of the Clifford hierarchy. We argue this by providing two explicit constructions, which use the quantum doubles of the non-Abelian groups
Here, is the group of symmetries of a square. The parameters and count the logical qubits of the two factors with , when considering the code on a square patch with four gapped boundaries (Fig. 1). Both constructions act on logical qubits realizing the logical
which lies in level of the Clifford hierarchy [11]. Multi-controlled logical gates are central to quantum algorithms and to universal gate sets [12, 13, 14], but in a Pauli stabilizer code they require costly magic states. With our
Figure 1. The quantum double on a square spatial patch, with time going up. The four vertical faces are the gapped boundaries labeled by the subgroups , , , . A logical state is a configuration of four magnetic anyons with fluxes , each ending on a boundary and satisfying . The logical gates act on a spatial slice. In Construction I (light blue), is the line of an Abelian charge anyon between the left and right boundaries, and physically a string of Pauli gates. In Construction II (dark blue), multiplies the state by where is a group 2-cocycle. Both give the transversal logical , implemented by physical and gates and Clifford stabilizers.
constructions once the quantum double codes for (1) are prepared, (2) is a single layer of one-qubit or two-qubit gates, with stabilizers and physical gates that are all at most Clifford.
How is this possible? In a Pauli stabilizer code a physical Pauli operator that preserves the code space acts on it as a logical Pauli [15]. However, for a code with Clifford stabilizers this need not hold. The logical states are determined from magnetic anyons with fluxes , stretching between the left and right, or top and bottom, boundaries. However, when they cross, non-Abelian group multiplication can force the exponent of a certain group element to be fixed in terms of the others.
Consider a finite group with a factor, and denote by its magnetic flux. For a suitable choice of and boundaries, we show that a vertical flux that crosses the horizontal fluxes is forced to carry also the flux , as shown in Figure 2: the total flux is below the crossings and above them, where and are group elements fixed by the boundaries and junctions. The exponent of is along the whole vertical path. Then, its corresponding electric (charge) anyon , which on the lattice is a tensor product of Pauli gates and acts on a state with by a phase, will produce when acting on the state in Figure 2, resulting in a logical controlled-gate.
Figure 2. Action of the charge anyon (blue) on the logical state: the anyon , which on the lattice is a product of , acts on the configuration of anyons that realize the logical state, by a sign , which is the gate. In the anyon picture, this arises from crossing the anyon.
In our first construction, the logical gate is realized by a tensor product of Pauli operators along a path between two opposite boundaries, while in the second, is obtained by stacking a group 2-cocycle as in [6], which is implemented as a layer of physical gates on the whole patch. Our setup and the logical gates are illustrated in Fig. 1.
We remark that the non-Clifford nature of the gates does not come from the physical operators implementing them but from the non-Abelian nature of the code, as we explained above. The code stabilizers are Clifford and we expect the constant-depth adaptive protocol of [7, 16] to be a natural starting point for its preparation. Then, once our code has been implemented, the logical gate is a depth-one circuit of Pauli or gates, which can be applied any number of times during a computation, so we expect our protocols to be favorable for computations that require many non-Clifford gates. We will prove in the End Matter that the Clifford level of our gates cannot decrease by a change of logical basis.
Statement of the Main Theorem. Let the stabilizers of a -dimensional code lie in , where is the Pauli group and if for all Pauli operators [17]. For Pauli stabilizer codes, we have and the BK theorem [1] places the constant-depth logical gates in . All known qubit codes with stabilizers beyond the Pauli group, listed in Table I, have constant-depth logical gates in
which was conjectured to be a general bound in [10].
Table 1. Clifford Level of the stabilizers and of the constant-depth logical gate of topological qubit codes in dimensions, with a power of two.
We show in this Letter that this conjectured generalized Bravyi-König bound can be completely evaded: transversal logical gates at arbitrary levels of the hierarchy can be obtained, even in the simplest non-Pauli topological setting with and . Our main result is the following:
Theorem 1. Let . The following two codes, realized on an square lattice patch, are qubit codes with Clifford stabilizers, logical qubits and distance , with a transversal logical gate.
Construction I. The quantum double of in (1) with and the boundary subgroups (24), with physical qubits on each lattice edge. The gate is realized by a tensor product of single-qubit Pauli gates.
Construction II. The quantum double of in (1) with , , and the boundary subgroups (25), with physical qubits per lattice edge. The gate is realized as a single layer of gates, transversal between the two code blocks, and .
Setup. We place the Kitaev quantum double [18] on a square, and impose on all its four sides gapped boundary conditions, labeled by subgroups (and trivial 2-cocycles) [19]. The logical states are ground states of the quantum double Hamiltonian [18, 19]. We will characterize them by four magnetic anyons, each ending on a boundary on which its flux condenses, which meet at a common plaquette. We denote them by with , , , which satisfy
to ensure that the common plaquette has trivial flux (Fig. 1). By choosing a suitable group as in (1) and boundary conditions, we can encode any number of logical qubits , as we will explain below.
Code. We begin by discussing the main building block which is the quantum double of the group
Here, we present the as the symmetries of a square with rotation and reflection
while generates the factor and we define
All four elements , , , have order two, they satisfy , , and , , are central. We place on a square with the boundary subgroups
so that the bottom and top boundaries differ only by and .
This setup encodes two logical qubits, whose basis states are with . The horizontal anyon between the left and right boundaries carries the flux , and the vertical anyon between the bottom and top boundaries carries with further factors that are fixed by the boundary conditions when the two anyons cross. For general , the logical state is the following anyon configuration:

Figure 1 (PDF p. 3).
This forces the exponent of in to be the product of the two logical bits. To see this, starting with the general bits , , , for , , , respectively, we write
It then follows by straightforward computation that
so the plaquette stabilizer condition (4) holds if and only if . The four logical states are therefore:
| 0 | 0 | id | id | id | +1 |
| 1 | 0 | id | +1 | ||
| 0 | 1 | id | id | +1 | |
| 1 | 1 | −1 |
Table 1 (PDF p. 3).
The last column is the value of the operator on a horizontal path : at the logical level, for .
We now explain how quantum doubles of products of these groups are used for our two constructions of and subsequently generalize to any .
Construction I: from
To obtain the first gate beyond the putative bound (3) (which is the logical gate) from physical Pauli gates, we take
with the generators of the three copies of , the generator of , and
The subgroups labeling the four boundaries are
and the code has four logical qubits . Note that the subgroups associated to boundaries that share a corner have trivial intersection, and thus there are no short strings. A non-trivial flux now crosses , , , and each crossing constrains one more generator as in (9), so the boundary holonomies are
The string of Pauli gates on the qubits for the factor is a phase with the exponent of in ,
which lies in and not in . So single-qubit Pauli gates, on a code with Clifford stabilizers and 10 qubits per edge (Table II), already exceed the putative bound (3).
Construction II: from
We take two copies with . We write the elements as pairs and the subgroups as products. Since all four boundary subgroups are products, consists of two decoupled code blocks on the same lattice, with the boundary subgroups (8) and with the same boundaries rotated by 90 degrees. The boundary subgroups for are
| Subgroup | |
Table 2.
and the four logical qubits are labeled by for and for .
Let and be the exponents of in and in , which are homomorphisms . In particular, since , while and vanish on . Their cup product is a group 2-cocycle
whose class is nontrivial (End Matter). On the four boundaries
since vanishes on and , whose factor is , and vanishes on and so the gate , constructed as in [6], does not require any boundary terms. With , , , it evaluates to
This is the gate for the logical bits of and of . is if and only if the flux lines of and of are both present (Figure 3) and only requires 8 physical qubits per edge (Table II).

Figure 3. Construction II for : the flux lines with (if ) and (if ) cross once. Stacking the SPT phase of in (17) on the spatial slice counts this crossing, so .
Constructions I and II for every . The codes for larger are obtained by extending one factor at a time, starting from the surface code with one logical qubit:
In the -th step the generator of the factor becomes the reflection of a new copy of , and a new with generator is added, together with , which becomes after the next step. After steps this gives in (1). For Construction II, the second group is the same with in place of . We define the following subgroups
and likewise for [20]. The boundary subgroups generalize (8) for Construction I,
and (18) for Construction II,
| Gate | I: (qubits per edge) | II: (qubits per edge) | |
| 3 | (7) | (5) | |
| 4 | (10) | (8) | |
| () | () |
Table 2 (PDF p. 4). Constructions I and II of the logical gate on logical qubits, with the number of physical qubits on each edge of the lattice.
So each step adds to the left and right boundaries, to the bottom boundary and to the top boundary. The factor encodes logical qubits, specified by the exponent of and the exponents of . Similarly to (15), the boundary holonomies are
with and . The exponents of and the exponent of are the logical bits, while all other exponents are fixed by the condition .
In Construction I, as in (16), the anyon acting on the logical state with has the physical and logical gate decompositions:
In Construction II, with and the exponents of in and in , the cocycle is again (17), it still satisfies (18), and the gate is
Further details and proofs are given in the End Matter, and the groups, the 2-cocycles and the logical gates can also be checked for given with the GAP functions in AlgebraD [21].
Lattice Model and Hamiltonian
We use Kitaev’s quantum double model [18] on an square lattice, with boundaries [19, 22]. Every edge carries with basis , , and the Hamiltonian is
where is in the bulk, or a boundary subgroup on the boundary, and at the four corners, where adjacent subgroups intersect trivially. The vertex operator applies to the edges that exit and to those that enter , whose circuits we show in Figure 5(a). The projector imposes (4) on the plaquette , and imposes on an edge of a boundary with subgroup .

Figure 5. Circuits of the stabilizers and logical gates: A dot connected to is a CNOT gate, with the dot on the control qubit, and two connected dots are a CZ gate. (a) The gates and of [6] for the generators and of a copy of on its three qubits . (b) The plaquette stabilizer in (44) of a copy of on the qubits of the left and top edges of , which acts in the same way on the bottom and right edges . The other plaquette stabilizers , and are products of single-qubit Pauli gates on the four edges of . (c) The gate of Construction I, a Pauli gate on the qubit of each horizontal edge of a row. (d) The plaquette gate for of Construction II in (33): two CZ gates between the qubits and of the bottom and right edges and of the left and top edges of . Both gate circuits have depth one.
The logical states are created by four magnetic ribbon operators [18, 19, 23] [24]
that meet at a plaquette (Figure 4).

Figure 4. The codes on a square lattice (). label the gapped boundaries given in (22), for Construction I. A logical state is created by four magnetic anyons with fluxes and to ensure trivial flux at their common plaquette (shaded). The gate of Construction I is a string of single-qubit Pauli gates on the edges of a line between the left and right boundaries (blue). It crosses the flux and detects its exponent of , and its logical action is the same when crossing .
Qubit Realization. Both codes can be realized in terms of physical qubits, where for , we map a basis state for each lattice edge onto three qubits as , where [6]. This gives physical qubits per edge for and for . The details of the stabilizer and gate qubit circuits can be found in the End Matter. On the qubits of the -th copy of , the element with is up to a power of . So the exponents of and of are the bits and , while the exponent of on each site is stored in its qubit. The lattice realizations of the charge anyons that detect these exponents are, on a path
Denoting by a horizontal path between the left and right boundaries and by a vertical path between the bottom and top boundaries, the strings , and commute with the code stabilizers, and from (24) their action on the logical state is
with in the second line and in the third line. The first two operators are the logical operators of the logical qubits, while the last two contain the whole tower , where acts on the first logical qubits, each as a string of physical Pauli gates, and the last one is in (25).
The logical operators, which flip the logical bits, are instead constructed from the magnetic ribbon operators, similarly to (28). They are not Pauli strings, since by (24) flipping a logical bit also changes the exponents in and by products of the other logical bits.
Logical Gates. The gate of Construction I is (Figure 5(c))
on the qubits of on a horizontal path. It commutes with all stabilizers, since applies to the qubits of of the two edges on the row at or leaves them unchanged, and the exponent of vanishes on the subgroup of the left and right boundaries.
The gate of Construction II is , where evaluates on each triangulated plaquette as [6]
The phase it produces is the same on all configurations of a logical state (End Matter), which gives (26).
By (17), only involves the qubits and , so on the lattice is realized as
where is the gate of the qubit of the bottom edge and the qubit of the right edge of , and likewise for the left and top edges. As the transversal gate between two surface codes, it maps every vertex stabilizer to itself times plaquette checks of the other code block (End Matter), so it preserves the code space. We present its circuit decomposition in Figure 5(d). Finally, and are both , which is at level of the Clifford hierarchy, which completes the proof of our Theorem.
Fault Tolerance and Outlook. We have shown that Clifford stabilizers in 2D suffice for transversal logical gates in every level of the Clifford hierarchy, where the level is set by the non-Abelian group and the boundary conditions. Both our gates have depth one: is a product of single-qubit gates, while a single fault in affects at most two qubits of one plaquette, one in each code block. In the bulk, our codes are stacks of surface codes and of , which, despite being non-Abelian, can be decoded with a high threshold by the just-in-time decoder [4, 8], and in this setting also the protocol of [25] simplifies substantially. Natural next steps are to extend these decoders to the boundaries and to the code switching, and a threshold analysis of the full protocol.
END MATTER
We now provide some more mathematical and implementation details for our constructions.
The 2-Cocycle. Here, we prove that (17) is a 2-cocycle in a non-trivial cohomology class and provide further details on Construction II of Theorem 1. We denote by and the projections of onto the direct factors of and of , so modulo 2
By (17) and (34), the two sides of the cocycle condition
are to the powers
which are equal. So (35) holds for all , and since , is normalized, . For commuting , a coboundary is symmetric, so the ratio depends only on the class of , and
So the class of in is nontrivial. By (23)–[25], , so is identically 1 on the boundaries, i.e. (18) for every .
The Logical Gate. We evaluate the 2-cocycle stacking circuit of [6], for a 2-cocycle whose restriction to each boundary subgroup is identically one, so all boundary functions can be taken to be 1. We evaluate it on the representative of (28), as in Fig. 4. Since is normalized,
so only contributes. By (24) for , and for with the two pairs of opposite boundaries exchanged, its four edges carry
with . Denoting by , and , we have
| 0 | 0 | |||
| 0 | 0 |
which inserted into (17) gives
resulting in
In (33) the qubit of a horizontal (vertical) edge enters only the gate of the plaquette above (to the right of) it, and the qubit only that of the plaquette below (to the left of) it, so is a depth-one layer of gates on disjoint pairs of qubits. If the qubit of the edge is paired with the qubit of the edge , then
while commutes with the gates on all other qubits. Since the product of operators around a plaquette is a stabilizer, preserves the stabilizer group. A similar computation can be performed for the boundaries. Since it preserves the logical space, the phase is independent of the physical state, thus
Code Switching. Similarly to [6], we can perform code-switching by condensing the anyon of each copy. For the codes of this Letter, this results in surface codes of which carry the logical qubits. The boundary subgroups meet trivially, so their images define surface codes, one for each of the generators , and . On the lattice, this map is realized by measuring all qubits in the basis and post-selecting the outcomes. In the other direction, we initialize the qubits in and project onto the eigenstates of the stabilizers of or .
Qubit Circuits. As noted in the main text we can implement the circuits on qubits. Each copy can be realized on three qubits per edge as , with , and each factor on one qubit. This gives qubits per edge for and for . We denote the three qubits of the -th copy of by . A subscript on an operator on the qubits of one copy, as in , means that it acts on the edge , and is its product over the four edges of the plaquette .
On the three qubits, and for are the Clifford gates of [6] in Fig. 5(a), and on the qubit of . Since , it suffices to take among the generators in the bulk, and among those in (21) on the boundaries.
The plaquette stabilizers are, instead, diagonal. For two commuting operators with eigenvalues , let @page 6/9 starts_mid=0 ends_mid=1 ... be if both are and otherwise, which for two single-qubit Pauli gates is the usual CZ gate. For each copy of , omitting the index , the plaquette stabilizers are
and for the factor the stabilizer is . The and plaquette stabilizers check the bits and of the flux, and checks the bit (Figure 5(b)), where the two CZ gates account for the non-Abelian products and .
On every edge of a boundary, the operator in (27) acts on a single edge and imposes Pauli checks that depend on its subgroup:
for all copies , with in the fourth line, and likewise for . Only the checks of couple different copies of : they tie the qubit of to the qubit of in the next copy, or to the qubit of .
In a local basis, obtained by acting with a Hadamard gate on the qubit of each copy, the stabilizers contain only Pauli , CZ and gates, which is the form of those of [2, 3, 4]. In both bases, the stabilizers are Clifford operators.
Level of the Gates. We now prove that the Clifford level of our logical gates cannot decrease by performing a change of logical basis. We will use that any two bases are related by a unitary, which preserves the ranks of operators. In general, a change of basis can change levels of the Clifford hierarchy.
The gate -Z lies in [11, 17], and in no lower level in any basis.
Proof. We use the following bound: every non-scalar on qubits has
for every phase . For it holds since every non-scalar Pauli operator has two eigenvalues of multiplicity . We now proceed by induction and assume (46) holds for . For and a Pauli operator , the commutator lies in , and
so . If is non-scalar for some , the bound (46) for gives . Otherwise commutes with every Pauli operator up to a phase, so it is a Pauli operator up to a phase, and the case applies. Since ranks do not depend on the basis and , the gate does not lie in in any basis.
Acknowledgments. We thank Dom Williamson for discussions and comments on the draft. This work is supported by the UKRI Frontier Research Grant, underwriting the ERC Advanced Grant “Generalized Symmetries in Quantum Field Theory and Quantum Gravity” (Schafer-Nameki). We acknowledge use of Claude Code (Fable 5.2, Opus 5.5) and ChatGPT Astra-6, for improvement of arguments and writing assistance and Fable 5.2 for initial exploration of this question.
References
- [1]S. Bravyi and R. Koenig, “Classification of Topologically Protected Gates for Local Stabilizer Codes,” Phys. Rev. Lett. 110 no. 17, (2013) 170503, arXiv:1206.1609 [quant-ph].DOI
- [2]Y. H. Hu, Y. Wan, and Y.-S. Wu, “Twisted quantum double model of topological phases in two dimensions,” Phys. Rev. B 87 no. 12, (2013) 125114, arXiv:1211.3695 [cond-mat.str-el].DOI
- [3]B. Yoshida, “Topological phases with generalized global symmetries,” Phys. Rev. B 93 no. 15, (2016) 155131, arXiv:1508.03468 [cond-mat.str-el].DOI
- [4]M. Davydova, A. Bauer, J. C. M. de la Fuente, M. Webster, D. J. Williamson, and B. J. Brown, “Universal Fault-Tolerant Quantum Computation in 2D without Getting Tied in Knots,” Phys. Rev. X 16 no. 3, (2026) 031001, arXiv:2503.15751 [quant-ph].DOI
- [5]R. Kobayashi, G. Zhu, and P.-S. Hsin, “Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States,” Phys. Rev. Lett. 136 no. 25, (2026) 250802, arXiv:2511.02900 [quant-ph].DOI
- [6]A. Warman and S. Schafer-Nameki, “Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes,” PRX Quantum 7 no. 3, (2026) 033029, arXiv:2512.13777 [quant-ph].DOI
- [7]M. Iqbal et al., “Non-Abelian topological order and anyons on a trapped-ion processor,” Nature 626 no. 7999, (2024) 505–511, arXiv:2305.03766 [quant-ph].DOI
- [8]J. C. M. de la Fuente, N. Feldman, J. Eisert, and A. Bauer, “High-threshold decoding of non-Pauli codes for 2D universality,” arXiv:2604.02033 [quant-ph].
- [9]Alternative recent approaches for non-Clifford gates via non-Abelian codes include lattice surgery with group surface codes [26–28], non-Abelian quantum LDPC codes [29, 30], measurements of logical Clifford operators by gauging and code surgery [31–33], and computation with gapped boundaries of quantum doubles [34].
- [10]C. Fechisin, K. Cooney, M. Raja, V. V. Albert, D. J. Williamson, K. Kawagoe, and S. Musser, “Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles,” arXiv:2610.00464 [quant-ph].
- [11]S. X. Cui, D. Gottesman, and A. Krishna, “Diagonal gates in the Clifford hierarchy,” Phys. Rev. A 95 no. 1, (2017) 012329, arXiv:1608.06596 [quant-ph].DOI
- [12]Y. Shi, “Both Toffoli and Controlled-NOT need little help to universal quantum computing,” Quant. Inf. Comput. 3 no. 1, (2003) 084–092, arXiv:quant-ph/0205115.DOI
- [13]D. Aharonov, “A Simple Proof that Toffoli and Hadamard are Quantum Universal,” arXiv:quant-ph/0301040.
- [14]C. Gidney, “Halving the cost of quantum addition,” Quantum 2 (2018) 74, arXiv:1709.06648 [quant-ph].DOI
- [15]D. Gottesman, “Stabilizer codes and quantum error correction,” arXiv:quant-ph/9705052.
- [16]N. Tantivasadakarn, R. Verresen, and A. Vishwanath, “Shortest Route to Non-Abelian Topological Order on a Quantum Processor,” Phys. Rev. Lett. 131 no. 6, (2023) 060405, arXiv:2209.03964 [quant-ph].
- [17]D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature 402 no. 6760, (1999) 390–393, arXiv:quant-ph/9908010.
- [18]A. Y. Kitaev, “Fault tolerant quantum computation by anyons,” Annals Phys. 303 (2003) 2–30, arXiv:quant-ph/9707021.
- [19]S. Beigi, P. W. Shor, and D. Whalen, “The Quantum Double Model with Boundary: Condensations and Symmetries,” Commun. Math. Phys. 306 no. 3, (2011) 663–694, arXiv:1006.5479 [quant-ph].DOI
- [20]For k_A = 1: G_A = ⟨m⟩, R_A = {id}, S_A = T_A = ⟨m⟩.
- [21]A. Warman, “AlgebrasTQD: Computing Algebras and Interfaces in Twisted Quantum Doubles,” arXiv:2610.36029 [cond-mat.str-el].arxiv.org/abs/2610.36029
- [22]V. V. Albert, D. Aasen, W. Xu, W. Ji, J. Alicea, and J. Preskill, “Spin chains, defects, and quantum wires for the quantum-double edge,” arXiv:2111.12096 [cond-mat.str-el].arxiv.org/abs/2111.12096
- [23]H. Bombin and M. A. Martin-Delgado, “A Family of Non-Abelian Kitaev Models on a Lattice: Topological Confinement and Condensation,” Phys. Rev. B 78 (2008) 115421, arXiv:0712.0190 [cond-mat.str-el].DOI
- [24]We can use this simplified expression in terms of tensor products of left-multiplication operators on each ribbon ξ because we are acting on identity group elements.
- [25]A. Warman, N. Tantivasadakarn, and S. Schafer-Nameki, “Exact Recovery for Non-Abelian Surface Codes,” arXiv:2610.03677 [quant-ph].arxiv.org/abs/2610.03677

