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.
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer. We employ the group theoretical package GAP\cite{GAP} for simulating the two qubit Clifford group
C2. We already found that the symmetric group S(6), aka the automorphism group of the generalized quadrangle W(2), controls the geometry of the two-qubit Pauli graph \cite{Pauligraphs}. Now we find that the {\it inner} group
Inn(C2)=C2/Center(C2) exactly contains two normal subgroups, one isomorphic to
Z2×4 (of order 16), and the second isomorphic to the parent
A′(6) (of order 5760) of the alternating group A(6). The group
A′(6) stabilizes an {\it hexad} in the Steiner system
S(3,6,22) attached to the Mathieu group M(22). Both groups A(6) and
A′(6) have an {\it outer} automorphism group
Z2×Z2, a feature we associate to two-qubit quantum entanglement.
The Clifford hierarchy plays a crucial role in the stabilizer formalism of quantum error correction and quantum computation. Apart form the zeroth level (the discrete Heisenberg–Weyl group) and the first level (the Clifford group), all other levels of the Clifford hierarchy are not groups. However, the diagonal gates at all levels do form groups, and it is desirable to characterize their generators and structures. In this paper, we study the diagonal gates at the second level of the Clifford hierarchy. For this, we introduce the notion of a
T -gate in an arbitrary dimension, generalizing the corresponding notion in prime dimensions. By the use of the
T -gate, we are able to completely characterize the group structures of the diagonal gates at the second level of the Clifford hierarchy in any (not necessarily prime) dimension. It turns out that the classification depends crucially on the number-theoretic nature of the dimension. The results highlight the special role of the first two primes,
2 and
3 , in the prime factorization of the dimension. The
T -gate in an arbitrary dimension, apart from its key role as a generator of the diagonal gates, may have independent interest and further applications in quantum theory.
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 26 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.
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.