We develop a simple and systematic route to higher levels of the qubit Clifford hierarchy by coherently controlling Clifford operations. Our approach is based on Pauli periodicity, defined for a Clifford unitary $U$ as the smallest integer $m\ge 1$ such that $U^{2^{m}}$ is a Pauli operator up to phase. We prove a sharp controlled-jump rule showing that the controlled gate $CU$ lies strictly in level $m+2$ of the hierarchy, and equivalently that $CU$ lies in level $k$ if $U^{2^{k-2}}$ is Pauli while no smaller positive power of $U$ is Pauli. We further quantify the resources required to realize large level jumps in the Clifford hierarchy by proving an essentially tight upper bound on Pauli periodicity as a function of the number of qubits, which implies that accessing high hierarchy levels through controlled Cliffords requires a number of target qubits that grows exponentially with the desired level. We complement this limitation with explicit infinite families of Pauli-periodic Cliffords whose controlled versions achieve asymptotically optimal jumps. As an application, we propose a protocol for preparing logical catalyst states that enable logical $Z^{1/2^k}$ phase gates via phase kickback from a single jumped Clifford.
We develop a simple and systematic route to higher levels of the qubit Clifford hierarchy by coherently controlling Clifford operations. Our approach is based on Pauli periodicity, defined for a Clifford unitary U as the smallest integer m≥1 such that U2m is a Pauli operator up to phase. We prove a sharp controlled-jump rule showing that the controlled gate CU lies strictly in level m+2 of the hierarchy, and equivalently that CU lies in level k if U2k−2 is Pauli while no smaller positive power of U is Pauli. We further quantify the resources required to realize large level jumps in the Clifford hierarchy by proving an essentially tight upper bound on Pauli periodicity as a function of the number of qubits, which implies that accessing high hierarchy levels through controlled Cliffords requires a number of target qubits that grows exponentially with the desired level. We complement this limitation with explicit infinite families of Pauli-periodic Cliffords whose controlled versions achieve asymptotically optimal jumps. As an application, we propose a protocol for preparing logical catalyst states that enable logical Z1/2k phase gates via phase kickback from a single jumped Clifford.
Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pauli stabilizer phases appear as intermediate codes. We introduce the XCd(k) stabilizer formalism, which generalizes the Pauli stabilizer formalism by combining Pauli-X operators with diagonal operators drawn from a fixed level k of the Clifford hierarchy on prime-dimensional qudits. This yields a natural class of beyond-Pauli stabilizer models, including many twisted quantum double phases. We classify a large class of these XCd(k) stabilizer states, showing that they are uniform superpositions over affine-linear subspaces with diagonal phases. In particular, when the stabilizers of a state require operators from level k of the Clifford hierarchy, we show that the diagonal gates required to produce the phases in the wavefunction sit one level higher. We further show that every 2D twisted quantum double Dω(Zpn) with ω a product of type-III cocycles and p an odd prime admits a realization using only Clifford (k=2) stabilizers, and we conjecture that phases where ω contains a type-I or type-II cocycle require level-p Clifford-hierarchy stabilizers for p-dimensional qudits. Finally, we demonstrate that a pair of qudit toric codes may be deterministically prepared in a logical magic state by measuring XCd(k) stabilizers. Together, these results provide a concrete stabilizer framework for topological codes beyond Pauli stabilizer models and their logical gates.
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.
We present an entirely 2D constant-depth realization of topologically protected phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double D(G) of a non-Abelian group G on a triangular spatial patch. The logical gate is implemented by a constant-depth circuit constructed from stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle and boundary counter-terms. The Bravyi-König theorem limits the unitary gates implementable by constant-depth quantum circuits on Pauli stabilizer codes in D dimensions to the D-th level of the Clifford hierarchy. We bypass this limitation, by constructing constant-depth unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, at the cost of using the quantum double of a non-Abelian group G. Specifically, for G=D4N, the dihedral group of order 8N, we realize the phase gate T1/N=diag(1,eiπ/(4N)) in the logical Z basis. In this context, we propose a non-abelian stabilizer group formalism, which we work out for dihedral groups. For 8N=2n, the logical gate lies at the n-th level of the Clifford hierarchy and, importantly, has a qubit-only realization: we show that it can be constructed in terms of Clifford-hierarchy stabilizers for a code with n physical qubits on each edge of the lattice. We also discuss code-switching to the double surface-code D(Z2×Z2), to complete a universal gate-set in this setup.
The Clifford hierarchy plays a central role in fault-tolerant quantum computation, but its higher levels remain only partially understood. Recent work on quantum higher order Fourier analysis characterizes membership in the Clifford hierarchy using quantum derivatives, but does not provide an explicit description of the individual levels. In this work, we address this problem by showing that the collection of quantum derivatives of a unitary operator forms a non-abelian 1-cocycle, and conversely that every such 1-cocycle arises from a unitary operator. This yields a recursive cohomological characterization of the Clifford hierarchy. We then specialize this framework to the third level and decompose the cocycle data into symplectic, affine, and phase components, each admitting a cohomological interpretation. As applications, we give a new proof that every two-qudit gate in the third level of the Clifford hierarchy is semi-Clifford, and prove for the first time that every three-qudit gate in the third level is semi-Clifford.
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 Ck(n) is semi-Clifford if and only if k≤2, n≤2, or k=3 and n≤6. We also establish that Ck(n) is generalized semi-Clifford when k≤4 or n≤3 and construct counterexamples when k,n≥5. For n=4 and k≥5, we show that every gate defined over 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) is generalized semi-Clifford if and only if k≤4 or n≤4. Lastly, we go beyond this structure by introducing nc-generalized semi-Clifford gates, which we show are exactly the gates of the form ∑x∣π(x)⟩⟨x∣⊗Vx up to Clifford gates on both sides, where π permutes the computational basis states of nc control qubits. We conjecture that for k≥3 every gate in Ck(n) has this form for some nc≥1 with every Vx∈Ck−3(n−nc), refining the conjecture of Zeng, Chen, and Chuang.
We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing. This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations, providing a tool for the discovery of new logical gates. In particular, we define the chain map hierarchy: a family of chain complexes whose homology classes encode logical unitary and code surgery operations at any level of the Clifford hierarchy, precisely analogous to the chain complex description of Pauli logicals. Consequently, intuition for Pauli logicals can be leveraged to discover new logical operations on qLDPC codes. For instance, the familiar ability to deform Pauli logicals with stabilizers---i.e. boundaries of the chain complex---becomes a way to search for constant-depth unitary implementations of (non-)Clifford logical gates. Using this strategy, we discover constant-depth unitary implementations of the full logical Clifford group on any number of blocks of the 2D toric code, including within a single block, and addressable logical CCZ gates on any triple of logical qubits on any number of blocks of the 3D toric code. Beyond manifold codes, we find addressable non-Clifford gates on codes with many encoded qubits. The chain map hierarchy naturally encompasses and extends other constructions of logical gadgets, for instance providing a universal parameterization of cup products. As such, our work provides a unified, useful, and intuitive language for computing with qLDPC codes.