On Groups in the Qubit Clifford Hierarchy

Abstract

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.

32 pages, 2 figures

References in corpus (22)

• Quantum Teleportation is a Universal Computational Primitive
• Decoherence Free Subspaces for Quantum Computation
• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Black holes as mirrors: quantum information in random subsystems
• Noiseless Quantum Codes
• Restrictions on Transversal Encoded Quantum Gate Sets
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Magic state distillation with low overhead
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Diagonal gates in the Clifford hierarchy
• A method to find quantum noiseless subsystems
• The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
• Semi-Clifford operations, structure of ${\mathcal{C}}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
• Learning efficient decoders for quasi-chaotic quantum scramblers
• The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases
• A four-dimensional toric code with non-Clifford transversal gates
• Order 3 Symmetry in the Clifford Hierarchy
• Approximate symmetries and quantum error correction
• Efficient quantum gate teleportation in higher dimensions
• Symmetries and entanglement of stabilizer states
• Hierarchies of resources for measurement-based quantum computation

Cited by in corpus (6)

• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
• Letting the tiger out of its cage: bosonic coding without concatenation
• Classification of the Subgroups of the Two-Qubit Clifford Group
• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
• Equivariant Machine Learning Decoder for 3D Toric Codes