Sharing flag circuits across code blocks: an exact local criterion for joint logical measurements

Abstract Joint logical measurements can reuse a single flag circuit across code blocks while retaining its auxiliary qubits, flag gates and correction table. We establish an exact local criterion for this reuse. For layered CNOT circuits under full Pauli faults, we prove that a flag circuit can be shared among any number of blocks, with any gate order inside each data layer, if and only if on a single block it bounds the full Pauli weight of the residual error by the number of faults; every block of the shared circuit then obeys the same bound. Two blocks suffice to witness any violation. We also determine the exact fault order guaranteed by a certificate that bounds the X weight alone. The criterion extends the Chao–Reichardt construction to joint measurements at arbitrary distance and certifies the single-round mixed-Pauli circuit of a five-qubit-code teleportation experiment. In a complete two-block Steane-code protocol with noisy error correction and standard decoding, a shared one-flag circuit removes every first-order failure, whereas the bare circuit fails with probability 8p/5 + O(p²) at physical error rate p. Local certification thus provides a reusable design rule for joint logical measurements with auxiliary overhead independent of the number of blocks.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-17
DOI
https://doi.org/10.21203/rs.3.rs-11759691/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sharing flag circuits across code blocks: an exact local criterion for joint logical measurements

Annan Chen
2 links
Research Square
Quantum Computing Algorithms and Architecture
preprint

Sharing flag circuits across code blocks: an exact local criterion for joint logical measurements

Annan Chen
preprint en

Abstract

Abstract Joint logical measurements can reuse a single flag circuit across code blocks while retaining its auxiliary qubits, flag gates and correction table. We establish an exact local criterion for this reuse. For layered CNOT circuits under full Pauli faults, we prove that a flag circuit can be shared among any number of blocks, with any gate order inside each data layer, if and only if on a single block it bounds the full Pauli weight of the residual error by the number of faults; every block of the shared circuit then obeys the same bound. Two blocks suffice to witness any violation. We also determine the exact fault order guaranteed by a certificate that bounds the X weight alone. The criterion extends the Chao–Reichardt construction to joint measurements at arbitrary distance and certifies the single-round mixed-Pauli circuit of a five-qubit-code teleportation experiment. In a complete two-block Steane-code protocol with noisy error correction and standard decoding, a shared one-flag circuit removes every first-order failure, whereas the bare circuit fails with probability 8p/5 + O(p²) at physical error rate p. Local certification thus provides a reusable design rule for joint logical measurements with auxiliary overhead independent of the number of blocks.

Research Square
Imperial College London (GB)
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.

Laika access coming soon