arxiv: 2604.17339 · v1 · submitted 2026-04-19 · 🪐 quant-ph

Fault-Tolerant Cut-Cat State Syndrome Extraction for Quantum Codes

Diego Forlivesi , Lorenzo Valentini , Marco Chiani This is my paper

Pith reviewed 2026-05-10 06:08 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum error correctionfault-tolerant protocolssyndrome extractionCSS codescat stateshook errorsflag-based methodstwo-qubit gates

0 comments

The pith

The cut-cat scheme performs fault-tolerant syndrome extraction in CSS codes using fewer simultaneous qubits and scaling better in gate count than flag methods.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces the cut-cat state scheme for extracting error syndromes from CSS quantum codes in a fault-tolerant manner. Ancilla qubits are allowed to interact non-fault-tolerantly with pairs of data qubits, which would normally spread errors, but additional measurements on cat states detect and correct these hook errors. This design keeps the parallel interaction of many data qubits at once but requires more than half fewer qubits to be prepared simultaneously. As a result, the total number of two-qubit gates grows more slowly with code distance than in current flag-based protocols.

Core claim

In the cut-cat state scheme, non-fault-tolerant ancilla-data interactions are made safe by adding cat stabilizer measurements that identify and correct hook errors. The scheme preserves the parallelized data interactions of cat-based extraction while reducing the number of simultaneous qubits required by more than half. Compared to flag-based protocols, it uses fewer two-qubit gates as the code distance increases.

What carries the argument

The cut-cat state scheme that pairs non-fault-tolerant ancilla interactions with corrective cat stabilizer measurements to handle hook errors.

If this is right

The number of qubits that must interact simultaneously drops by more than half.
Two-qubit gate counts scale more favorably with increasing code distance than flag-based methods.
Parallel data qubit interactions remain possible during syndrome extraction.
The method applies to any CSS code for quantum error correction.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Resource requirements for high-distance quantum error correction could decrease substantially.
Hardware implementations may become feasible sooner due to lower simultaneous qubit demands.
Extensions to other stabilizer codes or measurement protocols could follow similar cut principles.
Error rate simulations would be needed to confirm the overhead remains practical.

Load-bearing premise

Additional cat stabilizer measurements can always catch and correct the hook errors created by the non-fault-tolerant ancilla-data pairs without leaving uncorrectable errors or adding too much cost.

What would settle it

An error model simulation that shows the cut-cat scheme fails to suppress logical errors below the flag-based scheme for distances greater than 5, or leaves residual hook errors after correction.

Figures

Figures reproduced from arXiv: 2604.17339 by Diego Forlivesi, Lorenzo Valentini, Marco Chiani.

**Figure 1.** Figure 1: Flag t-FT syndrome extraction: A single X error on the syndrome qubit propagates to a weight w = 2 error on the data qubits. This error is also transferred to a flag qubit, enabling it to be detected and corrected. from a valid encoded state by a data error of weight at most s. In addition, if the input encoded state contains a data error of weight r and at most s additional faults occur during the procedu… view at source ↗

**Figure 2.** Figure 2: Cut-cat state 2-FT syndrome extraction protocol for an X-type stabilizer of weight γi = 10 in a code of distance d = 5. a) A cat state consisting of γi/2 qubits is prepared. b) Each cat qubit acts as the control in two two-qubit gates that interact with data qubits. c) A single round of cat stabilizer measurements is performed. TABLE I COMPARISON BETWEEN FT SYNDROME EXTRACTION STRATEGIES WITH CAT STATE ERR… view at source ↗

**Figure 3.** Figure 3: Error propagation in the cut-cat state syndrome extraction scheme. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

**Figure 4.** Figure 4: Probability that an error of weight w > t is propagated to the data qubits by the cut-cat state syndrome extraction gadget vs. gate error probability. Dashed lines indicate visually the expected O(p t+1) scaling for a code of distance d = 2t + 1, fitting the simulated data points. is consistent with the observed numerical behavior. 2) Code Block Analysis: To perform code block analysis, we employ the cut-c… view at source ↗

