The Clifford hierarchy $\mathsf{C}_1 \subset \mathsf{C}_2 \subset \cdots$ was introduced by Gottesman and Chuang (arXiv:quant-ph/9908010) to characterize gates that admit fault-tolerant implementation by gate teleportation. Yet, despite its rich mathematical structure and the attention it has received in recent years, little is known about $\mathsf{C}_k$ for $k > 3$. Most progress has focused on identifying structural properties of restrictions of the hierarchy, such as diagonal gates and gates on systems of small dimension $d$ or with few qudits.
The generalized semi-Clifford conjecture, proposed by Zeng et al. (arXiv:0712.2084), states that every gate in $\cup_k \mathsf{C}_k$ is, up to multiplication by Cliffords, the product of a permutation and a diagonal matrix. Beigi and Shor proved the case $d=2$, $k=3$ (arXiv:0810.5108) and Pllaha et al. found an alternative proof by exploiting fixed points of the conjugation map induced by (a Clifford correction of) $U \in \mathsf{C}_3$ on the span of maximal stabilizer subgroups (arXiv:2006.14040). By extending their fixed-point arguments to the group $Γ_1(U)$ generated by $U \mathsf{P} U^\dagger$ and beyond, we prove the conjecture for $k \leq 4$ and any prime dimension $d$.
Our proof centers on conjugation groups $Γ_1(U), Γ_2(U), \ldots$ of $U \in \mathsf{C}_k$, which we expect to be a useful tool in the study of the Clifford hierarchy more generally. We also show a natural sufficient condition on such groups for gates in higher levels to be generalized semi-Clifford.
AI Summary
The paper studies the generalized semi-Clifford property of gates in the Clifford hierarchy: whether a gate maps one Pauli maximal abelian subalgebra (MASA) onto another, equivalently whether Clifford multiplication on the left and right reduces it to a permutation times a diagonal unitary. It proves that every $n$-qudit gate in $\mathsf{C}_k$ with $k\leq4$ is generalized semi-Clifford, for arbitrary $n$ and any prime local dimension $d$. This extends the previously established general qubit result at level three to level four and to prime-dimensional qudits.
The proof introduces recursively defined conjugation groups, starting with $\Gamma_1(U)=U\mathsf{P}U^\dagger$ and setting $\Gamma_j(U)=\langle V\mathsf{P}V^\dagger:V\in\Gamma_{j-1}(U)\rangle$. For $U\in\mathsf{C}_4$, it establishes that $\Gamma_2(U)$ is a finite $d$-group contained in the Clifford group, using the characteristic maximal normal $d$-subgroup. Its action on the $\prod_{i=1}^n(d^i+1)$ Lagrangian subspaces therefore has fixed points, since this number is congruent to one modulo $d$. A second fixed-point argument for $\Gamma_1(U)$ yields an invariant Pauli MASA; pulling it back through $U$ proves the result.
For higher levels, the paper gives the sufficient condition $\Gamma_{k-2}(U)\subseteq\mathsf{C}_2$, which forces the relevant conjugation groups to be finite $d$-groups and permits an iterated fixed-point proof. The unconditional theorem is restricted to prime local dimensions and levels at most four. The paper notes known level-five counterexamples, so the generalized semi-Clifford property does not hold throughout the hierarchy.
Little sign of AI-generated textAI use disclosed
We used OpenAI Codex to assist with mathematical exploration, including developing proof strategies, checking intermediate algebraic arguments, and, alongside Claude Code, to identify relevant literature and draft text.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
The Clifford hierarchy C1⊂C2⊂⋯ was introduced by Gottesman and Chuang (arXiv:quant-ph/9908010) to characterize gates that admit fault-tolerant implementation by gate teleportation. Yet, despite its rich mathematical structure and the attention it has received in recent years, little is known about Ck for k>3. Most progress has focused on identifying structural properties of restrictions of the hierarchy, such as diagonal gates and gates on systems of small dimension d or with few qudits.
The generalized semi-Clifford conjecture, proposed by Zeng et al. (arXiv:0712.2084), states that every gate in ∪kCk is, up to multiplication by Cliffords, the product of a permutation and a diagonal matrix. Beigi and Shor proved the case d=2, k=3 (arXiv:0810.5108) and Pllaha et al. found an alternative proof by exploiting fixed points of the conjugation map induced by (a Clifford correction of) U∈C3 on the span of maximal stabilizer subgroups (arXiv:2006.14040). By extending their fixed-point arguments to the group Γ1(U) generated by UPU† and beyond, we prove the conjecture for k≤4 and any prime dimension d.
Our proof centers on conjugation groups Γ1(U),Γ2(U),… of U∈Ck, which we expect to be a useful tool in the study of the Clifford hierarchy more generally. We also show a natural sufficient condition on such groups for gates in higher levels to be generalized semi-Clifford.
The paper studies the generalized semi-Clifford property of gates in the Clifford hierarchy: whether a gate maps one Pauli maximal abelian subalgebra (MASA) onto another, equivalently whether Clifford multiplication on the left and right reduces it to a permutation times a diagonal unitary. It proves that every n-qudit gate in Ck with k≤4 is generalized semi-Clifford, for arbitrary n and any prime local dimension d. This extends the previously established general qubit result at level three to level four and to prime-dimensional qudits.
The proof introduces recursively defined conjugation groups, starting with Γ1(U)=UPU† and setting Γj(U)=⟨VPV†:V∈Γj−1(U)⟩. For U∈C4, it establishes that Γ2(U) is a finite d-group contained in the Clifford group, using the characteristic maximal normal d-subgroup. Its action on the ∏i=1n(di+1) Lagrangian subspaces therefore has fixed points, since this number is congruent to one modulo d. A second fixed-point argument for Γ1(U) yields an invariant Pauli MASA; pulling it back through U proves the result.
For higher levels, the paper gives the sufficient condition Γk−2(U)⊆C2, which forces the relevant conjugation groups to be finite d-groups and permits an iterated fixed-point proof. The unconditional theorem is restricted to prime local dimensions and levels at most four. The paper notes known level-five counterexamples, so the generalized semi-Clifford property does not hold throughout the hierarchy.
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The importance of these gates has motivated numerous studies of their structure. Zeng-Chen-Chuang conjectured in 2007 that all hierarchy gates are generalised semi-Clifford, i.e. take the form C1ΠDC2 for Clifford gates C1,C2, a permutation gate Π, and a diagonal gate D; Beigi-Shor proved in 2008 that this holds for all third-level gates.
We construct a five-qubit gate that is in the fifth level of the Clifford hierarchy but is not generalised semi-Clifford. Rather than simply present and verify our counterexample to the generalised semi-Clifford conjecture, we show how its form can be deduced. Our counterexample also demonstrates that the Clifford hierarchy is not closed under inverses.
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, introduced by Gottesman and Chuang (Nature, 402, 390-392). Ck gates are a generalization of Clifford operators, but our knowledge of these sets is not as rich as our knowledge of Clifford gates. Zeng et al. in (Phys. Rev. A 77, 042313) raise the question of the relation between Ck hierarchy and the set of semi-Clifford and generalized semi-Clifford operators. They conjecture that any Ck gate is a generalized semi-Clifford operator. In this paper, we prove this conjecture for k=3. Using the techniques that we develop, we obtain more insight on how to characterize C3 gates. Indeed, the more we understand C3, the more intuition we have on Ck, k≥4, and then we have a way of attacking the conjecture for larger k.
An important question in quantum information theory asks whether every gate in the Clifford hierarchy is semi-Clifford or not, as such gates admit resource-efficient implementations via gate teleportation. Extending recent results for prime dimensions~\cite{silva_clifford_2025}, we prove that every hierarchy gate on a single qudit of dimension d is semi-Clifford, if and only if d is square-free. In composite dimensions, Zd2 is a symplectic module rather than a vector space, motivating a distinction between four types of gates. Semi-Clifford gates (SC) are the ones that become diagonal under left and right multiplication by Clifford gates, while a broader class N admits a permutation diagonal form, under left and right multiplication by Cliffords. Lagrangian semi-Clifford gates (LSC) conjugate some maximal abelian Pauli subgroup to another, whereas generalized semi-Clifford gates (GSC) map some maximal abelian Pauli subalgebra to another under conjugation. In square-free dimensions, we have SC=LSC and N=GSC, but when d is not square-free, these equivalences can fail, as Lagrangian submodules can become non-free. We also show that every third-level gate of the one-qudit Clifford hierarchy is a generalized semi-Clifford in arbitrary dimensions.
We study semi-Clifford and generalized semi-Clifford structures in the Clifford hierarchy as a function of hierarchy level k and qubit number n. We show that Ck(n) is semi-Clifford if and only if k≤2, n≤2, or k=3 and n≤6. We also establish that Ck(n) is generalized semi-Clifford when k≤4 or n≤3 and construct counterexamples when k,n≥5. For n=4 and k≥5, we show that every gate defined over Q(i) up to a scalar is generalized semi-Clifford, reduce the general case to a single level, and propose a strategy to prove our conjecture that Ck(n) is generalized semi-Clifford if and only if k≤4 or n≤4. Lastly, we go beyond this structure by introducing nc-generalized semi-Clifford gates, which we show are exactly the gates of the form ∑x∣π(x)⟩⟨x∣⊗Vx up to Clifford gates on both sides, where π permutes the computational basis states of nc control qubits. We conjecture that for k≥3 every gate in Ck(n) has this form for some nc≥1 with every Vx∈Ck−3(n−nc), refining the conjecture of Zeng, Chen, and Chuang.
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and ‘nearly diagonal’ semi-Clifford gates are particularly important: they admit efficient gate teleportation protocols that implement these gates with fewer ancillary quantum resources such as magic states. Despite the practical importance of these sets of gates, many questions about their structure remain open; this is especially true in the higher-dimensional qudit setting. Our contribution is to leverage the discrete Stone–von Neumann theorem and the symplectic formalism of qudit stabilizer theory towards extending the results of Zeng et al . (2008) and Beigi & Shor (2010) to higher dimensions in a uniform manner. We further give a simple algorithm for recursively enumerating all gates of the Clifford hierarchy, a simple algorithm for recognizing and diagonalizing semi-Clifford gates, and a concise proof of the classification of the diagonal Clifford hierarchy gates due to Cui et al . (2016) for the single-qudit case. We generalize the efficient gate teleportation protocols of semi-Clifford gates to the qudit setting and prove that every third-level gate of one qudit (of any prime dimension) and of two qutrits can be implemented efficiently. Numerical evidence gathered via the aforementioned algorithms supports the conjecture that higher-level gates can be implemented efficiently.
Teleportation is a crucial element in fault-tolerant quantum computation and a complete understanding of its capacity is very important for the practical implementation of optimal fault-tolerant architectures. It is known that stabilizer codes support a natural set of gates that can be more easily implemented by teleportation than any other gates. These gates belong to the so-called Ck hierarchy introduced by Gottesman and Chuang [Nature (London) 402, 390 (1999)]. Moreover, a subset of Ck gates, called semi-Clifford operations, can be implemented by an even simpler architecture than the traditional teleportation setup [X. Zhou, D. W. Leung, and I. L. Chuang, Phys. Rev. A 62, 052316 (2000)]. However, the precise set of gates in Ck remains unknown, even for a fixed number of qubits n, which prevents us from knowing exactly what teleportation is capable of. In this paper we study the structure of Ck in terms of semi-Clifford operations, which send by conjugation at least one maximal Abelian subgroup of the n-qubit Pauli group into another one. We show that for n=1,2, all the Ck gates are semi-Clifford, which is also true for n=3,k=3. However, this is no longer true for n>2,k>3. To measure the capability of this teleportation primitive, we introduce a quantity called ``teleportation depth,'' which characterizes how many teleportation steps are necessary, on average, to implement a given gate. We calculate upper bounds for teleportation depth by decomposing gates into both semi-Clifford Ck gates and those Ck gates beyond semi-Clifford operations, and compare their efficiency.