Pith. sign in

REVIEW 3 major objections 3 minor 2 cited by

The Clifford hierarchy for one qubit or qudit

T0 review · 3 major / 3 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every gate in the one-qudit Clifford hierarchy is semi-Clifford, a Clifford sandwich around a diagonal gate.

desk verdict All levels of the one-qudit Clifford hierarchy are semi-Clifford, with a clean normal form and exact count; the central theorem looks sound, but Lemma 23's proof has two repairable gaps that a referee should check. read the letter →

arxiv 2501.07939 v1 pith:HQGEQKO3 submitted 2025-01-14 quant-ph math-phmath.MP

Nadish de Silva , Oscar Lautsch This is my paper · ORCID
classification quant-phmath-phmath.MP MSC 81P6881P45 PACS 03.67.Lx03.67.-a
keywords Cliffordhierarchysemi-CliffordgatesgateteleportationquditPaulisupportnormalformquantumerrorcorrectionmagicstates
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims to settle, for one qubit or one qudit of odd prime dimension, the two questions that have accompanied the Clifford hierarchy since its introduction: which gates occupy each level, and which of them admit efficient gate teleportation. The answer is that every gate in every level is semi-Clifford, meaning a product $C_1 D C_2$ of two Clifford gates around a diagonal gate. That single fact yields a unique normal form $G = M D C$ for every non-Clifford hierarchy gate and an exact formula for the size of every level. Consequently every one-qudit hierarchy gate can be implemented with the compact teleportation protocol that consumes only the magic state $D|+\rangle$.

What carries the argument

The engine is the conjugate-pair view of gates: by the discrete Stone-von Neumann theorem, each unitary gate $G$ corresponds up to phase to a pair $(U,V) = (GZG^*, GXG^*)$, and membership in level $k+1$ is equivalent to this pair being $k$-closed. Semi-Cliffordness is then read geometrically from Pauli supports: $G$ is semi-Clifford exactly when the supports of $U$ and $V$ lie on parallel lines in the phase plane $\mathbb{Z}_d^2$. The second load-bearing object is the normal form $\mathcal{C}_2 = \mathcal{M} \mathcal{D}_2 \mathcal{N}$, which splits any Clifford gate into one of $d+1$ fixed gates, a diagonal Clifford, and a permutation Clifford; feeding the diagonal-hierarchy classification through this form gives the unique $M D C$ decomposition and the count of levels.

What would settle it

Take a small odd prime, say $d=3$, and exhaustively enumerate all one-qudit gates $G$ up to phase with $G\mathcal{C}_1G^* \subseteq \mathcal{C}_2$, testing each for the form $C_1 D C_2$; one failure refutes Theorem 6. Equivalently, search for a qutrit gate whose conjugate pair has Pauli supports on non-parallel lines, since Theorem 5 makes parallel supports necessary and sufficient for semi-Cliffordness.

Watch

Extended reading notes

Core claim

The paper's central claim is that the single-qudit Clifford hierarchy collapses into the semi-Clifford class: for every odd prime $d$ and every level $k \geq 1$, every gate in $\mathcal{C}_k$ can be written as $C_1 D C_2$ with $C_1, C_2 \in \mathcal{C}_2$ and $D$ diagonal. The proof works through conjugate pairs: by the discrete Stone-von Neumann theorem a gate corresponds, up to phase, to a pair $(U,V) = (GZG^*, GXG^*)$, and the paper shows that the Pauli supports of $U$ and $V$ lie on parallel lines precisely when $G$ is semi-Clifford. From this and a new normal form $\mathcal{C}_2 = \mathcal{M} \, \mathcal{D}_2 \mathcal{N}$ for Clifford gates, every non-Clifford hierarchy gate is written uniquely as $G = M D C$, where $M$ is one of $d+1$ fixed gates, $D$ is a non-Clifford diagonal hierarchy gate, and $C$ is Clifford. The count $|\mathcal{C}_k| = d^3(d^2-1)(d^{k-1}+d^{k-2}-d)$ for $k \geq 2$ follows directly.

