Managing Diverse Magic States in Fault-Tolerant Quantum Computing

Programs compiled for error corrected quantum computers must be expressed in Fault-Tolerant (FT) gate sets. FT gate sets must contain at least one non-transversal "magic" gate to ensure universality. The Clifford+T gate set, which consists of Cliffords {H, S, CNOT} and the non-Clifford (non-transversal) T gate, is one of the most extensively studied FT gate sets. In this talk, I will demonstrate how compiling algorithms to gate sets with multiple magic gates can improve the resource cost of FT quantum programs. Our analysis considers not only the number of non-Clifford gates but also the resources required for gate distillation and probabilistic corrections during execution on a surface code architecture.