**Figure 6.** Figure 6: Logical error rate vs. physical error rate over a depolarizing channel. [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗

read the original abstract

Reliable quantum computation requires fault-tolerant protocols to prevent errors from propagating during syndrome extraction in quantum error correction. We present a novel fault-tolerant syndrome extraction technique for CSS codes, which we refer to as the cut-cat state scheme. While each ancilla qubit interacts non-fault-tolerantly with a pair of data qubits, we introduce additional cat stabilizer measurements to identify and correct the resulting hook errors. Our approach maintains the key benefit of cat-based extraction, i.e., parallelized data qubit interactions, while reducing the number of simultaneous qubits required by more than half. Compared to flag-based state-of-the-art protocols, the cut-cat scheme offers a notable advantage in terms of two-qubit gate count as the code distance increases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The cut-cat scheme cuts peak qubit count in half for fault-tolerant CSS syndrome extraction by pairing non-FT ancilla interactions with extra cat checks to catch hooks, and it claims better two-qubit gate scaling than flag methods as distance grows.

read the letter

The main takeaway is that this paper gives a concrete construction for syndrome extraction that keeps the parallel data-qubit interactions of cat states but drops the simultaneous qubit requirement by more than half. The trick is letting each ancilla touch a pair of data qubits non-fault-tolerantly and then adding targeted cat stabilizer measurements to identify and correct the hook errors that result. That combination is what they label the cut-cat scheme, and it is presented as new for CSS codes. The paper shows the circuit layout, explains how the extra measurements preserve fault tolerance, and compares the two-qubit gate count against standard flag protocols, arguing the scaling improves with distance. That part is useful because qubit overhead and gate count directly affect whether a code is practical on near-term hardware. The construction itself looks internally consistent: the added checks are chosen to match the error patterns that the non-FT links can produce, and the parallelization benefit is retained. The citation pattern covers the usual cat-state and flag papers without obvious gaps. The soft spot is that the claimed gate-count advantage is stated in the abstract and introduction but the full numerical tables or asymptotic derivations are not reproduced in the summary I saw, so the size of the improvement at moderate distances still needs direct verification from the circuits. The assumption that the extra measurements do not create new uncorrectable patterns also rests on the error analysis in the body; if that analysis is complete it holds, but it is the part a referee will check most closely. This is the kind of paper that matters for people doing resource estimates or hardware mapping for surface codes and similar CSS families. A reader who already knows the flag and cat literature will see the incremental change quickly and can judge whether the qubit saving is worth the added measurement steps. It is coherent on its own terms and engages the right prior results, so it deserves a serious referee even if the final numbers require tightening.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a cut-cat state scheme for fault-tolerant syndrome extraction in CSS quantum error-correcting codes. Each ancilla interacts non-fault-tolerantly with a pair of data qubits, but additional cat stabilizer measurements are introduced to identify and correct resulting hook errors. The approach is claimed to preserve parallelized data-qubit interactions while reducing the number of simultaneous qubits required by more than half, and to offer a scaling advantage in two-qubit gate count over flag-based protocols as code distance increases.

Significance. If the fault-tolerance property and resource scaling hold, the scheme could reduce overhead in practical quantum error correction implementations, particularly for high-distance CSS codes where minimizing two-qubit gates and qubit resources is critical for hardware feasibility.

major comments (2)

The central claim that additional cat stabilizer measurements reliably correct hook errors from non-FT ancilla-data interactions without introducing new uncorrectable error patterns is stated but unsupported by any explicit error analysis, circuit diagram, or propagation table. This assumption is load-bearing for the fault-tolerance guarantee and the overall advantage over flag-based methods.
No explicit calculation, table, or scaling derivation is provided to substantiate the claimed advantage in two-qubit gate count versus flag-based protocols as distance d increases. The abstract asserts a 'notable advantage' but supplies no gate-count expressions or numerical comparisons that would allow verification of sub-linear overhead.

minor comments (2)

The manuscript would benefit from a dedicated section or appendix containing the full circuit diagrams for the cut-cat extraction and the cat stabilizer measurements to clarify the parallelization and qubit-reduction claims.
Notation for the 'cut-cat state' and the specific cat stabilizers should be defined explicitly with equations, as the current description relies on informal terminology without reference to standard CSS syndrome extraction literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable feedback on our manuscript describing the cut-cat state syndrome extraction protocol for CSS codes. We have carefully addressed each major comment below with point-by-point responses. Where the comments identify areas requiring additional support, we will revise the manuscript to incorporate the requested clarifications and analyses.

read point-by-point responses

Referee: The central claim that additional cat stabilizer measurements reliably correct hook errors from non-FT ancilla-data interactions without introducing new uncorrectable error patterns is stated but unsupported by any explicit error analysis, circuit diagram, or propagation table. This assumption is load-bearing for the fault-tolerance guarantee and the overall advantage over flag-based methods.

Authors: We agree that an explicit, self-contained error analysis is essential to rigorously establish the fault-tolerance property. The manuscript outlines the protocol and its intended error-correction mechanism, but we acknowledge that the current presentation does not include the detailed supporting materials the referee requests. In the revised manuscript we will add: (i) complete circuit diagrams for the cut-cat ancilla-data interactions and the subsequent cat stabilizer measurements, (ii) error propagation tables that track all single- and two-qubit errors through the circuit, and (iii) a step-by-step analysis showing that hook errors are detected and corrected while no new weight-(d+1)/2 or higher uncorrectable patterns are introduced. These additions will directly substantiate the central claim and strengthen the comparison with flag-based methods. revision: yes
Referee: No explicit calculation, table, or scaling derivation is provided to substantiate the claimed advantage in two-qubit gate count versus flag-based protocols as distance d increases. The abstract asserts a 'notable advantage' but supplies no gate-count expressions or numerical comparisons that would allow verification of sub-linear overhead.

Authors: We accept that the scaling advantage must be demonstrated quantitatively rather than asserted. Although the manuscript discusses the reduction in simultaneous qubit count and the preservation of parallel data-qubit interactions, it does not supply the explicit gate-count formulas or comparative tables. In the revision we will include: (i) closed-form expressions for the total number of two-qubit gates required by the cut-cat scheme and by standard flag-based protocols as functions of code distance d, (ii) a table of numerical values for representative distances (d = 3, 5, 7, 9, …), and (iii) a brief derivation showing that the overhead grows more slowly than the flag-based baseline. These additions will allow independent verification of the claimed advantage. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper presents a novel construction for fault-tolerant syndrome extraction in CSS codes, introducing the cut-cat state scheme as an original technique that uses additional cat stabilizer measurements to handle hook errors from non-fault-tolerant ancilla-data interactions. No equations, fitted parameters, predictions, or derivation chains appear in the abstract or description that reduce by construction to inputs. The claimed advantage in two-qubit gate scaling versus flag-based protocols follows directly from the described parallelization and qubit reduction properties of the new scheme, without self-definitional loops, self-citation load-bearing premises, or renamed known results. The derivation is self-contained as a constructive proposal rather than a re-derivation of prior fitted or cited results.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, background axioms, or postulated entities; the scheme itself is the proposed contribution.

pith-pipeline@v0.9.0 · 5415 in / 1052 out tokens · 31034 ms · 2026-05-10T06:08:10.494290+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

42 extracted references · 5 canonical work pages

[1]

Scheme for reducing decoherence in quantum computer memory,

P. W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A , vol. 52, pp. R2493–R2496, Oct 1995

1995
[2]

Perfect quantum error correcting code,

R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek, “Perfect quantum error correcting code,” Phys. Rev. Lett. , vol. 77, no. 1, p. 198, 1996

1996
[3]

Theory of quantum error-correcting codes,

E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Phys. Rev. A , vol. 55, pp. 900–911, Feb 1997

1997
[4]

Structured near-optimal channel-adapted quantum error correction,

A. S. Fletcher, P. W. Shor, and M. Z. Win, “Structured near-optimal channel-adapted quantum error correction,” Phys. Rev. A , vol. 77, p. 012320, Jan 2008

2008
[5]

Fault-tolerant quantum computation with constant error,

D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error,” in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , 1997, pp. 176–188

1997
[6]

Surface codes: Towards practical large-scale quantum computation,

A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Phys. Rev. A, vol. 86, no. 3, sep 2012

2012
[7]

Quantum error correction for quantum memories,

B. M. Terhal, “Quantum error correction for quantum memories,” Rev. Mod. Phys. , vol. 87, pp. 307–346, Apr 2015. FORLIVESI, V ALENTINI, CHIANI 13

2015
[8]

Topological quantum memory,

E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics , vol. 43, no. 9, pp. 4452– 4505, sep 2002

2002
[9]

Duality of quantum and classical error correction codes: Design principles and examples,

Z. Babar, D. Chandra, H. V . Nguyen, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, “Duality of quantum and classical error correction codes: Design principles and examples,” IEEE Commun. Surveys Tuts. , vol. 21, no. 1, pp. 970–1010, Firstquarter 2019

2019
[10]

Logical error rates of XZZX and rotated quantum surface codes,

D. Forlivesi, L. Valentini, and M. Chiani, “Logical error rates of XZZX and rotated quantum surface codes,” IEEE JSAC, 2024

2024
[11]

An introduction to quantum error correction and fault- tolerant quantum computation,

D. Gottesman, “An introduction to quantum error correction and fault- tolerant quantum computation,” in Quantum information science and its contributions to mathematics, PSAM , vol. 68, 2010, pp. 13–58

2010
[12]

Good quantum error-correcting codes exist,

A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A , vol. 54, no. 2, p. 1098, 1996

1996
[13]

Multiple-particle interference and quantum error correction,

A. Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences , vol. 452, no. 1954, pp. 2551–2577, 1996

1954
[14]

Topological quantum distilla- tion,

H. Bombin and M. A. Martin-Delgado, “Topological quantum distilla- tion,” Phys. Rev. Lett. , vol. 97, no. 18, p. 180501, 2006

2006
[15]

Cylindrical and M ¨obius quantum codes for asymmetric Pauli errors,

L. Valentini, D. Forlivesi, and M. Chiani, “Cylindrical and M ¨obius quantum codes for asymmetric Pauli errors,” IEEE Trans. Inf. Theory. , vol. 71, no. 5, pp. 3766–3778, 2025

2025
[16]

Performance analysis of quan- tum error-correcting codes via Williams identities,

D. Forlivesi, L. Valentini, and M. Chiani, “Performance analysis of quan- tum error-correcting codes via Williams identities,” Quantum, vol. 9, p. 1950, 2025

1950
[17]

Class of quantum error-correcting codes saturating the quantum Hamming bound,

D. Gottesman, “Class of quantum error-correcting codes saturating the quantum Hamming bound,” Phys. Rev. A , vol. 54, pp. 1862–1868, Sep 1996

1996
[18]

Active stabilization, quantum computation, and quantum state synthesis,

A. M. Steane, “Active stabilization, quantum computation, and quantum state synthesis,” Physical Review Letters , vol. 78, no. 11, p. 2252–2255, Mar. 1997

1997
[19]

Improved decoding of circuit noise and fragile boundaries of tailored surface codes,

O. Higgott, T. C. Bohdanowicz, A. Kubica, S. T. Flammia, and E. T. Campbell, “Improved decoding of circuit noise and fragile boundaries of tailored surface codes,” Phys. Rev. X , vol. 13, p. 031007, Jul 2023

2023
[20]

Sparse Blossom: correcting a million errors per core second with minimum-weight matching,

O. Higgott and C. Gidney, “Sparse Blossom: correcting a million errors per core second with minimum-weight matching,” Quantum, vol. 9, p. 1600, Jan. 2025

2025
[21]

Almost-linear time decoding algo- rithm for topological codes,

N. Delfosse and N. H. Nickerson, “Almost-linear time decoding algo- rithm for topological codes,” Quantum, vol. 5, p. 595, 2021

2021
[22]

Decoding across the quantum low-density parity-check code landscape,

J. Roffe, D. R. White, S. Burton, and E. Campbell, “Decoding across the quantum low-density parity-check code landscape,” Physical Review Research, vol. 2, no. 4, p. 043423, 2020

2020
[23]

Bubble clustering decoder for quantum topological codes,

D. Forlivesi, L. Valentini, and M. Chiani, “Bubble clustering decoder for quantum topological codes,” IEEE Trans. on Comm. , 2025

2025
[24]

Impact of decoding latency in the assessment of quantum surface codes performance,

L. Valentini, D. Forlivesi, and M. Chiani, “Impact of decoding latency in the assessment of quantum surface codes performance,” in 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC) . IEEE, 2025, pp. 554–559

