How to fault-tolerantly realize any quantum circuit with local operations
Talkat Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms · 2024-04-22..04-26·
summary
Proposes a procedure that turns any quantum circuit into a geometrically local circuit with polynomial qubit overhead and constant depth overhead while provably preserving fault tolerance under local stochastic noise. Implements routing by parallel long‑range entanglement generation: find many edge‑disjoint paths in a quasi‑2D/3D lattice, replace each path segment with a Raussendorf cluster‑state Bell‑pair protocol, and use entanglement swapping to teleport gates locally. Proves a parallel repetition theorem so the output noise rate stays bounded independent of repetitions, and combines with existing FT schemes to get a local threshold and quasi‑polylogarithmic logical depth.
AI-written summary · about
chapters (5)
- 0:00Introduction and background
- 17:07Fault-tolerant routing scheme
- 23:19Conclusion of research
- 23:50Future work and optimality
- 25:15Questions and answers
related talks
36mCircuit-To-Hamiltonian From Tensor Networks and Fault Tolerance
01h 37mFault-Tolerance Against Adversarial Errors & PCPs
22mOptimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation
35mLow-Overhead Fault Tolerance in Two Dimensions
32mTowards local testability for quantum coding
47mHigh-Threshold and Low-Overhead Fault-Tolerant Quantum Memory
53mTalk by Chris Pattison (UC Berkeley)
01h 10mQuantum Advantage with Shallow Clifford Circuits