Posted

Yichen Xu, Yiqing Zhou, James P. Sethna, Eun-Ah Kim (Oct 14 2025).
Abstract: The threshold theorem promises a path to fault-tolerant quantum computation by suppressing logical errors, provided the physical error rate is below a critical threshold. While transversal gates offer an efficient method for implementing logical operations, they risk spreading errors and potentially lowering this threshold compared to a static quantum memory. Available threshold estimates for transversal circuits are empirically obtained and limited to specific, sub-optimal decoders. To establish rigorous bounds on the negative impact of error spreading by the transversal gates, we generalize the statistical mechanical (stat-mech) mapping from quantum memories to logical circuits. We establish a mapping for two toric code blocks that undergo a transversal CNOT (tCNOT) gate. Using this mapping, we quantify the impact of two independent error-spreading mechanisms: the spread of physical bit-flip errors and the spread of syndrome errors. In the former case, the stat-mech model is a 2D random Ashkin-Teller model. We use numerical simulation to show that the tCNOT gate reduces the optimal bit-flip error threshold to p=0.080p=0.080, a 26%26\% decrease from the toric code memory threshold p=0.109p=0.109. The case of syndrome error coexisting with bit-flip errors is mapped to a 3D random 4-body Ising model with a plane defect. There, we obtain a conservative estimate error threshold of p=0.028p=0.028, implying an even more modest reduction due to the spread of the syndrome error compared to the memory threshold p=0.033p=0.033. Our work establishes that an arbitrary transversal Clifford logical circuit can be mapped to a stat-mech model, and a rigorous threshold can be obtained correspondingly.

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!