2 Fast 2 Surgery: Fast surgery on QLDPC codes with (n(k + d)) space overhead

Name: 2 Fast 2 Surgery: Fast surgery on QLDPC codes with (n(k + d)) space overhead
Uploaded: 2026-10-12T04:47:14.240625+00:00
Duration: 302 s
Description: This work introduces a method for performing fast surgery on Quantum Low-Density Parity Check (QLDPC) codes with an improved space overhead of approximately O(n(k + d)). This is better than previous bounds and matches the cost of regular surgery, enabling more efficient quantum error correction operations.

This work introduces a method for performing fast surgery on Quantum Low-Density Parity Check (QLDPC) codes with an improved space overhead of approximately O(n(k + d)). This is better than previous bounds and matches the cost of regular surgery, enabling more efficient quantum error correction operations.

Open the full episode