Papers
Topics
Authors
Recent
Search
2000 character limit reached

Non-Clifford gates between stabilizer codes via non-Abelian topological order

Published 23 May 2025 in quant-ph and cond-mat.str-el | (2505.18265v1)

Abstract: 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 non-diagonal 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\mathcal{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 on 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 $\mathcal{D}(G),$ where $G$ is a semidirect product of Abelian groups. This work serves as a step towards classifying the computational power of non-Abelian quantum phases beyond the paradigm of anyon braiding on near-term quantum devices.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.