Sharing flag circuits across code blocks: an exact local criterion for joint logical measurements
Year: 2026
Type: preprint
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.
Source: Research Square
Author: Annan Chen
Institution: Imperial College London
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233989826