Load-bearing premise

The proof's induction depends on a lemma that any order-$d$ Clifford factor in a semi-Clifford decomposition can be conjugated into $\mathcal{D}_2\langle X\rangle$, and on treating a horizontal-line Pauli support as membership in $\mathcal{D}_k\langle X\rangle$ up to phase; if either reduction fails for some odd prime $d$, the main theorem does not go through.

Editorial extensions

If this is right

  • Every one-qudit hierarchy gate, not only diagonal ones, can be implemented by the compact gate-teleportation protocol whose resource state is $D|+\rangle$ rather than a larger two-qudit entangled state.
  • Each level $\mathcal{C}_k$ has exactly $d^3(d^2-1)(d^{k-1}+d^{k-2}-d)$ gates up to phase for $k \geq 2$, and $d^2$ at level one, so the growth of the hierarchy is known exactly.
  • The hierarchy is closed under inverses at every level, even though it is not a group above level two.
  • The Clifford-group normal form $\mathcal{C}_2 = \mathcal{M}\mathcal{D}_2\mathcal{N}$ gives a unique three-factor decomposition of every Clifford gate on one qubit or qudit.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper does not state it, but the Pauli-support criterion in Theorem 5 turns membership in a fixed hierarchy level into a geometric support condition that could be checked classically for a given one-qudit unitary without building the whole recursive hierarchy.
  • If the conjectured two-qudit classification is correct, the same counting route would give explicit sizes for two-qudit hierarchy levels.
  • Because the normal form is unique, the diagonal factor $D$ gives each non-Clifford gate a canonical resource state $D|+\rangle$, which isolates the part of the gate that must be prepared via magic-state distillation.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. This paper studies the Clifford hierarchy for a single qubit or qudit of prime dimension. The central claims are: (i) every gate in every level C_k is semi-Clifford (Theorem 6); (ii) every non-Clifford gate in C_k has a unique normal form M D C with M from a fixed (d+1)-element set, D a non-Clifford diagonal hierarchy gate modulo D_2, and C Clifford (Theorem 7); and (iii) the number of gates in C_k up to phase is d^3(d^2-1)(d^{k-1}+d^{k-2}-d) for k>=2 (Corollary 2). The proof route is: semi-Cliffordness is shown equivalent to simplifiability (Theorem 4); a gate is semi-Clifford exactly when the Pauli supports of its conjugate pair lie in parallel lines (Theorem 5); and an induction using Lemmas 23 and 24 shows that every k-closed pair is jointly Clifford-conjugate to a pair of almost diagonal gates. The paper also provides a normal form for Clifford gates (Lemma 9) that is used in the main decomposition.

Significance. If correct, the result settles the classification problem for one-qudit Clifford hierarchies, gives the first exact count at every level, and extends the efficient magic-state teleportation protocol to all one-qudit hierarchy gates. The support-line characterization (Theorem 5) and the Clifford normal form (Lemma 9) are clean and likely useful beyond this paper. The proof architecture is coherent and largely self-contained, with prior work by Cui-Gottesman-Krishna and de Silva properly reused. However, the central induction contains two genuine gaps in the proof of Lemma 23, and a level-index error appears in Lemma 12; these are repairable, but they mean the main theorem is not fully established as printed.

