On constant T-depth circuits @SimonsInstitute
On constant T-depth circuits  @SimonsInstitute
Uploaded July 2026 | Updated November 2026, 3 days ago
Isaac Kim (UC Davis)
https://simons.berkeley.edu/talks/isaac-kim-uc-davis-2026-07-23
Quantum Summer Cluster Final Workshop

The cost of fault-tolerant magic state preparations have been going down rapidly over the past few years. Motivated by this development, I will discuss some surprising examples of quantum circuits that can be realized in constant T-depth. Some of these constructions, such as single-qubit rotation and its programmable variants, as well as quantum part of Shor's factoring algorithm, require a catalyst state. But there are also other constructions that do not, such as reversible encoded addition.
On constant T-depth circuitsSigned Rectified Flow: Negativity-Controlled GenerationDerandomizing Space-Bounded Computation (Part 2)Resonances on geometrically finite graphs and buildingsInference-Time Algorithms: A Theoretical Lens on Tractability and Error PropagationAligning Evaluation Incentives to Reduce HallucinationATHENA: Steering Generative Models toward Better Visual ReasoningReliable Language GenerationStrong Convergence (Part I)Expanding GroupsLinear hashing and friendsMy Favorite Expanders | Richard M. Karp Distinguished Lecture
Simons Institute for the Theory of Computing |

On constant T-depth circuits

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER