Climbing the Clifford Hierarchy

arXiv:2603.12088 · quant-ph · Submitted 2026-03-12 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: We're looking at the paper: "Climbing the Clifford Hierarchy".

Mira: Here's the gist of the paper. The Clifford hierarchy is studied to understand how gates in this structure can be "climbed" to higher levels, which is central to fault-tolerant quantum computation The paper explores whether techniques used for the diagonal part of the hierarchy can be generalized to explore the entire hierarchy Climbing Mechanisms The authors investigate gates whose square roots climb to the next level, specifically fully characterizing Clifford gates whose square roots climb to the third level The study focuses on determining conditions under which a Hermitian gate U in C(k) has its square root Ub in C(k+1) They examine the action of Ub on a Pauli gate P to determine if UPb Ub† belongs to the level below, which yields conditions for Ub ∈ C(k+1) Necessary Conditions and Examples The paper establishes necessary conditions for Hermitian gates U ∈ C(k) such that Ub ∈ C(k+1) in Theorem 3.3 It shows that if UEU = E′ for some anticommuting Hermitian Pauli gates E, E′, then Ub cannot be in C(k+1) Examples are used to illustrate these conditions, such as the Hadamard gate H not satisfying Hb ∈ C(3) Furthermore, the paper shows that CNOT gates and controlled-Z gates climb the hierarchy Characterization of Third Level Gates The authors fully characterize Hermitian Clifford gates that climb to the third level in Theorems 4.9 and 4.12 For diagonal Clifford gates, Theorem 4.6 provides conditions for Cb ∈ C(3) when FC is a hyperbolic involution with dim(Res(FC)) = 2 Permutation Clifford gates are also characterized in Corollary 4.15 Lifting to Higher Levels The paper demonstrates that the square root of a controlled Clifford gate climbs to the fourth level provided the original gate climbs to the third level Theorem 5.3 shows that if C ∈ C(2) is a Hermitian Clifford gate such that Cb ∈ C(3), then U = C(C) satisfies Ub ∈ C(4) This lifting behavior is shown for products of Toffoli gates under specific conditions The ultimate goal involves determining conditions for the square root of a Hermitian gate to belong to C(k+m-1) Future Research Directions Future research directions include determining if the square root of a Hermitian Clifford gate is again in the hierarchy, as basic gates like H are not Exploring conditions for a third level permutation gate to climb to the fourth level is suggested The ultimate goal would be to obtain an analogous result with Theorem 2.2 that holds for the diagonal part of the hierarchy The paper also considers general roots sqm(U) and related problems The acknowledgment notes that most work was performed during the REUSite Program at USF.

Kai: The main goal of this paper is to study the Clifford hierarchy In this paper, we primarily focus on gates in the Clifford hierarchy whose square roots climb one level higher In particular, we completely characterize Clifford gates whose square roots climb to the third level Additionally, we show that the controlled versions of the aforementioned Clifford gates climb to the fourth level, mimicking the behavior of diagonal gates Based on this work and experimental data, it is cautiously optimistic that our approach will lead to a complete understanding of the fourth level of the Clifford hierarchy as well as shed bright light into the entire hierarchy.

Mira: The paper concludes by pointing out promising future directions for exploring lifting the Clifford group and lifting the third level The references provided support this investigation into the structure of gates in this context.

Kai: References

1: S.

Paper summary: Kai: So, to wrap up "Climbing the Clifford Hierarchy," we've seen they focus on characterizing Hermitian Clifford gates whose square roots climb to the third level, and they also showed that controlled versions of those gates climb to the fourth level under specific conditions.

Mira: The authors are essentially testing if these climbing techniques, which worked for diagonal gates earlier, can be generalized to explore the entire hierarchy beyond just that one part.

Lev: The paper suggests that while there's structure in how things climb up, they haven't found a simple rule for every possible gate to climb.

Kai: They point toward future research directions like determining if the square root of a Hermitian Clifford gate is again in the hierarchy, because basic gates like H aren't fitting the pattern yet.

Mira: And they also suggest exploring conditions for a third level permutation gate to climb to the fourth level, which shows there's still work left on lifting those specific types of gates.

Lev: So it’s not about finding one single answer, but about mapping out the possibilities and where the next investigations should be directed in this area.

