Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Characterization of permutation gates in the third level of the Clifford hierarchy

Zhiyang He, Luke Robitaille, Xinyu Tan

TL;DR

This work provides a complete structural characterization of permutation gates in the third level of the Clifford hierarchy by linking staircase-form Toffoli products to descending multiplications over $\mathbb{F}_2^n$. It constructs an infinite family $\{U_k\}_{k\ge3}$ with $U_k\in\mathcal{C}_3$ but $U_k^{-1}\notin\mathcal{C}_k$, and proves a tight qubit lower bound of $n\ge 2^k-1$ whenever a degree-$k$ monomial appears in the polynomial representation. The results disprove Anderson’s conjectures on the structure and inverses of $\mathcal{C}_3$ permutation gates and sharpen the understanding of generalized semi-Clifford decomposition within the Clifford hierarchy. Together, these contributions illuminate a new design space for fault-tolerant gate synthesis and could influence resource-state requirements in gate-teleportation-based FTQC strategies, with potential extensions to higher levels of the hierarchy.

Abstract

The Clifford hierarchy is a fundamental structure in quantum computation whose mathematical properties are not fully understood. In this work, we characterize permutation gates -- unitaries which permute the $2^n$ basis states -- in the third level of the hierarchy. We prove that any permutation gate in the third level must be a product of Toffoli gates in what we define as \emph{staircase form}, up to left and right multiplications by Clifford permutations. We then present necessary and sufficient conditions for a staircase form permutation gate to be in the third level of the Clifford hierarchy. As a corollary, we construct a family of non-semi-Clifford permutation gates $\{U_k\}_{k\geq 3}$ in staircase form such that each $U_k$ is in the third level but its inverse is not in the $k$-th level.

Characterization of permutation gates in the third level of the Clifford hierarchy

TL;DR

This work provides a complete structural characterization of permutation gates in the third level of the Clifford hierarchy by linking staircase-form Toffoli products to descending multiplications over . It constructs an infinite family with but , and proves a tight qubit lower bound of whenever a degree- monomial appears in the polynomial representation. The results disprove Anderson’s conjectures on the structure and inverses of permutation gates and sharpen the understanding of generalized semi-Clifford decomposition within the Clifford hierarchy. Together, these contributions illuminate a new design space for fault-tolerant gate synthesis and could influence resource-state requirements in gate-teleportation-based FTQC strategies, with potential extensions to higher levels of the hierarchy.

Abstract

The Clifford hierarchy is a fundamental structure in quantum computation whose mathematical properties are not fully understood. In this work, we characterize permutation gates -- unitaries which permute the basis states -- in the third level of the hierarchy. We prove that any permutation gate in the third level must be a product of Toffoli gates in what we define as \emph{staircase form}, up to left and right multiplications by Clifford permutations. We then present necessary and sufficient conditions for a staircase form permutation gate to be in the third level of the Clifford hierarchy. As a corollary, we construct a family of non-semi-Clifford permutation gates in staircase form such that each is in the third level but its inverse is not in the -th level.

Paper Structure

This paper contains 24 sections, 52 theorems, 42 equations, 4 figures.

Table of Contents

  1. Introduction
  2. Main results and techniques
  3. Future directions
  4. Prior works
  5. Organization
  6. Preliminaries
  7. Gates in the Clifford hierarchy
  8. Polynomial representations of permutations
  9. Anderson's conjectures
  10. Staircase form representations of C₃ permutations
  11. Reducing C₃ permutations
  12. Proof of Theorem 3.2
  13. A consequence of Theorem 3.2
  14. Descending multiplications
  15. Helper lemmas
  16. ...and 9 more sections

Key Result

Lemma 2.4

An operator $U$ is semi-Clifford if and only if there exist maximal abelian subgroups $A_1$ and $A_2$ of $\mathcal{P}_n$ such that $UA_1U^{\dagger} = A_2$. An operator $U$ is generalized semi-Clifford if and only if there exist maximal abelian subgroups $A_1$ and $A_2$ of $\mathcal{P}_n$ such that $

Figures (4)

  • Figure 1: A permutation gate in staircase form, consisting of $6$ Toffoli gates.
  • Figure 2: Circuit diagram for the Gottesman--Mochon seven-qubit gate $G$ (with time flowing from left to right).
  • Figure 3: This circuit for $\mathrm{TOF}_{1,2,4}\mathrm{TOF}_{1,3,4}\mathrm{TOF}_{1,2,3}$ is in staircase form but not mismatch-free, as qubit $3$ is used as a control for $\mathrm{TOF}_{1,3,4}$ and a target for $\mathrm{TOF}_{1,2,3}$.
  • Figure 4: The non-semi-Clifford permutation gate $U_3\in \mathcal{C}_3$.

Theorems & Definitions (109)

  • Remark 1.1
  • Definition 2.1: The Clifford hierarchy
  • Definition 2.3: Semi-Clifford and generalized semi-Clifford gates
  • Lemma 2.4
  • Proposition 2.5: Semi-Clifford gates are closed under taking inverses
  • proof
  • Lemma 2.6
  • proof
  • Theorem 2.7
  • Conjecture 2.8
  • ...and 99 more