2025
[25]

Fault-tolerant quantum computation,

P. W. Shor, “Fault-tolerant quantum computation,” in Proceedings of 37th conference on foundations of computer science . IEEE, 1996, pp. 56–65

1996
[26]

Efficient fault-tolerant decoding of topological color codes,

A. M. Stephens, “Efficient fault-tolerant decoding of topological color codes,” arXiv preprint quant-ph/1402.3037 , 2014

work page arXiv 2014
[27]

The surface code with a twist,

T. J. Yoder and I. H. Kim, “The surface code with a twist,” Quantum, vol. 1, p. 2, 2017

2017
[28]

Fault-tolerant quantum computation with few qubits,

R. Chao and B. W. Reichardt, “Fault-tolerant quantum computation with few qubits,” npj Quantum Information , vol. 4, no. 1, p. 42, 2018

2018
[29]

Flag fault-tolerant error correction with arbitrary distance codes,

C. Chamberland and M. E. Beverland, “Flag fault-tolerant error correction with arbitrary distance codes,” Quantum, vol. 2, p. 53, Feb
[30]

Beverland , Date-Added =

[Online]. Available: http://dx.doi.org/10.22331/q-2018-02-08-53

work page doi:10.22331/q-2018-02-08-53 2018
[31]

Fault-tolerant magic state preparation with flag qubits,

