Related papers: Parsimonious Quantum Low-Density Parity-Check Code Surgery

Parsimonious Quantum Low-Density Parity-Check Code Surgery

URL: http://arxiv.org/abs/2603.05082v1
Date: Thu, 05 Mar 2026 11:52:57 GMT
Title: Parsimonious Quantum Low-Density Parity-Check Code Surgery
Authors: Andrew C. Yuan, Alexander Cowtan, Zhiyang He, Ting-Chun Lin, Dominic J. Williamson,
Abstract summary: We introduce a method to construct an ancilla system of qubit size $O(W log W)$ to measure an arbitrary logical operator of weight.<n>This new construction immediately reduces the overhead across various quantum code surgery schemes.
Score: 38.902931077568795
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
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.

Related papers

Explicit construction of low-overhead gadgets for gates on quantum LDPC codes [0.0]
A popular method for performing logical operations is by measuring logical Pauli operators.<n>We present a simple, explicit construction for fixed gadgets that can measure arbitrary logical Pauli operators on QLDPC codes.
arXiv Detail & Related papers (2025-11-20T02:41:31Z)
High-Rate Surgery: towards constant-overhead logical operations [3.085891666389647]
We introduce high-rate surgery, a general scheme that can perform extensive, addressable logical Pauli-product measurements in parallel on arbitrary qLDPC codes.<n>Our results address a major bottleneck for performing complex, addressable logical operations on qLDPC codes in practice, advancing the prospect of scalable, constant-overhead fault-tolerant quantum computation.
arXiv Detail & Related papers (2025-10-09T17:49:39Z)
Fast surgery for quantum LDPC codes [0.0]
We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement.<n>Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads.
arXiv Detail & Related papers (2025-10-06T06:29:16Z)
Planar Fault-Tolerant Quantum Computation with Low Overhead [5.232949916418351]
We introduce code craft, a framework for designing fault-tolerant logical operations on planar BB codes.<n>We show that logical operations, including controlled-NOT gates, state transfers, and Pauli measurements, can be efficiently implemented within this framework.
arXiv Detail & Related papers (2025-06-22T15:07:03Z)
Parallel Logical Measurements via Quantum Code Surgery [42.95092131256421]
Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes.<n>We present a code surgery scheme, applicable to any qubit stabiliser low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel.
arXiv Detail & Related papers (2025-03-06T22:05:52Z)
Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z)
SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
arXiv Detail & Related papers (2024-07-12T16:50:01Z)
Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
arXiv Detail & Related papers (2023-07-20T10:51:23Z)
Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z)
Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.