We propose protocols to implement non-Clifford logical gates between stabilizer codes by entangling into a non-Abelian topological order as an intermediate step. Generalizing previous approaches, we provide a framework that generates a large class of non-Clifford and nondiagonal logical gates between qudit surface codes by gauging the topological symmetry of symmetry-enriched topological orders. As our main example, we concretely detail a protocol that utilizes the quantum double of S 3 to generate a controlled-charge-conjugation ( C C ) gate between a qubit and qutrit surface code. Both the preparation of non-Abelian states and logical state injection between the Abelian and non-Abelian codes are executed via finite-depth quantum circuits with measurement and feedforward. We discuss aspects of the fault tolerance of our protocol, presenting insights into how to construct a heralded decoder for the quantum double of S 3 . We also outline how analogous protocols can be used to obtain logical gates between qudit surface codes by entangling into D ( G ) , where G is a semidirect product of Abelian groups. This work serves as a step toward classifying the computational power of non-Abelian quantum phases beyond the paradigm of anyon braiding on near-term quantum devices.
We classify canonical Rényi strong subadditivity on an unpunctured torus for finite unitary modular categories. For all pure logical states and admissible region pairs, validity at 0<alpha<1 is equivalent to Abelianity; at alpha=1 it is universal. Each finite non-Abelian group G has a pure untwisted D(G) fixed-point ground state with an order-two violation under ordinary edge partial traces. A specified local-filter D(S_3) family changes reduced spectra; its fixed-cut deficit tends to the negative fixed-point value over a small size-independent interval in a controlled joint limit.
Code surgery measures a logical operator of a quantum LDPC code with
O(d) rounds of syndrome extraction. Lifted surgery amortises this cost on Abelian group-algebra codes by measuring an orbit of logical operators under a translation symmetry in one merged code. We extend it to two-block group-algebra codes over non-Abelian groups and ask whether non-commutativity lets one merged code measure more operators than any Abelian group of its symmetries. We classify the block-affine automorphisms of these codes and find that, measured against this full group, most apparent non-Abelian gains disappear. We prove that the gain is at most the index of a largest Abelian subgroup. We find codes with exact distance up to
13 where the gain is two, including codes in which one merged code reads out every logical qubit, and codes over products of
A4,
S4 and SL(2,3) with gain three for a best logical, up to
[[336,26,12]]. A merged-distance lemma gives a simple condition for the gadget to preserve the code distance. In circuit-level simulations with Relay-BP decoding, at the error rates we can resolve, the non-Abelian gadget is as reliable as, or more reliable than, the Abelian gadgets it replaces within statistical error, while using two to three times fewer rounds.