Introduction to qLDPC Codes
summary
Overview of quantum LDPC codes: CSS hypergraph-product constructions take two classical LDPC Tanner graphs to build quantum codes with k growing linearly but distance ~ sqrt(n) for the basic product; recent variants introduce group twists to get asymptotically good QLDPC with both rate and distance linear. Practical work embeds these codes into bilayer or neutral-atom architectures to handle locality, and decoding uses small-set-flip decoding (degeneracy forces flipping small correlated sets); efficient decoders exist asymptotically but finite-size performance and fault-tolerant logical gates remain open.
AI-written summary · about
chapters (10)
- 0:00Introduction and workshop
- 1:37Quantum LDPC overview
- 4:20CSS code background
- 11:24The toric code
- 17:34Classical codes and products
- 24:37Hypergraph product details
- 34:47Improving distance with twists
- 40:23Physical implementation
- 47:22Efficient decoding challenges
- 55:03Future work and Q&A
related talks
01h 03mQuantum LDPC Codes with Transversal CCZ Gates
44mNLTS Hamiltonians (and Strongly-Explicit SoS Lower Bounds) from Low-Rate Quantum LDPC Codes
32mTowards local testability for quantum coding
34mExplicit Abelian Lifts and Quantum LDPC Codes
39mExpansion of Higher-Dimensional Cubical Complexes With Application To Good ...
01h 01mBuilding a Quantum Computer with QLDPC Codes
50mMaking the Leap to Quantum PCPs
59mDawn in the age of quantum fault tolerance