Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles

AI summary

Overview

• Research area: Quantum information theory, specifically quantum error-correcting codes, stabilizer formalisms, topological order, and fault-tolerant quantum computation.
• Technical level: Advanced. The paper assumes familiarity with the Pauli stabilizer formalism, the Clifford hierarchy, group cohomology, and twisted quantum double models; the summary below is written to be accessible to a graduate student in quantum information or condensed matter physics.
• Scope: The paper introduces and classifies a family of beyond-Pauli stabilizer codes built from Pauli-(X) operators and diagonal Clifford-hierarchy gates, and applies them to twisted quantum double phases and to deterministic magic-state preparation on qudits.

What This Paper Is About

Pauli stabilizer codes are the workhorse of quantum error correction, but the Bravyi–Koenig bound says that a 2D Pauli stabilizer code cannot implement topologically protected gates outside the Clifford group. Recent code-switching protocols evade this bound by passing through intermediate non-Pauli stabilizer codes, typically twisted quantum doubles, but no general framework existed for constructing and characterizing such codes. This paper supplies that framework, called the (X\mathcal{C}^{(k)}_d) ("xkcd") stabilizer formalism, and uses it to determine which twisted quantum double phases can be realized with which level of the Clifford hierarchy.

Key Contributions

1. A new stabilizer formalism. The authors define (X\mathcal{C}^{(k)}_d) codes on prime-dimensional qudits: stabilizer groups generated by products of Pauli-(X) operators and diagonal operators drawn from level (k) of the Clifford hierarchy. Combining (X) with diagonal operators ensures the generating set forms a group even though level (k > 2) of the Clifford hierarchy is not itself a group. The construction covers nearly all Clifford stabilizer codes previously introduced and is a special case of monomial stabilizer codes.

2. A classification of stabilized states (Theorem IV.8). States uniquely stabilized by (X\mathcal{C}^{(k)}d) stabilizers are shown to be uniform superpositions over affine-linear subspaces with diagonal phases, of the form (\frac{1}{p^{\ell/2}}\sum{\mathbf{x}\in\mathbb{Z}_p^\ell} e^{2\pi i \varphi(\mathbf{x})}|\mathbf{x}, M\mathbf{x}+\mathbf{c}\rangle), where (e^{2\pi i\varphi}) is a diagonal operator at most at level (k+1) of the Clifford hierarchy. In other words, stabilizers at level (k) produce wavefunction phases at level (k+1).

3. A constructive realization of type-III twisted quantum doubles. Every 2D twisted quantum double (\mathcal{D}^\omega(\mathbb{Z}_p^n)) with (\omega) a product of type-III cocycles and (p) an odd prime is shown to admit a realization using only Clifford ((k=2)) stabilizers. Because these phases host non-abelian anyons, they cannot be realized by Pauli ((k=1)) stabilizers, so (k=2) is a lower bound.

4. A conjecture and a magic-state protocol. The authors conjecture that twists containing type-I or type-II cocycles require level-(p) Clifford-hierarchy stabilizers, and they construct a code-switching protocol in which measuring (X\mathcal{C}^{(k)}_d) stabilizers deterministically prepares a logical magic state in a pair of qudit toric codes, generalizing a qubit protocol that was only probabilistic.

Main Findings

• The "xkcd" framework. (X\mathcal{C}^{(k)}_d) codes combine Pauli-(X) with diagonal level-(k) Cliffords on prime-dimensional qudits. They inherit general monomial-stabilizer-code properties (such as a canonical basis from permutation-group orbits) but add Clifford-hierarchy structure tied to computational practicality.

• Phases sit one level higher than stabilizers. Theorem IV.8 shows that if a state's stabilizers require level (k) of the Clifford hierarchy, the diagonal gates needed to produce its wavefunction phases sit at level (k+1). For qubits ((p=2)) this reproduces known results for Pauli ((k=1)) and (XS) ((k=2)) stabilizers.

• Type-III twists are Clifford-realizable. Twisted quantum doubles (\mathcal{D}^\omega(\mathbb{Z}_p^n)) with (\omega) a product of type-III cocycles and (p) an odd prime are realized with (k=2) stabilizers. Type-III cocycles are the ones that produce non-abelian anyons from an abelian gauge group.

• Conjecture I.2: minimal level is 2 or (p). The conjectured minimum (k) is (2) if (\omega) is a product of type-III cocycles and (p) otherwise, for nontrivial (\omega). The first case is proven by construction; the second is supported by evidence rather than a full proof.

• An unexpected ordering of resources. Since type-III twists give non-abelian anyons while type-I/II twists do not, the conjecture implies that some non-abelian qudit models can be realized with lower-level stabilizers than purely abelian ones. This holds only for prime dimension (\geq 3); for qubits ((p=2)) the two cases coincide.

