Parallel Logical Measurements via Quantum Code Surgery

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 ω(\log t + \log^3ω)\big)$ ancilla qubits, where $ω\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.

Publication Details

Journal
ArXiv.org
Published
2025-03-06
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parallel Logical Measurements via Quantum Code Surgery

ArXiv.org
Quantum Computing Algorithms and Architecture
article

Parallel Logical Measurements via Quantum Code Surgery

article en

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 ω(\log t + \log^3ω)\big)$ ancilla qubits, where $ω\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.

ArXiv.org
Peace, Justice and strong institutions
Openalex Percentile: Top 73%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.