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