Efficient Simulation of Logical Magic State Preparation Protocols

This paper addresses a crucial challenge in building fault-tolerant quantum computers: efficiently simulating logical magic state preparation protocols. The ability to simulate these protocols without approximations or resource-intensive methods is vital for their development and optimization. The paper's focus on protocols based on code switching, magic state cultivation, and magic state distillation, along with the identification of a key property (Pauli errors propagating to Clifford errors), suggests a significant contribution to the field. The polynomial complexity in qubit number and non-stabilizerness is a key advantage.