Building a Quantum Computer with QLDPC Codes
summary
Overview of concrete claims, tools, and limits: modern proposals replace surface codes with QLDPC memory plus LDPC surgery extractors, use Stim and open decoders, and build magic state factories by cultivation then distillation. Resource claims vary: Gidney estimates RSA‑2048 <1M qubits <week (superconducting); IBM’s bicycle cuts qubits ~10× but runs ~10× slower; Iceberg/Oratomic give neutral‑atom claims (100k qubits → 30k+ days; 11k qubits → 43k days; ECC‑256 ≈10k qubits ≈1k days). Decoding cost, magic‑state throughput, and hardware connectivity remain the key unresolved bottlenecks.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:16Fault-tolerant progress
- 12:16LDPC architecture components
- 21:13LDPC surgery for control
- 33:27FTQC architecture designs
- 39:50Time overhead in estimates
- 46:09LDPC challenges and future
- 51:44Early FTQC outlook
- 57:54Q&A
related talks
01h 02mQuantum Computing Concepts
28mThe future of computing with Quantum Computing
24mQuantum Computing: a Treasure Hunt, not a Gold Rush
51mCracking the Quantum Code: Discovering the Quantum Revolution!
26mQuantum Leap: Revolutionizing Rust Software Development
47mUnboxing Quantum Computing
55m"Hello, Multiverse!" - Quantum Computing and You
20mExploring Quantum Computing Paradigms for Industry Advancement