Semi-Clifford operations, structure ofCkhierarchy, and gate complexity for fault-tolerant quantum computation
Teleportation is a crucial element in fault-tolerant quantum computation and\na complete understanding of its capacity is very important for the practical\nimplementation of optimal fault-tolerant architectures. It is known that\nstabilizer codes support a natural set of gates that can be more easily\nimplemented by teleportation than any other gates. These gates belong to the so\ncalled $\\mathcal{C}_k$ hierarchy introduced by Gottesman and Chuang (Nature\n\\textbf{402}, 390). Moreover, a subset of $\\mathcal{C}_k$ gates, called\nsemi-Clifford operations, can be implemented by an even simpler architecture\nthan the traditional teleportation setup (Phys. Rev. \\textbf{A62}, 052316).\nHowever, the precise set of gates in $\\mathcal{C}_k$ remains unknown, even for\na fixed number of qubits $n$, which prevents us from knowing exactly what\nteleportation is capable of. In this paper we study the structure of\n$\\mathcal{C}_k$ in terms of semi-Clifford operations, which send by conjugation\nat least one maximal abelian subgroup of the $n$-qubit Pauli group into another\none. We show that for $n=1,2$, all the $\\mathcal{C}_k$ gates are semi-Clifford,\nwhich is also true for $\\{n=3,k=3\\}$. However, this is no longer true for\n$\\{n>2,k>3\\}$. To measure the capability of this teleportation primitive, we\nintroduce a quantity called `teleportation depth', which characterizes how many\nteleportation steps are necessary, on average, to implement a given gate. We\ncalculate upper bounds for teleportation depth by decomposing gates into both\nsemi-Clifford $\\mathcal{C}_k$ gates and those $\\mathcal{C}_k$ gates beyond\nsemi-Clifford operations, and compare their efficiency.\n
Read more