Explicit construction of low-overhead gadgets for gates on quantum LDPC codes
Abstract
Quantum low-density parity check (QLDPC) codes can significantly reduce the overhead of quantum computing, provided the methods for performing logical operations do not require substantial space and time resources. A popular method for performing logical operations is by measuring logical Pauli operators. We present a simple, explicit construction for fixed gadgets that can measure arbitrary logical Pauli operators on QLDPC codes when dynamically connected to the code block. We apply this construction to a family of generalised bicycle codes with distances relevant to utility-scale quantum computation (10≤ d ≤ 24) and show that it reduces the space overhead by at least an order of magnitude compared to corresponding surface code architectures, without increasing the time overhead.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.