[论文解读] Climbing the Clifford Hierarchy

Luca Bastioni, Samuel Glandon+3 more|arXiv (Cornell University)|Mar 12, 2026

Quantum Computing Algorithms and Architecture被引用 0

一句话总结

本文分析了Clifford层级中 Hermitian 门的平方根在何时跃升到下一层，完整表征其平方根达到第三层的 Clifford 门，并表明受控版本可以达到第四层。

ABSTRACT

The Clifford Hierarchy has been a central topic in quantum computation due to its strong connections with fault-tolerant quantum computation, magic state distillation, and more. Nevertheless, only sections of the hierarchy are fully understood, such as diagonal gates and third level gates. The diagonal part of the hierarchy can be climbed by taking square roots and adding controls. Similarly, square roots of Pauli gates (first level) are Clifford gates (climb to the second level). Based on this theme, we study gates whose square roots climb to the next level. In particular, we fully characterize Clifford gates whose square roots climb to the third level.

研究动机与目标

• Motivate the study of the Clifford hierarchy and the role of diagonal gates in climbing the hierarchy.
• Define square roots of Hermitian gates and establish a framework to determine when bU ∈ C(k+1).
• Characterize Hermitian Clifford gates whose square roots climb to the third level.
• Investigate whether controlled versions of these gates climb to the fourth level.

提出的方法

• Define bU = exp(iπU/4) and analyze its action on Pauli gates via bUPbU† to determine level climbing.
• Use the Hermitian and Pauli-commutation structure of Clifford gates, along with symplectic representations, to derive necessary conditions for bU to climb.
• Leverage Clifford transvections and hyperbolic symplectic matrices to characterize when Hermitian Clifford gates climb to C(3).
• Extend the analysis to Hermitian third-level gates to identify conditions for climbing to C(4).
• Provide explicit examples (CNOT, SWAP, Toffoli products) to illustrate lifting behavior and to validate the theory.

实验结果

研究问题

• RQ1 Under what conditions does the square root bU of a Hermitian gate U ∈ C(k) belong to C(k+1)?”

主要发现

• Derived necessary conditions for Hermitian gates U ∈ C(k) with bU ∈ C(k+1).
• Proved that CNOT gates climb the hierarchy and clarified conjugation behavior.
• Fully characterized Hermitian Clifford gates that climb to the third level (Theorems 4.9 and 4.6).
• Established sufficient conditions for Hermitian third-level gates to climb to the fourth level (Theorem 5.3).
• Showed that diagonal Clifford gates with hyperbolic symplectic images and certain residue dimensions climb to the third level (Corollaries and Theorems in Section 4).
• Demonstrated that products of certain Toffoli gates can lift to the fourth level via the square-root construction (Examples 5.4).