Metraipolis › archive › dc_9133fdfbd895

Diagnosing and Restoring the Degraded Fault Distance of Magic State Cultivation — arXiv:2609.17706

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17706
License (as archived)
CC0-1.0
Archived
2026-10-15T17:14:04.246Z
SHA-256 of the archived text
300bafe3efeb1fa070a07b9dcb6ec31ee67c399cdf96a51a2ce8eb408b22f827
Stable URL of this page
https://metraipolis.com/documento/dc_9133fdfbd895

How to cite

Diagnosing and Restoring the Degraded Fault Distance of Magic State Cultivation — arXiv:2609.17706 — arXiv (en), https://arxiv.org/abs/2609.17706 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9133fdfbd895 (Metraipolis archive dc_9133fdfbd895, sha256 300bafe3efeb1fa070a07b9dcb6ec31ee67c399cdf96a51a2ce8eb408b22f827)
BibTeX
@misc{dc9133fdfbd895,
  title = {Diagnosing and Restoring the Degraded Fault Distance of Magic State Cultivation — arXiv:2609.17706},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17706},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9133fdfbd895; sha256 300bafe3efeb1fa070a07b9dcb6ec31ee67c399cdf96a51a2ce8eb408b22f827},
  year = {2026}
}

Archived text

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

T-state cultivation is a resource-efficient protocol producing logical T states but recent benchmarks show that its logical error rate is considerably higher than intended i.e. than S-state cultivation, which is the analogous protocol for producing logical S states. In this paper, we explain this T-S discrepancy by analytically showing, under circuit-level depolarising noise, that distance-3 (-5) T-state cultivation has fault distance 2 (3) due to Pauli hook errors that propagate to coherent Clifford errors after its final double-check circuit; such errors remain Pauli in S-state cultivation, which consequently retains fault distance 3 (5). As part of our analysis we derive a general formula, and an $\mathcal O(n^3)$-time algorithm for fixed logical-qubit count, for the acceptance probability of a logical mixed state afflicted with a Clifford error, where $n$ is the physical qubit count. We then design flags that detect the malignant hook errors in cultivation, improving the pre-escape logical error rate from $\Theta(p^3)$ to $\Theta(p^5)$. At noise level $p =10^{-3}$, this is a 4.9$\times$ improvement, costing a 1.36$\times$ increase in attempts per accepted shot.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-17 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.17706 — 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-15T16:20:45.829Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).