• Deterministic magic-state preparation. Measuring (X\mathcal{C}^{(k)}_d) stabilizers in a code-switching protocol prepares a logical magic state in a pair of qudit toric codes deterministically, whereas the analogous qubit protocol is probabilistic.

• Relation to fundamental bounds. The construction circumvents the Bravyi–Koenig bound precisely because non-Pauli gates such as (CZ), (S), and (T) enter the stabilizers, and it operates alongside the Eastin–Knill theorem's prohibition on transversal universality.

• No numerical benchmarks. The paper reports no experiments, dataset sizes, thresholds, or quantitative performance comparisons; its results are analytical and constructive.

Methodology in Plain English

The authors build stabilizer groups out of two ingredients: Pauli-(X) operators, which shift qudit values, and diagonal gates from a fixed level of the Clifford hierarchy, which attach phases. Because the diagonal part is restricted to a fixed level, the resulting set closes into a group, which is what makes a stabilizer formalism possible at all.

To connect this to topological phases, they place qudits valued in (\mathbb{Z}_p^n) on the edges of a triangulated 2D lattice with a branching structure, following the standard twisted quantum double construction. The Hamiltonian has "plaquette" terms enforcing zero flux and "star" terms that shift edge values while multiplying by (U(1)) phases built from the 3-cocycle (\omega). The twist (\omega) determines how the star terms are modified.

For the classification, they analyze what a state must look like to be simultaneously (+1) eigenstate of all stabilizers. Solving these constraints forces the computational-basis support to be an affine-linear subspace (the graph of (M\mathbf{x}+\mathbf{c})) and forces the amplitudes to be pure phases, which are then identified as diagonal Clifford-hierarchy operators one level above the stabilizers.

For the constructive result on type-III cocycles, they exhibit explicit stabilizer sets at level (k=2). For the magic-state application, they design a code-switching sequence in which measuring (X\mathcal{C}^{(k)}_d) stabilizers projects a pair of qudit toric codes into a logical magic state, and they argue the projection succeeds deterministically.

Why This Matters

• A unified language for beyond-Pauli codes. Prior Clifford-hierarchy stabilizer codes were constructed case by case. This paper provides a general formalism, a state classification, and a topological interpretation, which is the kind of structure the Pauli formalism provided for earlier generations of codes.
• A sharper map of topological phases. The results connect the cohomological classification of twists (type-I, -II, -III cocycles) to the Clifford-hierarchy level needed to stabilize the phase, and thus to the computational resources the phase contains.

Real-world applications:

• Fault-tolerant quantum computing on qudits. Qudit hardware (qutrits and higher) can host these codes; the deterministic magic-state protocol is directly relevant to universality arguments for such platforms.
• Magic-state preparation. Deterministic preparation of logical magic states removes a probabilistic step from a code-switching protocol, which matters for overhead accounting in fault-tolerant architectures.
• Topological quantum computation with non-abelian anyons. A concrete stabilizer description of non-abelian twisted quantum double phases makes them amenable to syndrome measurement, decoding, and gate design using stabilizer techniques.
• Classification and benchmarking of codes. The framework gives a systematic way to ask how much Clifford-hierarchy structure a given topological order requires, which informs which phases are worth engineering.

Industry relevance: the work is theoretical, but it targets the resource questions (magic states, non-Clifford gates, qudit encodings) that dominate overhead estimates for fault-tolerant quantum computers. The paper reports no hardware demonstrations or threshold numbers.

Future Directions

• Prove or refute Conjecture I.2. The type-III case is proven; the claim that type-I or type-II cocycles require level-(p) stabilizers for (p)-dimensional qudits is supported only by evidence in Sec. V.
• Extend beyond (\mathbb{Z}_p^n) and prime dimension. The formalism is restricted to prime-dimensional qudits and abelian gauge groups; composite-dimensional qudits and non-abelian (G) are natural extensions, especially given prior work on composite-qudit Pauli stabilizer models.
• Develop the code-switching and magic-state protocol further. The deterministic qudit protocol raises questions about generalization to other logical states, fault-tolerant implementation of the required measurements, and resource costs, none of which are quantified here.
• Classify which topological orders admit (X\mathcal{C}^{(k)}_d) realizations. This is the analogue of Haah's result for translationally invariant Pauli stabilizer Hamiltonians and remains open beyond the twisted-quantum-double family treated here.

Target Audience

Quantum information researchers working on error correction and fault tolerance, condensed matter theorists interested in topological order and anyon models, and mathematically inclined readers comfortable with the Clifford hierarchy and group cohomology. Readers seeking experimental results, numerical benchmarks, or decoder performance data will not find them in this paper.

Authors’ 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.