Theory and Architecture of Syndrome-Resolved Logical Gates

Abstract

We introduce a general framework for weak transversal gates, namely syndrome-resolved implementation of logical unitaries realized by local physical unitaries, and demonstrate its wide impact in three applications: partial fault-tolerant architecture, short-depth state preparation, and magic state distillation. Our theoretical contribution is to prove a sufficient condition for a general Calderbank-Shor-Steane code to admit weak transversal gates, and to present an efficient algorithm to determine the physical multiqubit Pauli rotations. To demonstrate the practicality of weak transversal gates in the near future, we propose a partially fault-tolerant Clifford+$ϕ$ architecture that implements in-place Pauli rotations via a repeat-until-success strategy. Numerical simulations indicate that a rotation of 0.001 attains a logical error of $9.6\times10^{-5}$ on a surface code with $d=7$ at a physical error rate of $p=10^{-4}$, while avoiding the spacetime overheads of magic state factories, small angle synthesis, and routing. Resource estimates on surface and [[144,12,12]] bivariate bicycle codes for a Trotter-like circuit with $N=108$ logical qubits indicate runtime reductions of factors of 778 and 45, respectively, relative to the conventional method, due to the natural parallelism of rotation gates. Looking further ahead, we consider state-preparation tasks allowing postselection. We show that weak transversal gadgets prepare high-level equatorial magic states with a substantially improved cost-accuracy tradeoff, achieving up to a $10^3$-fold reduction in spacetime cost for a magic state at the 11th level of the Clifford hierarchy. Furthermore, we integrate weak transversal gates into magic state distillation pipelines, reducing the logical error rate of level-2 distillation of the $\sqrt{T}$ state by up to a factor of 94 with a small increase in spacetime cost.