High-Threshold and Low-Overhead Fault-Tolerant Quantum Memory
summary
An end-to-end protocol uses a family of LDPC (bi-variate bicycle) codes, measured by depth-7 circuits on a degree-6 Tanner graph split into two planar layers, and decoded with BP+OSD on a circuit depolarizing noise model where all gates fail with probability p. It reports a 0.8% threshold, a depth-limited circuit distance about D−2, and a concrete example that preserves 12 logical qubits for ten million cycles with 288 physical qubits at p=0.001, versus >4000 for surface code.
AI-written summary · about
chapters (9)
- 0:00Introduction to LDPC codes
- 1:20Limitations of surface codes
- 6:27Designing new quantum codes
- 9:32Two block CSS code construction
- 13:29Bivariate bicycle code family
- 19:38Syndrome measurement circuits
- 24:26Performance simulation results
- 30:01Hardware layout considerations
- 37:09Logical gates and conclusion
related talks
59mDawn in the age of quantum fault tolerance
03mQuantum Algorithms, Complexity, and Fault Tolerance
19mAvenues for Quantum Error Correction and Mitigation
01h 01mBuilding a Quantum Computer with QLDPC Codes
32mTowards local testability for quantum coding
01h 37mFault-Tolerance Against Adversarial Errors & PCPs
01h 10mArchitectural mechanisms of a universal fault-tolerant quantum computer
01h 06mTour de gross: A modular quantum computer based on bivariate bicycle codes