Metraipolis › archive › dc_87fe91bc349f

Syndrome measurements enable deterministic fault-tolerant $T$ gates — arXiv:2609.29890

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29890
License (as archived)
CC0-1.0
Archived
2026-10-08T07:36:54.015Z
SHA-256 of the archived text
6757297772905eebfc5b4e176e525f9463352563beff268175b42cc1313bd3f1
Stable URL of this page
https://metraipolis.com/documento/dc_87fe91bc349f

How to cite

Syndrome measurements enable deterministic fault-tolerant $T$ gates — arXiv:2609.29890 — arXiv (en), https://arxiv.org/abs/2609.29890 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_87fe91bc349f (Metraipolis archive dc_87fe91bc349f, sha256 6757297772905eebfc5b4e176e525f9463352563beff268175b42cc1313bd3f1)
BibTeX
@misc{dc87fe91bc349f,
  title = {Syndrome measurements enable deterministic fault-tolerant $T$ gates — arXiv:2609.29890},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29890},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_87fe91bc349f; sha256 6757297772905eebfc5b4e176e525f9463352563beff268175b42cc1313bd3f1},
  year = {2026}
}

Archived text

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

Non-Clifford gates are essential for universal quantum computation, yet implementing them fault-tolerantly remains a central challenge for stabilizer codes. Here, we show how a syndrome degree of freedom can mediate a logical non-Clifford gate. Releasing one stabilizer check makes an additional logical qubit available within the encoded data block. Two Pauli rotations, followed by syndrome measurement and Clifford feed-forward, then implement a deterministic logical $T$ gate on every stabilizer code of distance at least two, in a suitable logical basis. During the ideal rotations, the state remains in an intermediate stabilizer code whose distance we determine exactly. For pure codes with a balanced factorization, this distance grows with the original code distance, whereas the maximum weight of the stabilizer generators bounds the intermediate distance from above. We realize the mechanism in two circuits that tolerate a single fault under local stochastic circuit noise: a fixed 22-qubit construction admitting recursive error suppression and a direct Golay-code gate protected by measuring a stabilizer check transported through the non-Clifford rotation, which can recover the unknown encoded state even after rejection. Serial implementations with ancilla reuse, reset, and flexible two-qubit connectivity require at most 33 and 32 physical qubits, respectively. These results establish a general mechanism for logical non-Clifford gates and demonstrate how syndrome measurements and recovery can protect the intermediate evolution of encoded information.

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