Fault-tolerant syndrome extraction for the proposed compiler and cut-optimal protocols

Establish fault-tolerant syndrome-extraction protocols and fault-tolerance guarantees for the adaptive grid compiler and the cut-resource-optimal constructions for stabilizer-code syndrome measurement.

Background

The paper’s circuit constructions and lower bounds operate in an ideal, noiseless model. In particular, the adaptive grid compiler uses long chains of Bell measurements and intermediate measurements, while the cut-resource theorem optimizes the amount of nonlocal interaction rather than the total local processing time. The authors therefore do not establish fault tolerance for these constructions.

The unresolved issue is to determine whether the proposed syndrome-extraction methods can be made reliable in the presence of imperfect gates and measurements, including repeated correction rounds, accumulated errors in resource chains, and practical decoding requirements.

References

Theorem~\ref{thm:intro-grid} relies on long chains of Bell measurements whose errors would accumulate under noise, and part~\ref{it:intro-cut-upper} of Theorem~\ref{thm:intro-cut-cost} optimizes the crossing resource rather than the elapsed depth of local processing, so neither establishes fault tolerance, which we leave open together with the questions in Section~\ref{sec:discussion}.

— The Intrinsic Cost of Quantum Syndrome Extraction  (2609.39705 - Chu, 30 Sep 2026) in Section 1, Discussion preceding Section 2; Section 6, Discussion, paragraph “Noisy extraction”

Relating the intrinsic cut cost to the overhead of reliable repeated extraction remains open.

— The Intrinsic Cost of Quantum Syndrome Extraction  (2609.39705 - Chu, 30 Sep 2026) in Section 6, Discussion, paragraph “Noisy extraction”