Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.06402

When is the Clifford hierarchy generalized semi-Clifford?

Rongbiao Thomas Wang, Bobby Zixuan Zhang

quant-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

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 $\mathcal{C}_k(n)$ is semi-Clifford if and only if $k\le2$, $n\le2$, or $k=3$ and $n\le6$. We also establish that $\mathcal{C}_k(n)$ is generalized semi-Clifford when $k\le4$ or $n\le3$ and construct counterexamples when $k,n \geq 5$. For $n=4$ and $k\ge5$, we show that every gate defined over $\mathbb{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 $\mathcal{C}_k(n)$ is generalized semi-Clifford if and only if $k\le4$ or $n\le4$. Lastly, we go beyond this structure by introducing $n_c$-generalized semi-Clifford gates, which we show are exactly the gates of the form $\sum_x|π(x)\rangle\langle x|\otimes V_x$ up to Clifford gates on both sides, where $π$ permutes the computational basis states of $n_c$ control qubits. We conjecture that for $k\ge3$ every gate in $\mathcal{C}_k(n)$ has this form for some $n_c\ge1$ with every $V_x\in\mathcal{C}_{k-3}(n-n_c)$, refining the conjecture of Zeng, Chen, and Chuang.

AI Summary

The paper asks when every gate in a Clifford-hierarchy level admits a semi-Clifford (SC) or generalized semi-Clifford (GSC) decomposition: Clifford-equivalent to a diagonal or monomial gate, respectively. It completes the SC boundary: $\mathcal C_k(n)\subseteq\mathsf{SC}(n)$ exactly when $k\le2$, $n\le2$, or $k=3$ with $n\le6$. The new positive cases are five- and six-qubit third-level gates. For GSC structure, it proves inclusion for all widths at $k\le4$ and all levels at $n\le3$, and constructs non-GSC gates of exact level $k$ for every $k,n\ge5$. The fourth-level inclusion was also obtained independently elsewhere; a five-qubit fifth-level counterexample was already known. The fourth-level proof uses finite $2$-groups generated by Paulis and their conjugates, together with parity arguments yielding an invariant Pauli maximal abelian algebra. Small-width proofs combine symplectic reductions, exact finite computational checks, and descent in the smallest dyadic cyclotomic field defining a gate up to scalar. Four qubits at levels $k\ge5$ remain unresolved. Gates defined over $\mathbb Q(i)$ up to scalar are proved GSC, and the general question reduces to checking level $4290$, still computationally impractical. The paper also characterizes partial GSC structure through Clifford-equivalent controlled-block decompositions and conjectures that every level-$k$ gate has such a decomposition with at least one control and blocks in $\mathcal C_{k-3}$.

Little sign of AI-generated textAI use disclosed
We have also used the LLMs to help with the writing and polishing of the paper.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
50 pages, 13 figures, 1 table

Related papers

The generalised semi-Clifford conjecture is false

Nadish de Silva, Oscar Lautsch

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 $C_1 ΠD C_2$ for Clifford gates $C_1, C_2$, 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.

quant-pharXiv:2609.11903•Sep 11, 2026•1 citation

The Generalized Semi-Clifford Conjecture Holds at Level 4

Maxwell Marcus, Sathyawageeswar Subramanian, Marcel Dall'Agnol

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.

quant-pharXiv:2609.38751•Oct 1, 2026•1 citation

Semi-Cliffordness of the Clifford hierarchy for a single qudit in composite dimensions

Yifei Qi, Rahul Sarkar

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, \(\mathbb{Z}_d^2\) is a symplectic module rather than a vector space, motivating a distinction between four types of gates. Semi-Clifford gates ($\mathcal{SC}$) are the ones that become diagonal under left and right multiplication by Clifford gates, while a broader class $\mathcal{N}$ admits a permutation diagonal form, under left and right multiplication by Cliffords. Lagrangian semi-Clifford gates ($\mathcal{LSC}$) conjugate some maximal abelian Pauli subgroup to another, whereas generalized semi-Clifford gates ($\mathcal{GSC}$) map some maximal abelian Pauli subalgebra to another under conjugation. In square-free dimensions, we have \(\mathcal{SC}=\mathcal{LSC}\) and \(\mathcal{N}=\mathcal{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.

quant-pharXiv:2610.06836•Oct 6, 2026•0 citations

Permutation gates in the third level of the Clifford hierarchy

Zhiyang He, Luke Robitaille, Xinyu Tan

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 $2^n$ 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$.

arXiv:2410.11818•Oct 15, 2024•8 citations

On Groups in the Qubit Clifford Hierarchy

Jonas T. Anderson

Here we study the unitary groups that can be constructed using elements from the qubit Clifford Hierarchy. We first provide a necessary and sufficient canonical form that semi-Clifford and generalized semi-Clifford elements must satisfy to be in the Clifford Hierarchy. Then we classify the groups that can be formed from such elements. Up to Clifford conjugation, we classify all such groups that can be constructed using generalized semi-Clifford elements in the Clifford Hierarchy. We discuss a possible minor exception to this classification in the appendix. This may not be a full classification of all groups in the qubit Clifford Hierarchy as it is not currently known if all elements in the Clifford Hierarchy must be generalized semi-Clifford. In addition to the diagonal gate groups found by Cui et al., we show that many non-isomorphic (to the diagonal gate groups) generalized symmetric groups are also contained in the Clifford Hierarchy. Finally, as an application of this classification, we examine restrictions on transversal gates given by the structure of the groups enumerated herein which may be of independent interest.

arXiv:2212.05398•Quantum•Jun 13, 2024•18 citations

C_3, semi-Clifford and genralized semi-Clifford operations

Salman Beigi, Peter W. Shor

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 ${\mathcal{C}}_k$ hierarchy gates, introduced by Gottesman and Chuang (Nature, 402, 390-392). ${\mathcal{C}}_k$ 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 ${\mathcal{C}}_k$ hierarchy and the set of semi-Clifford and generalized semi-Clifford operators. They conjecture that any ${\mathcal{C}}_k$ 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 ${\mathcal{C}}_3$ gates. Indeed, the more we understand ${\mathcal{C}}_3$, the more intuition we have on ${\mathcal{C}}_k$, $k\geq 4$, and then we have a way of attacking the conjecture for larger $k$.

arXiv:0810.5108•Quantum Information and Computation•Jan 1, 2010•18 citations
We study semi-Clifford and generalized semi-Clifford structures in the Clifford hierarchy as a function of hierarchy level kkk and qubit number nnn. We show that Ck(n)\mathcal{C}_k(n)Ck​(n) is semi-Clifford if and only if k≤2k\le2k≤2, n≤2n\le2n≤2, or k=3k=3k=3 and n≤6n\le6n≤6. We also establish that Ck(n)\mathcal{C}_k(n)Ck​(n) is generalized semi-Clifford when k≤4k\le4k≤4 or n≤3n\le3n≤3 and construct counterexamples when k,n≥5k,n \geq 5k,n≥5. For n=4n=4n=4 and k≥5k\ge5k≥5, we show that every gate defined over Q(i)\mathbb{Q}(i)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)\mathcal{C}_k(n)Ck​(n) is generalized semi-Clifford if and only if k≤4k\le4k≤4 or n≤4n\le4n≤4. Lastly, we go beyond this structure by introducing ncn_cnc​-generalized semi-Clifford gates, which we show are exactly the gates of the form ∑x∣π(x)⟩⟨x∣⊗Vx\sum_x|π(x)\rangle\langle x|\otimes V_x∑x​∣π(x)⟩⟨x∣⊗Vx​ up to Clifford gates on both sides, where πππ permutes the computational basis states of ncn_cnc​ control qubits. We conjecture that for k≥3k\ge3k≥3 every gate in Ck(n)\mathcal{C}_k(n)Ck​(n) has this form for some nc≥1n_c\ge1nc​≥1 with every Vx∈Ck−3(n−nc)V_x\in\mathcal{C}_{k-3}(n-n_c)Vx​∈Ck−3​(n−nc​), refining the conjecture of Zeng, Chen, and Chuang.
The paper asks when every gate in a Clifford-hierarchy level admits a semi-Clifford (SC) or generalized semi-Clifford (GSC) decomposition: Clifford-equivalent to a diagonal or monomial gate, respectively.
It completes the SC boundary: Ck(n)⊆SC(n)\mathcal C_k(n)\subseteq\mathsf{SC}(n)Ck​(n)⊆SC(n) exactly when k≤2k\le2k≤2, n≤2n\le2n≤2, or k=3k=3k=3 with n≤6n\le6n≤6. The new positive cases are five- and six-qubit third-level gates. For GSC structure, it proves inclusion for all widths at k≤4k\le4k≤4 and all levels at n≤3n\le3n≤3, and constructs non-GSC gates of exact level kkk for every k,n≥5k,n\ge5k,n≥5. The fourth-level inclusion was also obtained independently elsewhere; a five-qubit fifth-level counterexample was already known.
The fourth-level proof uses finite 222-groups generated by Paulis and their conjugates, together with parity arguments yielding an invariant Pauli maximal abelian algebra. Small-width proofs combine symplectic reductions, exact finite computational checks, and descent in the smallest dyadic cyclotomic field defining a gate up to scalar.
Four qubits at levels k≥5k\ge5k≥5 remain unresolved. Gates defined over Q(i)\mathbb Q(i)Q(i) up to scalar are proved GSC, and the general question reduces to checking level 429042904290, still computationally impractical. The paper also characterizes partial GSC structure through Clifford-equivalent controlled-block decompositions and conjectures that every level-kkk gate has such a decomposition with at least one control and blocks in Ck−3\mathcal C_{k-3}Ck−3​.
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ΠDC2C_1 ΠD C_2C1​ΠDC2​ for Clifford gates C1,C2C_1, C_2C1​,C2​, a permutation gate ΠΠΠ, and a diagonal gate DDD; 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.
The Clifford hierarchy C1⊂C2⊂⋯\mathsf{C}_1 \subset \mathsf{C}_2 \subset \cdotsC1​⊂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\mathsf{C}_kCk​ for k>3k > 3k>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 ddd or with few qudits. The generalized semi-Clifford conjecture, proposed by Zeng et al. (arXiv:0712.2084), states that every gate in ∪kCk\cup_k \mathsf{C}_k∪k​Ck​ is, up to multiplication by Cliffords, the product of a permutation and a diagonal matrix. Beigi and Shor proved the case d=2d=2d=2, k=3k=3k=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∈C3U \in \mathsf{C}_3U∈C3​ on the span of maximal stabilizer subgroups (arXiv:2006.14040). By extending their fixed-point arguments to the group Γ1(U)Γ_1(U)Γ1​(U) generated by UPU†U \mathsf{P} U^\daggerUPU† and beyond, we prove the conjecture for k≤4k \leq 4k≤4 and any prime dimension ddd. Our proof centers on conjugation groups Γ1(U),Γ2(U),…Γ_1(U), Γ_2(U), \ldotsΓ1​(U),Γ2​(U),… of U∈CkU \in \mathsf{C}_kU∈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 ddd is semi-Clifford, if and only if ddd is square-free. In composite dimensions, Zd2\mathbb{Z}_d^2Zd2​ is a symplectic module rather than a vector space, motivating a distinction between four types of gates. Semi-Clifford gates (SC\mathcal{SC}SC) are the ones that become diagonal under left and right multiplication by Clifford gates, while a broader class N\mathcal{N}N admits a permutation diagonal form, under left and right multiplication by Cliffords. Lagrangian semi-Clifford gates (LSC\mathcal{LSC}LSC) conjugate some maximal abelian Pauli subgroup to another, whereas generalized semi-Clifford gates (GSC\mathcal{GSC}GSC) map some maximal abelian Pauli subalgebra to another under conjugation. In square-free dimensions, we have SC=LSC\mathcal{SC}=\mathcal{LSC}SC=LSC and N=GSC\mathcal{N}=\mathcal{GSC}N=GSC, but when ddd 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 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 2n2^n2n 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 777.
Here we study the unitary groups that can be constructed using elements from the qubit Clifford Hierarchy. We first provide a necessary and sufficient canonical form that semi-Clifford and generalized semi-Clifford elements must satisfy to be in the Clifford Hierarchy. Then we classify the groups that can be formed from such elements. Up to Clifford conjugation, we classify all such groups that can be constructed using generalized semi-Clifford elements in the Clifford Hierarchy. We discuss a possible minor exception to this classification in the appendix. This may not be a full classification of all groups in the qubit Clifford Hierarchy as it is not currently known if all elements in the Clifford Hierarchy must be generalized semi-Clifford. In addition to the diagonal gate groups found by Cui et al., we show that many non-isomorphic (to the diagonal gate groups) generalized symmetric groups are also contained in the Clifford Hierarchy. Finally, as an application of this classification, we examine restrictions on transversal gates given by the structure of the groups enumerated herein which may be of independent interest.
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{\mathcal{C}}_kCk​ hierarchy gates, introduced by Gottesman and Chuang (Nature, 402, 390-392). Ck{\mathcal{C}}_kCk​ 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{\mathcal{C}}_kCk​ hierarchy and the set of semi-Clifford and generalized semi-Clifford operators. They conjecture that any Ck{\mathcal{C}}_kCk​ gate is a generalized semi-Clifford operator. In this paper, we prove this conjecture for k=3k=3k=3. Using the techniques that we develop, we obtain more insight on how to characterize C3{\mathcal{C}}_3C3​ gates. Indeed, the more we understand C3{\mathcal{C}}_3C3​, the more intuition we have on Ck{\mathcal{C}}_kCk​, k≥4k\geq 4k≥4, and then we have a way of attacking the conjecture for larger kkk.