Achieving Quantum Fault Tolerance with Minimal Resources ๐ก๏ธ
Discover innovative methods for quantum fault tolerance that operate with constant space and logarithmic-time overheads, advancing the future of reliable quantum computing. Presented by Chris Pattison at Caltech.
Simons Institute for the Theory of Computing
97 views โข Jun 18, 2025
About this video
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.
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.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
97
Duration
38:25
Published
Jun 18, 2025
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.