Building codes with transversal CCZ using projective geometry and SAT solvers

Abstract: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.

40 pages, 3 figures. Code and data: this https URL

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2610.09341 [quant-ph]

(or arXiv:2610.09341v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.09341 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.