Metraipolis › archive › dc_429382fa8cb5

Building codes with transversal CCZ using projective geometry and SAT solvers — arXiv:2610.09341

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09341
License (as archived)
CC0-1.0
Archived
2026-10-08T12:46:35.313Z
SHA-256 of the archived text
c7e69c28afedc37ed18534cb3eeb2e7878422e2ee50222a0009c570fc5f8aab7
Stable URL of this page
https://metraipolis.com/documento/dc_429382fa8cb5

How to cite

Building codes with transversal CCZ using projective geometry and SAT solvers — arXiv:2610.09341 — arXiv (en), https://arxiv.org/abs/2610.09341 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_429382fa8cb5 (Metraipolis archive dc_429382fa8cb5, sha256 c7e69c28afedc37ed18534cb3eeb2e7878422e2ee50222a0009c570fc5f8aab7)
BibTeX
@misc{dc429382fa8cb5,
  title = {Building codes with transversal CCZ using projective geometry and SAT solvers — arXiv:2610.09341},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09341},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_429382fa8cb5; sha256 c7e69c28afedc37ed18534cb3eeb2e7878422e2ee50222a0009c570fc5f8aab7},
  year = {2026}
}

Archived text

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

We construct CSS codes with three logical qubits whose logical CCZ gate is implemented by transversal physical $T/T^{\dagger}$ gates and whose distance is at least $3$. These codes start with $8$-divisible $X$-stabilizers defined by projective geometry, which guarantees $d_Z\geq 3$. A SAT solver then finds three $X$-logical operators compatible with the transversal CCZ. We build codes at thirteen block lengths from $n=48$ to $n=496$, with $d_Z=3$ or $4$, and illustrate the method with the $[[48,3,3]]$ code $Q_{48}$. Additionally, we prove that no CSS code with three logical qubits, $Z$-distance at least $3$, and a quasi-transversal CCZ gate (transversal $T$ with a diagonal Clifford correction) exists below $n=39$. The $[[47,3,3]]$ code of Jacinto et al. serves as an upper bound, leaving $39\leq n\leq46$ open.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.09341 — 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-08T12:17:15.225Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).