Parsimonious Quantum Low-Density Parity-Check Code Surgery

TL;DR

This paper introduces a method to construct low-overhead ancilla systems for measuring logical operators in quantum LDPC codes, significantly reducing resource overhead in quantum code surgery schemes.

Contribution

It presents a novel construction of ancilla systems of size O(W log W) for arbitrary logical Pauli measurements in qLDPC codes, improving efficiency.

Findings

Reduces asymptotic overhead in quantum code surgery schemes

Constructs ancilla systems of size O(W log W) for logical measurements

Enhances fault-tolerance and efficiency in quantum error correction

Abstract

Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schemes, including parallel surgery, universal adapters and fast surgery, and serves as the key primitive in extractor architectures. The efficiency of these schemes crucially depends on constructing low-overhead ancilla systems for measuring arbitrary logical operators in general quantum Low-Density Parity-Check (qLDPC) codes. In this work, we introduce a method to construct an ancilla system of qubit size $O(W \log W)$ to measure an arbitrary logical Pauli operator of weight $W$ in any qLDPC stabilizer code. This new construction immediately reduces the asymptotic overhead across various quantum code surgery schemes.