סמינר בחומר מעובה: Full-Stack Optimization of Fault-Tolerant Quantum Computation

Practical quantum computation requires optimization across the entire computing stack: from device physics and quantum error correction up to the implementation of arithmetic and logic. In this talk, I will show how combining insights from different levels of the stack can substantially reduce the resources required by quantum algorithms, using two examples from neutral-atom architectures. The first is surface-code cultivation, a new magic-state generation scheme that improves on the state of the art by 20×, effectively removing magic-state generation as a bottleneck. The second is a fast measurement scheme for neutral atoms, designed for time-optimal computation. It further extends our ability to trade space for time and makes atom arrays competitive with much faster modalities on the same time scales. Together, these techniques dramatically reduce the resources needed for fault-tolerant quantum computing