一句话：提出 TRASYN，直接合成任意单量子比特酉，避免单独 Rz 分解，显著减少容错电路的 T 门与 Clifford 门。
量子纠错对实用量子计算至关重要，但容错门操作开销很大，其中 T 门因依赖 magic state distillation 尤其昂贵。许多量子算法需要 Rx/Rz 等任意单量子比特旋转，必须分解为 T 与 Clifford 门；Rx 与 Rz 常可融合为 U3 酉，但 gridsynth 等已有方法依赖间接分解并单独处理 Rz，导致 T 数量约三倍增加。本文提出 TRASYN，一种基于张量网络搜索的容错合成算法，可直接原生合成任意单量子比特 U3 酉，避免单独 Rz 分解带来的开销。在 187 个代表性基准上，与基于 gridsynth 的电路合成相比，TRASYN 将 T 门数量最多减少 3.5 倍、Clifford 门最多减少 7 倍，整体电路 infidelity 最多改善 4 倍，同时降低近似误差。
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. This work presents TensoR-based Arbitrary unitary SYNthesis (TRASYN), a novel FT synthesis algorithm that directly synthesizes arbitrary single-qubit unitaries, avoiding the overhead of separate Rz decompositions. By leveraging tensor network-based search, our approach enables native U3 synthesis, reducing the T count, Clifford gate count, and approximation error. Compared to gridsynth-based circuit synthesis, for 187 representative benchmarks, our design reduces the T count by up to 3.5 ×, and Clifford gates by 7 ×, resulting in up to 4 × improvement in overall circuit infidelity.