C. Chamberland and A. W. Cross, “Fault-tolerant magic state preparation with flag qubits,” Quantum, vol. 3, p. 143, 2019

2019
[32]

Quantum low-density parity- check codes,

N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity- check codes,” PRX quantum , vol. 2, no. 4, p. 040101, 2021

2021
[33]

Magic-state distillation with low overhead,

S. Bravyi and J. Haah, “Magic-state distillation with low overhead,” Physical Review A—Atomic, Molecular , and Optical Physics , vol. 86, no. 5, p. 052329, 2012

2012
[34]

Time-efficient constant-space-overhead fault-tolerant quantum computation,

H. Yamasaki and M. Koashi, “Time-efficient constant-space-overhead fault-tolerant quantum computation,” Nature Physics, vol. 20, no. 2, pp. 247–253, 2024

2024
[35]

Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing,

H. Goto, “Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing,” arXiv preprint arXiv:2403.16054, 2024

work page arXiv 2024
[36]

Transversal clifford and T-gate codes of short length and high distance,

S. P. Jain and V . V . Albert, “Transversal clifford and T-gate codes of short length and high distance,” IEEE Journal on Selected Areas in Information Theory , 2025

2025
[37]

Daguerre, R

L. Daguerre, R. Blume-Kohout, N. C. Brown, D. Hayes, and I. H. Kim, “Experimental demonstration of high-fidelity logical magic states from code switching,” arXiv preprint arXiv:2506.14169 , 2025

work page arXiv 2025
[38]

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, 2010

2010
[39]

Flag fault-tolerant error correction for any stabilizer code,

R. Chao and B. W. Reichardt, “Flag fault-tolerant error correction for any stabilizer code,” PRX Quantum , vol. 1, no. 1, p. 010302, 2020

2020
[40]

Adaptive syndrome measurements for shor-style error correction,

T. Tansuwannont, B. Pato, and K. R. Brown, “Adaptive syndrome measurements for shor-style error correction,” Quantum, vol. 7, p. 1075, 2023

2023
[41]

Flag at origin: a modular fault-tolerant preparation for CSS codes,

D. Forlivesi and D. Amaro, “Flag at origin: a modular fault-tolerant preparation for CSS codes,” arXiv preprint arXiv:2508.14200 , 2025

work page arXiv 2025
[42]

Fault-tolerant syndrome extraction and cat state preparation with fewer qubits,

P. Prabhu and B. W. Reichardt, “Fault-tolerant syndrome extraction and cat state preparation with fewer qubits,” Quantum, vol. 7, p. 1154, Oct. 2023

2023