arXiv:2609.39705
The Intrinsic Cost of Quantum Syndrome Extraction
Chia-Tung Chu
Abstract
How much time is fundamentally required to extract the syndrome of a stabilizer code on hardware with a given connectivity graph? Previous bounds answer through a chosen list of checks (Delfosse, Beverland, and Tremblay, 2021) or through the global code parameters (Baspin, Fawzi, and Shayeghi, 2023). Here, we show that neither determines the interaction that a particular hardware cut requires. We therefore define the intrinsic cut cost, $χ$, directly from the stabilizer group, independent of the generating set used to describe the code. It is computable from the check matrix alone, and equals the mutual information across the cut in the maximally mixed code state. We show that every exact extraction circuit, however adaptive, needs at least $χ/2$ two-qubit operations across the cut, and alternatively with free local processing exactly $χ$ shared Bell pairs. Guided by this intrinsic cut cost, we construct annular surface codes with constant-depth local extraction that give a counterexample to Corollary 1 of Delfosse, Beverland, and Tremblay. Furthermore, for a fixed quantum Tanner family, $χ$ grows at least linearly with the size of every sufficiently small region, giving a depth guarantee at each corresponding bottleneck in every layout. This strengthens the global perspective of Baspin, Fawzi, and Shayeghi and, together with our matching square-grid construction, yields a tight space--depth tradeoff. Our results connect the interaction required by syndrome extraction to hardware communication capacity and thus provide a way to assess unavoidable circuit costs before committing to a particular layout.
AI Summary
The paper asks how hardware connectivity constrains the quantum interaction and depth required for stabilizer syndrome extraction, independently of the chosen check generators. It defines the intrinsic cut cost $\chi_U=\dim\mathcal S-\dim\mathcal S_U-\dim\mathcal S_{U^c}$, computable through three binary matrix ranks and equal to the mutual information across the cut in the maximally mixed code state. Every exact adaptive extraction circuit starting with product ancillas requires at least $\lceil\chi_U/2\rceil$ crossing two-qubit operations on every nonzero branch, or $\chi_U$ when crossing primitives are CNOTs. Thus a boundary with $b$ edges gives depth at least $\chi_U/(2b)$. With unrestricted local processing and sufficient storage, the exact resource cost is $\chi_U$ shared Bell pairs. The proof applies extraction to local data–reference Bell pairs: each conditional vectorized syndrome projector has flat Schmidt spectrum of rank $2^{\chi_U}$, limiting how quickly crossing operations can generate it. For a fixed quantum Tanner family, supported-stabilizer dimension estimates establish $\chi_U\ge2\tau|U|$ for every $|U|\le\eta n/2$, giving individual bottleneck bounds. A grid compiler achieves depth $O(\max\{1,n/\sqrt N\})$ for bounded-weight, bounded-incidence presentations on a suitable fixed placement, matching this family’s lower bound. Separately, annular surface codes with expanding recombined presentations admit depth-13 local extraction, contradicting the specified listed-check expansion corollary of DBT v1. The results concern noiseless extraction, not fault tolerance. The grid compiler assumes free classical feedforward and uses long Bell-measurement chains; its placement is chosen rather than prescribed. Single-cut resource optima exclude local processing depth, and recombined generators can become heavy.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 70 pages, 2 figures, 5 tables. Revised exposition and references; expanded worked examples