Kai: This work gives us a detailed look at the structure of these gates and points toward understanding the whole hierarchy, which is promising for building more robust quantum systems.

Conclusion: Kai: So, we’ve been looking at how Clifford gates climb up these hierarchy levels, and now we’re hitting the conclusion of this paper, "Climbing the Clifford Hierarchy."

Mira: It seems like they’re trying to map out whether those climbing techniques they used for just one part of the structure actually cover everything.

Lev: They focused specifically on Hermitian gates whose square roots climb to level three, and then showed that controlled versions of those gates can jump up to level four.

Kai: The main point is that they’ve fully characterized these specific third-level gates, and they’ve shown a pattern for how the controlled ones climb higher too.

Mira: They are cautiously optimistic that this approach to lifting the hierarchy might give us a complete picture of that fourth level we haven't seen before.

Lev: But there are still some holes, like basic gates such as H not fitting this climbing behavior, so they point toward more research on those specific cases.

Kai: The implication is that if we can nail this lifting behavior for the third level and controlled gates to the fourth, it gives us a solid foundation to figure out the rest of the structure.

Mira: It feels like they’re setting up a way to understand how these quantum structures evolve, which is exactly what we need for building fault-tolerant systems.

Lev: The next step they suggest is figuring out if the square root of a Hermitian Clifford gate stays in the hierarchy again, that’s where we need to focus our next hardware tests.

University of South Florida · University of Tennessee at Chattanooga · University of Texas at Austin

quant-ph

Submitted: 2026-03-12

Updated: 2026-11-18

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 85/100

The gist: The Clifford hierarchy is studied to understand how gates in this structure can be "climbed" to higher levels…

Key concepts

Clifford Hierarchy
This is a mathematical structure used to classify quantum gates based on their complexity and how they relate to each other. It helps researchers understand the relationships between different types of quantum operations, which is crucial for designing fault-tolerant quantum computers.
Climbing Mechanisms
This refers to a specific process where applying certain operations (like taking the square root) causes a gate to move from one level in the hierarchy to a higher one. The paper focuses on identifying the precise conditions under which this 'climbing' happens for specific types of gates.
Hermitian Gate
A Hermitian gate is a type of quantum operation that has special mathematical properties, similar to how physical observables are represented. The study examines how these specific gates behave when their square roots are considered within the hierarchy.
Diagonal Clifford Gates
These are a subset of Clifford gates that have a specific structure related to diagonal matrices. The paper provides detailed conditions under which these diagonal gates can reach the third level of the hierarchy, linking them to hyperbolic involutions.

Terminology

Summary

The Clifford hierarchy is studied to understand how gates in this structure can be climbed to higher levels, which is central to fault-tolerant quantum computation The paper explores whether techniques used for the diagonal part of the hierarchy can be generalized to explore the entire hierarchy

Climbing Mechanisms

The authors investigate gates whose square roots climb to the next level, specifically fully characterizing Clifford gates whose square roots climb to the third level The study focuses on determining conditions under which a Hermitian gate U in C(k) has its square root Ub in C(k+1) They examine the action of Ub on a Pauli gate P to determine if UPb Ub† belongs to the level below, which yields conditions for Ub ∈ C(k+1)

Necessary Conditions and Examples

The paper establishes necessary conditions for Hermitian gates U ∈ C(k) such that Ub ∈ C(k+1) in Theorem 3.3 It shows that if UEU = E′ for some anticommuting Hermitian Pauli gates E, E′, then Ub cannot be in C(k+1) Examples are used to illustrate these conditions, such as the Hadamard gate H not satisfying Hb ∈ C(3) Furthermore, the paper shows that CNOT gates and controlled-Z gates climb the hierarchy

Characterization of Third Level Gates

The authors fully characterize Hermitian Clifford gates that climb to the third level in Theorems 4.9 and 4.12 For diagonal Clifford gates, Theorem 4. p. 7

Where the paper says it

Indeed, for v = (a, b), we have that ⟨ vFC | v ⟩s = ⟨(a, aA + b)|(a, b)⟩s = ab⊤ + aAa ⊤ + ba⊤ = aAa ⊤. Thus, for the case of diagonal Clifford gates, the necessary condition of being Hermitian is the same as the overall necessary condition of Theorem 4.

