In this paper we prove a collection of results on the structure of permutations in the Clifford Hierarchy. First, we leverage results from the cryptography literature on affine equivalence classes of 4-bit permutations which we use to find all 4-qubit permutations in the Clifford Hierarchy. We then use the classification of 4-qubit permutations and previous results on the structure of diagonal gates in the Clifford Hierarchy to prove that all 4-qubit gates in the third level of the Clifford Hierarchy are semi-Clifford. We then leverage results from \cite{He2024} to prove that all 5-qubit gates in the third level of the Clifford Hierarchy are semi-Clifford. We introduce the formalism of cycle structures to permutations in the Clifford Hierarchy and prove a general structure theorem about them, and classify many small cycle structures up to affine equivalence. Interestingly, this classification is independent of the number of qubits. Additionally, we show that all 1-wire-mismatch permutations are in the Clifford Hierarchy.
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 fundamental structure in quantum computation, classifying unitary operators based on their commutation relations with the Pauli group. Despite its significance, the mathematical structure of the hierarchy is not well understood at the third level and higher. In this work, we study permutations in the hierarchy: gates which permute the
2n basis states. We fully characterize all the semi-Clifford permutation gates. Moreover, we prove that any permutation gate in the third level, not necessarily semi-Clifford, must be a product of Toffoli gates in what we define as staircase form, up to left and right multiplications of Clifford permutations. Finally, we show that the smallest number of qubits for which there exists a non-semi-Clifford permutation in the third level is
7.
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.
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.
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.