arXiv:2610.00464
Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles
Christopher Fechisin, Kieran Cooney, Mathi Raja, Victor V. Albert, Dominic J. Williamson, Kyle Kawagoe, Seth Musser
Abstract
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.
AI Summary
The paper asks how stabilizer descriptions beyond Pauli operators can characterize twisted quantum doubles and support code-switching operations. It introduces $X\mathcal C_d^{(k)}$ codes on prime-dimensional qudits, whose stabilizers combine Pauli-$X$ strings with potentially multiqudit diagonal gates from Clifford-hierarchy level $k$. These operators form a group, although the full hierarchy level generally does not. Its central classification theorem states that a uniquely stabilized state is, up to qudit permutation, a uniform superposition over an affine-linear subspace, with phases generated by a diagonal gate at level at most $k+1$. Conversely, every state of this form admits level-$k$ stabilizers. The proof combines the translation orbits and diagonal subgroup of the stabilizer group with finite-difference characterizations of diagonal hierarchy gates. A canonical-form extraction procedure is also given. For $\mathcal D^\omega(\mathbb Z_p^n)$, nontrivial twists consisting only of type-III cocycles admit Clifford stabilizers, $k=2$; non-Abelian anyons exclude $k=1$. Canonical constructions involving type-I or type-II cocycles use level $p$. Their phase-wide minimality is conjectured, not proved, with motivation from primitive $p^2$-root topological spins. A measurement-based code-switching protocol through a type-III twisted double prepares logical magic states in two toric-code blocks for every outcome when $p$ is odd, unlike the analogous qubit protocol. The classification concerns unique codewords and does not establish efficient classical algorithms. Composite qudit dimensions, general codespace properties, and fault tolerance of code switching remain open; the proposed generalized Bravyi–Koenig bound is also conjectural.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 19+14 pages, 4+3 figures