Talk by Chris Pattison (UC Berkeley)
summary
Claim: fault-tolerant universal computation uses only a constant number of global control lines plus a few fully controllable qubits, achieved by compiling 1D measurement‑free concatenated codes (Aharonov‑Ben‑Or style) into a depth‑three periodic circuit laid out as a folded ribbon on a 2D chip. Tools: local swap networks, encoded classical control streams decoded with majority/concatenated decoding, entanglement swapping/teleportation to make a fast random‑access memory. Results: logical memory with polylog overhead, threshold for local stochastic noise, and polylogarithmic time overhead (rather than linear W); requires very uniform qubits and nonstandard hardware.
AI-written summary · about
chapters (22)
- 0:00Fault-tolerant quantum computation
- 1:05Scaling quantum hardware challenges
- 4:17Classical processor architecture
- 8:12Mapping 1D schemes to 2D tiles
- 15:33Fault-tolerant quantum memory
- 20:142D quantum memory in square
- 21:24Quantum processor with hard-coded circuits
- 24:17Universal operations with control bits
- 27:17Noiseless control from classical codes
- 30:29Processor capabilities and limits
- 36:50Speeding up with classical wires
- 39:45Polylogarithmic time overhead
- 42:25Hardware requirements and challenges
- 43:50Future directions and platforms
- 44:53Fabrication defects and thresholds
- 45:42Control lines in non-adaptive circuits
- 47:06Quantum versus classical decoding
- 47:27Feedback and interactive control
- 48:10Speedup from W to polylog W
- 49:15Simplifying architecture (no-error)
- 49:38Continuous ribbons in neutral atoms
- 51:45Ideal platforms for architecture
related talks
01h 10mArchitectural mechanisms of a universal fault-tolerant quantum computer
47mHigh-Threshold and Low-Overhead Fault-Tolerant Quantum Memory
30mHow to fault-tolerantly realize any quantum circuit with local operations
01h 01mInvited Talk: Welcome to Quantum 3.0!
59mDawn in the age of quantum fault tolerance
01h 06mTour de gross: A modular quantum computer based on bivariate bicycle codes
33mAtomic Quantum Processors and the Error-Correction Frontier
02h 41mLightning Talks