major comments (3)
  1. [Section 4.4, Lemma 23] In the branch where C is in D_2N, the proof states 'if C in D_2N, by Lemma 22, C in D_2<X>.' This is not justified: Lemma 22 requires an element of D_k N of order d, and C alone is not shown to have order d. The step can be repaired by applying Lemma 22 to the product DC, which lies in D_k N because D is in D_k and C is in D_2N, and which has order d because it is Clifford-conjugate to G. As printed, this is a gap in the inductive engine that proves Theorem 6.
  2. [Section 4.4, Lemma 23, after Eq. (47)] The assertion that U is in D_{k-1}<X> does not follow from the displayed computation U = omega^c Z^p (D X^q D*); the computation only places U in D_k<X> up to phase. To obtain D_{k-1}<X> one must additionally use that U is in C_{k-1} (because (U,V) is (k-1)-closed) and that C_{k-1} is closed under right multiplication by Clifford gates, or else weaken the claim to 'the Pauli support of U is horizontal,' which is all the subsequent argument requires. This missing justification is load-bearing because the proof uses the uniqueness of the horizontal line L_U.
  3. [Section 4.2, Lemma 12] The proof of Lemma 12 says that Lemma 8 ensures both elements of the pair corresponding to DC are in D_{k-1}<X>, but for G in C_{k+1} and D in D_{k+1} the correct conclusion is D_k<X>: the pair elements lie in C_k by (k-1)-closedness and in D_{k+1}<X> by the diagonal-times-X form, so their intersection is D_k<X>. This is an off-by-one error in the proof of the semi-Clifford/simplifiability equivalence; the intended argument is clear, but the printed proof should be corrected.
minor comments (3)
  1. [Section 4.5, Theorem 7] The proof refers to 'Corollary 5'; the intended reference is Theorem 5, as there is no Corollary 5 in the paper.
  2. [Abstract / Theorem 6] Theorem 6 is stated only for odd primes d, while the abstract and title also claim the qubit case; the paper should explicitly state that the qubit case is covered by the prior result of Zeng-Chen-Chuang [35] and indicate how the normal form and count extend to d=2.
  3. [Section 4.4, Lemma 21] The opening sentence of the proof of Lemma 21 is imprecise: from 'C has order d' it does not immediately follow that [C] has order d, since a scalar multiple of the identity is a counterexample. The intended argument can be made precise by first disposing of scalar gates and then noting that a non-scalar Clifford gate of order d has projective order d.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the induction proving all one-qudit hierarchy gates are semi-Clifford derives from independent published structure theorems, with the target claim nowhere assumed as an input.

full rationale

The paper's central claim (Theorem 6) is proved by induction on the hierarchy level using Lemma 23 and Lemma 24. Lemma 23 assumes only the inductive hypothesis that the preceding level consists of semi-Clifford gates and derives a Clifford-conjugacy statement for order-d gates whose square lies in the preceding level; this is not the conclusion being proved for the current level. Lemma 24 is explicitly independent of that inductive hypothesis and converts individual Clifford-conjugacy to D_k⟨X⟩ into simplifiability. The proof therefore does not assume 'all gates are semi-Clifford' in order to prove 'all gates are semi-Clifford'. The load-bearing external inputs are Neuhauser's metaplectic representation, the Cui-Gottesman-Krishna classification of diagonal gates, and the first author's earlier conjugate-pair framework (Theorem 2). These are published, parameter-free structural results that do not contain the target statement; in particular, the prior work [12] proved only the third-level case and cannot supply the all-levels conclusion. The technical gaps identified in Lemma 23's proof (the order-d justification for applying Lemma 22, and the missing commutation fact after Eq. (47)) are correctness risks that may require repair, but they are not instances of a claim reducing to its own inputs. No fitted parameters are renamed as predictions, and no uniqueness theorem is imported to force the paper's choice. Accordingly, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central claim rests on published classifications (diagonal hierarchy gates from Cui-Gottesman-Krishna, the conjugate-pair correspondence from de Silva, and Neuhauser's metaplectic representation) and on standard group theory (Sylow theorems). No free parameters are fitted and no new physical entities are postulated. The paper's own contribution is the structural proof and the counting formula built on these inputs.

