Reducing T Gates with Unitary Synthesis
Abstract
Quantum error correction is essential for achieving practical quantum computing but has a significant computational overhead. Among fault-tolerant (FT) gate operations, non-Clifford gates, such as T, are particularly expensive due to their reliance on magic state distillation. These costly T gates appear frequently in FT circuits as many quantum algorithms require arbitrary single-qubit rotations, such as Rx and Rz gates, which must be decomposed into a sequence of T and Clifford gates. In many quantum circuits, Rx and Rz gates can be fused to form a single U3 unitary. However, existing synthesis methods, such as gridsynth, rely on indirect decompositions, requiring separate Rz decompositions that result in a threefold increase in T count.
Fields of Study & Subjects
Protein Degradation and Inhibitors
Advancements in Semiconductor Devices and Circuit Design
Radiation Effects in Electronics
Publication details
- Journal / source
- Proceedings of the 31st ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2
- Publisher
- ACM
- Pages
- 1589–1604
- Publication date
- 10 March 2026
- Language
- EN