pith. machine review for the scientific record. sign in

arxiv: 2503.05003 · v3 · submitted 2025-03-06 · 🪐 quant-ph

Recognition: unknown

Parallel Logical Measurements via Quantum Code Surgery

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords logicalcodesurgerymeasurementsomegaparallelpauliquantum
0
0 comments X
read the original abstract

Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes, which generalises lattice surgery. In this work, 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. For a collection of logically disjoint Pauli product measurements supported on $t$ logical qubits, our scheme uses $O\big(t \omega (\log t + \log^3\omega)\big)$ ancilla qubits, where $\omega \geq d$ is the maximum weight of the single logical Pauli representatives involved in the measurements, and $d$ is the code distance. This is all done in time $O(d)$ independent of $t$. Our proposed scheme preserves both the LDPC property and the fault-distance of the original code, without requiring ancillary logical codeblocks which may be costly to prepare. This addresses a shortcoming of several recently introduced surgery schemes which can only be applied to measure a limited number of logical operators in parallel if they overlap on data qubits.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction

    quant-ph 2026-04 conditional novelty 8.0

    LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.

  2. In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes

    quant-ph 2026-04 unverdicted novelty 8.0

    A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showin...

  3. CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling

    quant-ph 2026-04 unverdicted novelty 6.0

    CAbLECAR provides a robotics-inspired shuttle scheduler that enables QLDPC codes on tileable spin-qubit hardware, yielding up to 86% faster schedules and orders-of-magnitude gains in encoding efficiency and logical er...

  4. Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

    quant-ph 2026-04 unverdicted novelty 6.0

    A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the...

  5. The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

    quant-ph 2026-02