assumptions (6)
  • standard math Discrete Stone-von Neumann theorem: every conjugate pair (U,V) with U^d = V^d = I and UV = ωVU is of the form (GZG*, GXG*) for a unique G up to phase.
    Invoked throughout as the bridge between gates and conjugate pairs; stated as Lemma 3 and used as the basis for Theorem 2's bijection.
  • domain assumption Bijection between (k+1)-level gates and k-closed conjugate pairs (Theorem 2, from de Silva [12]).
    Load-bearing for the induction in Theorem 6; the paper cites prior work rather than reproving it.
  • domain assumption Cui-Gottesman-Krishna classification of diagonal hierarchy gates: D_k = {D[ω_m^φ] | φ ∈ R_k}, so |D_k| = d^k (Theorem 3).
    Needed for the normal form and for the counting formula in Corollary 2; taken as a black box from [10].
  • domain assumption Neuhauser's explicit metaplectic representation of Sp(1,Z_d) (Theorem 1).
    Basis for the Clifford normal form in Lemma 9 and for the action on Pauli supports in Lemmas 19-20.
  • domain assumption Closure of the hierarchy under Clifford multiplication: C_2 C_k C_2 = C_k for k ≥ 2 (from [35]).
    Used in Lemma 8, Lemma 12, Lemma 23 and elsewhere to move gates between levels by multiplying with Clifford gates.
  • standard math Sylow theorems for finite groups.
    Used in Lemma 21 to show that order-d Clifford gates are Clifford-conjugate into D_2⟨X⟩.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Clifford hierarchy for one qubit or qudit." pith.science (2026). https://pith.science/paper/HQGEQKO3

@misc{pith2026250107939,
  author       = {Pith},
  title        = {Pith review of: The Clifford hierarchy for one qubit or qudit},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HQGEQKO3}},
  note         = {Machine review of arXiv:2501.07939}
}
abstract

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 groups of Pauli and Clifford gates constitute the first and second 'levels', respectively. Non-Clifford gates from the third level or higher, such as the $T$ gate, are necessary for achieving fault-tolerant universal quantum computation. Since it was defined twenty-five years ago by Gottesman-Chuang, two questions have been studied by numerous researchers. First, precisely which gates constitute the Clifford hierarchy? Second, which subset of the hierarchy gates admit efficient gate teleportation protocols? We completely solve both questions in the practically-relevant case of the Clifford hierarchy for gates of one qubit or one qudit of prime dimension. We express every such hierarchy gate uniquely as a product of three simple gates, yielding also a formula for the size of every level. These results are a consequence of our finding that all such hierarchy gates can be expressed in a certain form that guarantees efficient gate teleportation. Our decomposition of Clifford gates as a unique product of three elementary Clifford gates is of broad applicability.

Figures

Figures reproduced from arXiv: 2501.07939 by the authors.

