On constant T-depth circuits

Isaac Kim describes quantum computations achievable with constant T-depth. Examples include single-qubit rotations and programmable versions, and the quantum portion of Shor’s factoring algorithm, which use a catalyst state. Other constructions, including reversible encoded addition, achieve constant T-depth without such a catalyst.