Flagging the Clifford hierarchy:~Fault-tolerant logical $\fracπ{2^l}$ rotations via measuring circuit gauge operators of non-Cliffords

Abstract

We provide a recursively defined sequence of flag circuits which will detect logical errors induced by non-fault-tolerant $R_{\overline{Z}}(\fracπ{2^l})$ gates on CSS codes with a fault distance of two. As applications, we give a family of circuits with $O(l)$ gates and ancillae which implement fault-tolerant logical $R_{Z}(\fracπ{2^l})$ or $R_{ZZ}(\fracπ{2^l})$ gates on any $[[k + 2, k, 2]]$ iceberg code and fault-tolerant circuits of size $O(l)$ for preparing $|\fracπ{2^l}\rangle$ resource states in the $[[7,1,3]]$ code, which can be used to perform fault-tolerant $R_{\overline{Z}}(\fracπ{2^l})$ rotations via gate teleportation, allowing for implementations of these gates that bypass the high overheads of gate synthesis when $l$ is small relative to the precision required. We show how the circuits above can be generalized to $π( x_0.x_{1}x_{2}\ldots x_{l}) = \sum_{j}^{l} π\frac{x_j}{2^j}$ rotations with identical overheads in $l$, which could be useful in quantum simulations where time is digitized in binary. Finally, we illustrate two approaches to increase the fault-distance of our construction. We show how to increase the fault distance of a Cliffordized version of the T gate circuit to $3$ in the Steane code and how to increase the fault-distance of the $\fracπ{2}$ iceberg circuit to $4$ through concatenation in two-level iceberg codes. This yields a targeted logical $R_{\overline{Z}}(\fracπ{2})$ gate with fault distance $4$ on any row of logical qubits in an $[[(k_2+2)(k_1+2), k_1k_2, 4]]$ code.

The paper asks whether flag measurements can detect logical faults in direct implementations of small-angle non-Clifford rotations, rather than synthesizing those rotations from Clifford+$T$ gates. It constructs recursive flag circuits by measuring generally non-Pauli circuit gauge operators: checking a rotation introduces controlled rotations with doubled angles, and the recursion terminates when the required operation admits a fault-tolerant implementation. For $[[k+2,k,2]]$ iceberg codes, the construction implements logical $R_Z(\pi/2^l)$ and $R_{ZZ}(\pi/2^l)$ with $O(l)$ gates, ancillas, and depth. Its fault distance is two: any single circuit fault producing a logical error is detected by flags or subsequent syndrome measurements. The same asymptotic overhead applies to angles specified by $l$ binary fractional digits. A CSS-code generalization gives postselected $|\pi/2^l\rangle$ resource-state preparation in the Steane code with $O(p^2)$ failure probability. Recursive fault-propagation arguments and state-vector simulations support the constructions. For Steane-code $|\pi/8\rangle$ preparation, a reported simulation achieves approximately $4\times10^{-6}$ logical infidelity with five physical ancillas and 86% acceptance. The simulations use two-qubit depolarizing noise and measurement errors; the synthesis comparison is described as simplistic. The overhead advantage concerns direct access to physical rotations and avoids synthesis approximation error, not physical gate noise. Higher fault distance is demonstrated only for Clifford versions: repeated gauge measurements yield distance three in the Steane code, and iceberg concatenation yields distance four, checked using Stim. Extending and verifying the non-Clifford constructions at higher distance remains open; direct state-vector simulation becomes prohibitive.