Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
The paper introduces quantum low-density parity-check codes that solve overhead issues in fault-tolerant quantum computation by using only nearest-neighbor gates on a square grid. It dynamically generates check connectivity via 'nearest-neighbour iSWAP walks,' avoiding complex long-range hardware requirements and achieving high performance comparable to surface codes.