Metraipolis › archive › dc_68595c2dd797

The Intrinsic Cost of Quantum Syndrome Extraction — arXiv:2609.39705

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39705
License (as archived)
CC0-1.0
Archived
2026-10-07T14:40:48.969Z
SHA-256 of the archived text
303920b97b33247087f11b8b97e5192acb838d9d80331836c1b29e79d2428501
Stable URL of this page
https://metraipolis.com/documento/dc_68595c2dd797

How to cite

The Intrinsic Cost of Quantum Syndrome Extraction — arXiv:2609.39705 — arXiv (en), https://arxiv.org/abs/2609.39705 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_68595c2dd797 (Metraipolis archive dc_68595c2dd797, sha256 303920b97b33247087f11b8b97e5192acb838d9d80331836c1b29e79d2428501)
BibTeX
@misc{dc68595c2dd797,
  title = {The Intrinsic Cost of Quantum Syndrome Extraction — arXiv:2609.39705},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39705},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_68595c2dd797; sha256 303920b97b33247087f11b8b97e5192acb838d9d80331836c1b29e79d2428501},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39705. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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, $\chi$, 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 $\chi/2$ two-qubit operations across the cut, and alternatively with free local processing exactly $\chi$ 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, $\chi$ 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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.IT).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.39705 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:14:20.800Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).