Figure 1
Figure 1. The Pauli support of the linear combination [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. The compact gate teleportation protocol for semi-Clifford gates. [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. The Pauli support of a diagonal gate is contained in the linear subspace [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Proof of Theorem 5. The horizontal lines in the left diagram contain the Pauli supports of [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Symmetric Localizable Multipartite Quantum Measurements from Pauli Orbits

    quant-ph 2025-09 unverdicted novelty 7.0 of 10

    Generalizing the Elegant Joint Measurement, the authors construct symmetric, locally encodable entangled measurement bases as Pauli-group orbits and classify their entanglement-assisted local implementability by Cliff...

  2. Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits

    quant-ph 2025-06 conditional novelty 6.0 of 10

    For odd-prime qudit doped Clifford circuits, magic saturates at a universal value above a doping rate q_c(d), while OTOC-based chaos requires about twice that rate.

Reference graph

Works this paper leans on

36 extracted references · 35 canonical work pages · cited by 2 Pith papers

  1. [1]

    J. T. Anderson. On groups in the qubit Clifford hierarchy. Quantum, 8:1370, 2024. 1.1

    work page 2024

  2. [2]

    Anshu and S

    A. Anshu and S. Arunachalam. A survey on the complexity of learning quantum states. Nature Reviews Physics, 6(1):59–69, 2024. 5

    work page 2024

  3. [3]

    M. J. J. Barry. Large abelian subgroups of Chevalley groups. Journal of the Australian Mathematical Society, 27(1):59–87, 1979. 3.2

    work page 1979

  4. [4]

    Beigi and P

    S. Beigi and P. W. Shor. C3, semi-Clifford and generalized semi-Clifford operations. Quantum Information and Computation, 10(1):41–59, 2010. 1.1

    work page 2010

  5. [5]

    Bu and D

    K. Bu and D. E. Koh. Efficient classical simulation of Clifford circuits with nonstabilizer input states. Physical Review Letters, 123(17):170502, 2019. 5

    work page 2019

  6. [6]

    E. T. Campbell, H. Anwar, and D. E. Browne. Magic-state distillation in all prime dimensions using quantum Reed-Muller codes. Physical Review X, 2:041021, 2012. 5

    work page 2012

  7. [7]

    Chen and N

    I. Chen and N. de Silva. Characterising semi-Clifford gates using algebraic sets. Communications in Mathematical Physics, 405(9):201, 2024. 1.1, 3.2

    work page 2024

  8. [8]

    Y. Chi, J. Huang, Z. Zhang, J. Mao, Z. Zhou, X. Chen, C. Zhai, J. Bao, T. Dai, and H. Yuan. A programmable qudit-based quantum processor. Nature Communications, 13(1):1166, 2022. 5

    work page 2022

Show all 36 references
  1. [9]

    Chizzini, L

    M. Chizzini, L. Crippa, A. Chiesa, F. Tacchino, F. Petiziol, I. Tavernelli, P. Santini, and S. Carretta. Molecular nanomagnets with competing interactions as optimal units for qudit-based quantum computation. Physical Review Research, 4(4):043135, 2022. 5

    2022

  2. [10]

    S. X. Cui, D. Gottesman, and A. Krishna. Diagonal gates in the Clifford hierarchy. Physical Review A, 95(1):012329, 2017. 1.1, 2.7, 4.5, 4.5

    2017

  3. [11]

    de Oliveira, L

    M. de Oliveira, L. S. Barbosa, and E. F. Galv˜ ao. Quantum advantage in temporally flat measurement-based quantum computation. Quantum, 8:1312, 2024. 5 16

    2024

  4. [12]

    de Silva

    N. de Silva. Efficient quantum gate teleportation in higher dimensions. Proceedings of the Royal Society A, 2021. 1.1, 2, 2.4, 2.6, 2.7, 2.8, 3.2

    2021

  5. [13]

    Frembs, C

    M. Frembs, C. Okay, and H. Y. Chung. No quantum solutions to linear constraint systems in odd dimension from Pauli group and diagonal Cliffords. Quantum, 9:1583, 2025. 5

    2025

  6. [14]

    Frembs, S

    M. Frembs, S. Roberts, E. T. Campbell, and S. D. Bartlett. Hierarchies of resources for measurement-based quantum computation. New Journal of Physics, 25(1):013002, 2023. 5

    2023

  7. [15]

    Glaudell, N

    A. Glaudell, N. J. Ross, J. van de Wetering, and L. Yeh. Qutrit metaplectic gates are a subset of Clifford+ T . Proceedings TQC 2022., 2022. 5

    2022

  8. [16]

    Gottesman

    D. Gottesman. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology, Pasadena, CA, USA, 1997. 1

    1997

  9. [17]

    Gottesman and I

    D. Gottesman and I. L. Chuang. Quantum teleportation is a universal computational primitive. Nature, 402(6760):390–393, 1999. 1, 1.1, 2.6

    1999

  10. [18]

    D. Gross. Hudson’s theorem for finite-dimensional quantum systems. Journal of Mathematical Physics, 47(12):122107, 2006. 2.5

    2006

  11. [19]

    Z. He, L. Robitaille, and X. Tan. Permutation gates in the third level of the Clifford hierarchy. arXiv preprint arXiv:2410.11818,

    arXiv

  12. [20]

    Jochym-O’Connor and T

    T. Jochym-O’Connor and T. J. Yoder. Four-dimensional toric code with non-Clifford transversal gates. Physical Review Research, 3(1):013118, 2021. 5

    2021

  13. [21]

    Kar´ acsony, L

    M. Kar´ acsony, L. Oroszl´ any, and Z. Zimbor´ as. Efficient qudit based scheme for photonic quantum computing.arXiv:2302.07357,

    arXiv

  14. [22]

    Krishna and J.-P

    A. Krishna and J.-P. Tillich. Towards low overhead magic state distillation. Physical Review Letters, 123(7):070507, 2019. 5

    2019

  15. [23]

    P. J. Low, B. M. White, A. A. Cox, M. L. Day, and C. Senko. Practical trapped-ion protocols for universal qudit-based quantum computing. Physical Review Research, 2(3):033128, 2020. 5

    2020

  16. [24]

    Neuhauser

    M. Neuhauser. An explicit construction of the metaplectic representation over a finite field. Journal of Lie Theory, 12(1):15–30,

  17. [25]

    Pllaha, N

    T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank. Un-Weyl-ing the Clifford hierarchy. Quantum, 4:370, 2020. 1.1, 2.3

    2020

  18. [26]

    Pllaha, K

    T. Pllaha, K. Volanto, and O. Tirkkonen. Decomposition of Clifford gates. In 2021 IEEE Global Communications Conference, pages 01–06, 2021. 2.5, 1

    2021

  19. [27]

    Rengaswamy, R

    N. Rengaswamy, R. Calderbank, and H. D. Pfister. Unifying the Clifford hierarchy via symmetric matrices over rings. Physical Review A, 100(2):022304, 2019. 1.1

    2019

  20. [28]

    Ringbauer, M

    M. Ringbauer, M. Meth, L. Postler, R. Stricker, R. Blatt, P. Schindler, and T. Monz. A universal qudit quantum processor with trapped ions. Nature Physics, 18(9):1053–1057, 2022. 5

    2022

  21. [29]

    L. M. Seifert, J. Chadwick, A. Litteken, F. T. Chong, and J. M. Baker. Time-efficient qudit gates through incremental pulse re-seeding. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 304–313. IEEE, 2022. 5

    2022

  22. [30]

    P. W. Shor. Fault-tolerant quantum computation. In Proceedings of the 37th Conference on Foundations of Computer Science, pages 56–65. IEEE, 1996. 1

    1996

  23. [31]

    H. S. Tonchev and N. V. Vitanov. Quantum phase estimation and quantum counting with qudits. Physical Review A, 94(4):042307,

  24. [32]

    Wang, Z.-Q

    S. Wang, Z.-Q. Yin, H. Chau, W. Chen, C. Wang, G.-C. Guo, and Z.-F. Han. Proof-of-principle experimental realization of a qubit-like qudit-based quantum key distribution scheme. Quantum Science and Technology, 3(2):025006, 2018. 5

    2018

  25. [33]

    M. A. Webster, A. O. Quintavalle, and S. D. Bartlett. Transversal diagonal logical operators for stabiliser codes. New Journal of Physics, 25(10):103018, 2023. 5

    2023

  26. [34]

    L. Yeh. Scaling w state circuits in the qudit Clifford hierarchy. In Companion Proceedings of the 7th International Conference on the Art, Science, and Engineering of Programming, pages 90–100, 2023. 5

    2023

  27. [35]

    B. Zeng, X. Chen, and I. L. Chuang. Semi-Clifford operations, structure of Ck hierarchy, and gate complexity for fault-tolerant quantum computation. Physical Review A, 77(4):042313, 2008. 1, 1.1, 2.6, 2.8, 3.1, 4

    2008

  28. [36]

    X. Zhou, D. W. Leung, and I. L. Chuang. Methodology for quantum logic gate construction. Physical Review A, 62(5):052316,

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.