Frontend
Building codes with transversal CCZ using projective geometry and SAT solvers
arXiv math.IT0 views
arXiv:2610.09341v1 Announce Type: cross 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.
Source:https://arxiv.org/abs/2610.09341PreviousTightness and Error Exponents of SDP with Logarithmically Many CommunitiesNextThe Silhouette Operator: Identifiability of Low-Rank Measures from One-Dimensional Projections
Related posts
Showing Local-Currency Prices Next to Crypto Amounts With Cached Exchange Rates
0dev.to WebDev
Generating Localised Open Graph Images per Language at Build Time
0dev.to WebDev
Free vs Paid Next.js SaaS Boilerplates (2026): What You Actually Get
0dev.to WebDev
ShipFast Alternative for Next.js App Router (2026): Honest Comparison
0dev.to WebDev
Find Duplicate Files in the Browser: SHA-256 Groups, Not Uploads
0dev.to WebDev
Why Your Next.js Page Returns 200 OK but Still Isn't Indexed
0dev.to WebDev