Achieving Quantum Fault Tolerance with Minimal Resources 🛡️

Chris Pattison (Caltech) https://simons.berkeley.edu/talks/chris-pattison-caltech-2025-05-28 Quantum Algorithms, Complexity, and Fault Tolerance Reunion In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and -time overhead, where hides sub-polylog factors. Our construction utilizes constant-rate quantum locally testable codes (qLTC), new fault-tolerant gadgets on qLTCs/qLDPC codes including sub-logarithmic spacetime overhead magic state distillation, and a new analysis framework which we expect will be of further interest.