6 provides conditions for Cb ∈ C(3) when FC is a hyperbolic involution with dim(Res(FC)) = 2 Permutation Clifford gates are also characterized in Corollary 4. p. 8
Where the paper says it

Let C ∈ C(2) be a diagonal Clifford gate such that FC is a hyperbolic involution and dim(Res(FC)) = 2. Then Cb ∈ C(3) .

15

Lifting to Higher Levels

The paper demonstrates that the square root of a controlled Clifford gate climbs to the fourth level provided the original gate climbs to the third level Theorem 5.3 shows that if C ∈ C(2) is a Hermitian Clifford gate such that Cb ∈ C(3), then U = C(C) satisfies Ub ∈ C(4) This lifting behavior is shown for products of Toffoli gates under specific conditions The ultimate goal involves determining conditions for the square root of a Hermitian gate to belong to C(k+m-1)

Future Research Directions

Future research directions include determining if the square root of a Hermitian Clifford gate is again in the hierarchy, as basic gates like H are not Exploring conditions for a third level permutation gate to climb to the fourth level is suggested The ultimate goal would be to obtain an analogous result with Theorem 2.2 that holds for the diagonal part of the hierarchy The paper also considers general roots sqm(U) and related problems The acknowledgment notes that most work was performed during the REUSite Program at USF. p. 1

Where the paper says it

1Everything discussed in this paper also holds for exp(−iπU/4) = (I − iU)/ √ 2. 2Square roots of generic diagonal gates in the hierarchy still belong to the hierarchy but may climb multiple levels instead of one; see Example 4.

Conclusions

The main goal of this paper is to study the Clifford hierarchy In this paper, we primarily focus on gates in the Clifford hierarchy whose square roots climb one level higher In particular, we completely characterize Clifford gates whose square roots climb to the third level Additionally, we show that the controlled versions of the aforementioned Clifford gates climb to the fourth level, mimicking the behavior of diagonal gates Based on this work and experimental data, it is cautiously optimistic that our approach will lead to a complete understanding of the fourth level of the Clifford hierarchy as well as shed bright light into the entire hierarchy. The paper concludes by pointing out promising future directions for exploring lifting the Clifford group and lifting the third level The references provided support this investigation into the structure of gates in this context. p. 1

Where the paper says it

In Section 5, we focus on Hermitian third level gates, and determine sufficient conditions for climbing to the forth level. We end the paper with some conclusions and future directions in Section 6.

References

[1] S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Physical Review A—Atomic, Molecular, and Optical Physics, 70(5):052328, 2004

[2] J. T. Anderson On groups in the qubit Clifford hierarchy, Quantum, 8:1370, 2024

[3] J. T. Anderson and M. Weippert Controlled Gates in the Clifford Hierarchy, 2025

[4] S. Beigi and P. W. Shor C3, Semi-Clifford and Generalized Semi-Clifford Operations, Quantum Information and Computation, 10:0041–0059, 2010

[5] S. X. Cui, D. Gottesman, and A. p. 0

Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

Krishna Diagonal gates in the Clifford hierarchy, Physical Review A, 95(1):012329, 2017

[6] N. de Silva and O. Lautsch The Clifford hierarchy for one qubit or qudit, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 481(2324), 2025

[7] D. Gottesman The Heisenberg Representation of Quantum Computers, 1998

[8] D. Gottesman and I. p. 0

Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

L. Chuang Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature, 402(6760):390–393, 1999

[9] Z. He, L. Robitaille, and X. Tan Permutation gates in the third level of the Clifford hierarchy, 2024

[10] Z. He, L. Robitaille, and X. Tan Characterization of permutation gates in the third level of the Clifford hierarchy, 2025

[11] J. Hu, Q. Liang, and R. Calderbank Climbing the diagonal Clifford hierarchy, Academia Quantum, 2(4), 2025

[12] O. T. O’Meara Symplectic groups, volume 16 of Mathematical Surveys American Mathematical Society, Providence, R. p. 0

Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

I., 1978

[13] T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank Un-Weyl-ing the Clifford Hierarchy Quantum, 4:370, Dec. p. 0

Where the paper says it

Climbing the Clifford Hierarchy Luca Bastioni∗ Samuel Glandon† Tefjol Pllaha∗ Madison Stewart‡ Phillip Waitkevich∗ March 13, 2026 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.

