| （英） |
Techniques for fault-tolerant quantum computation are crucial for accurately simulating ideal quantum mechanics in our inherently noisy world. Conventionally, fault-tolerant quantum computation requires polylogarithmic overheads in both qubit count and runtime. However, through a series of our recent works, we introduce new protocols and analyses that significantly reduce these overheads for fault-tolerant quantum computation. This talk will present an overview of our progress and explore a new frontier, as well as the broader implications, of low-overhead fault-tolerant quantum computation. |