2020

[14] T. Pllaha, K. Volanto, and O. Tirkkonen Decomposition of Clifford Gates In 2021 IEEE Global Communications Conference (GLOBECOM), pages 01–06, 2021

[15] N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister Logical Clifford Synthesis for Stabilizer Codes IEEE Transactions on Quantum Engineering, 1:1–17, 2020

[16] B. Zeng, X. Chen, and I. L. Chuang Semi-Clifford operations structure of Ck hierarchy and gate complexity for fault-tolerant quantum computation Physical Review A—Atomic, Molecular, and Optical Physics, 77(4):042313, 2008

[17] arXiv:2603.12088v1 [quant-ph] 12 Mar 2026

[1] S. Aaronson and D. Gottesman Improved simulation of stabilizer circuits Physical Review A—Atomic, Molecular, and Optical Physics, 70(5):052328, 2004

[2] J. T. Anderson On groups in the qubit Clifford hierarchy Quantum, 8:1370, 2024

[3] J. T. Anderson and M. Weippert Controlled Gates in the Clifford Hierarchy, 2025 https://arxiv. p. 1

Where the paper says it

(2) Show that CNOT gates climb the hierarchy. Essentially, this is a consequence of the fact that controlled-Z gates climb the hierarchy; see Remark 3.

org/abs/2410.04711

[4] S. Beigi and P. W. Shor C3, Semi-Clifford and Generalized Semi-Clifford Operations Quantum Information and Computation, 10:0041–0059, 2010

[5] S. X. Cui, D. Gottesman, and A. Krishna Diagonal gates in the Clifford hierarchy Physical Review A, 95(1):012329, 2017

[6] N. de Silva and O. Lautsch The Clifford hierarchy for one qubit or qudit Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 481(2324), 2025

[7] D. Gottesman The Heisenberg Representation of Quantum Computers, 1998 https://arxiv. p. 0

Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

org/abs/quant-ph/9807006

[8] D. Gottesman and I. L. Chuang Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations Nature, 402(6760):390–393, 1999

[9] Z. He, L. Robitaille, and X. Tan Permutation gates in the third level of the Clifford hierarchy, 2024 https://arxiv. p. 0

Where the paper says it

Climbing the Clifford Hierarchy Luca Bastioni∗ Samuel Glandon† Tefjol Pllaha∗ Madison Stewart‡ Phillip Waitkevich∗ March 13, 2026 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.

org/abs/2410.11818

[10] Z. He, L. Robitaille, and X. Tan Characterization of permutation gates in the third level of the Clifford hierarchy, 2025 https://arxiv. p. 0

Where the paper says it

Climbing the Clifford Hierarchy Luca Bastioni∗ Samuel Glandon† Tefjol Pllaha∗ Madison Stewart‡ Phillip Waitkevich∗ March 13, 2026 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.

org/abs/2510.04993

[11] J. Hu, Q. Liang, and R. Calderbank Climbing the diagonal Clifford hierarchy Academia Quantum, 2(4), 2025

[12] O. T. O’Meara Symplectic groups volume 16 of Mathematical Surveys American Mathematical Society Providence, R. p. 0

Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

p. 0
Where the paper says it

In particular, we fully characterize Clifford gates whose square roots climb to the third level. Keywords: Clifford hierarchy, Pauli group, Clifford group, fault-tolerant computation 1 Introduction and Motivation The Clifford hierarchy, introduced in 1999 by Gottesman and Chuang [8], is a mathematical structure that plays a central role in fault-tolerant quantum-computation.

I., 1978

[13] T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank Un-Weyl-ing the Clifford Hierarchy Quantum, 4:370 Dec. p. 0

Where the paper says it

Climbing the Clifford Hierarchy Luca Bastioni∗ Samuel Glandon† Tefjol Pllaha∗ Madison Stewart‡ Phillip Waitkevich∗ March 13, 2026 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.

p. 0
Where the paper says it

Climbing the Clifford Hierarchy Luca Bastioni∗ Samuel Glandon† Tefjol Pllaha∗ Madison Stewart‡ Phillip Waitkevich∗ March 13, 2026 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.

p. 0
Where the paper says it

Climbing the Clifford Hierarchy Luca Bastioni∗ Samuel Glandon† Tefjol Pllaha∗ Madison Stewart‡ Phillip Waitkevich∗ March 13, 2026 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.

2020

[14] T. Pllaha, K. Volanto, and O. Tirkkonen Decomposition of Clifford Gates In 2021 IEEE Global Communications Conference (GLOBECOM), pages 01–06, 2021

[15] N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister Logical Clifford Synthesis for Stabilizer Codes IEEE Transactions on Quantum Engineering, 1:1–17, 2020

[16] B. Zeng, X. Chen, and I. L. Chuang Semi-Clifford operations structure of Ck hierarchy and gate complexity for fault-tolerant quantum computation Physical Review A—Atomic, Molecular, and Optical Physics, 77(4):042313, 2008

[17] arXiv:2603.12088v1 [quant-ph] 12 Mar 2026

[5] S. X. Cui, D. Gottesman, and A. Krishna Diagonal gates in the Clifford hierarchy Physical Review A, 95(1):012329, 2017

[8] D. Gottesman and I. L. Chuang Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations Nature, 402(6760):390–393, 1999

[12] O. T. O’Meara Symplectic groups volume 16 of Mathematical Surveys American Mathematical Society Providence, R.I., 1978

[13] T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank Un-Weyl-ing the Clifford Hierarchy Quantum, 4:370 Dec. 2020

[14] T. Pllaha, K. Volanto, and O. Tirkkonen Decomposition of Clifford Gates In 2021 IEEE Global Communications Conference (GLOBECOM), pages 01–06, 2021

[15] N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister Logical Clifford Synthesis for Stabilizer Codes IEEE Transactions on Quantum Engineering, 1:1–17, 2020

[16] B. Zeng, X. Chen, and I. L. Chuang Semi-Clifford operations structure of Ck hierarchy and gate complexity for fault-tolerant quantum computation Physical Review A—Atomic, Molecular, and Optical Physics, 77(4):042313, 2008

[17] arXiv:2603.12088v1 [quant-ph] 12 Mar 2026

[5] S. X. Cui, D. Gottesman, and A. Krishna Diagonal gates in the Clifford hierarchy Physical Review A, 95(1):012329, 2017

[8] D. Gottesman and I. L. Chuang Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations Nature, 402(6760):390–393, 1999

[12] O. T. O’Meara Symplectic groups volume 16 of Mathematical Surveys American Mathematical Society Providence, R.I., 1978

[13] T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank Un-Weyl-ing the Clifford Hierarchy Quantum, 4:370 Dec. 2020

[14] T. Pllaha, K. Volanto, and O. Tirkkonen Decomposition of Clifford Gates In 2021 IEEE Global Communications Conference (GLOBECOM), pages 01–06, 2021

[15] N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister Logical Clifford Synthesis for Stabilizer Codes IEEE Transactions on Quantum Engineering, 1:1–17, 2020

[16] B. Zeng, X. Chen, and I. L. Chuang Semi-Clifford operations structure of Ck hierarchy and gate complexity for fault-tolerant quantum computation Physical Review A—Atomic, Molecular, and Optical Physics, 77(4):042313, 2008

[17] arXiv:2603.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Enhanced fault-tolerant quantum computation by fully characterizing Clifford gates whose square roots climb to the third level, as shown in Theorem 4.9, allowing for a deeper understanding of implementation difficulty levels.

  2. Ability to determine under what conditions a Hermitian gate U in level k has its square root Ub in level k+1 by examining the action of Ub on Pauli gates using equation (1).

  3. Capability to classify diagonal Clifford gates that climb to the third level based on whether their associated symplectic matrix FC is hyperbolic, as detailed in Theorem 4.6 and Corollary 4.14.

  4. Design of quantum circuits where controlled versions of specific Clifford gates climb to the fourth level by utilizing Theorem 5.3, for instance, when U = C(C) and C is a Hermitian Clifford gate such that Cb is in level three.

  5. Understanding of the behavior of square roots like sqm(U), which can be related to the general problem of determining conditions under which sqm(U) in level k+m-1 holds for a Hermitian gate U in level k, as suggested by Problem 2 and 3.

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 this paper, we primarily focus on Hermitian gates, and in particular, we fully characterize Hermitian Clifford gates whose square roots climb to the third level.

Sources

Related papers