An unreviewed preprint posted to arXiv introduces SpiderCSS, a compilation pipeline designed to generate fault-tolerant state preparation circuits for Calderbank-Shor-Steane (CSS) codes. State preparation is a foundational primitive in fault-tolerant quantum computing, and producing verified, resource-efficient circuits for arbitrary CSS codes at scale has remained an open engineering challenge. The authors ground their approach in the ZX-calculus, a graphical formalism for quantum circuits, applying what they term "fault-equivalent rewrites" that preserve fault-tolerance guarantees throughout the compilation process.
The pipeline's central claim is that by construction—rather than by post-hoc verification—the output circuits are provably fault-tolerant, sidestepping the computational cost of separate verification steps. The authors further assert that their modular approach minimizes CNOT counts both within circuit components and in how those components are composed. Monte Carlo simulations across CSS codes up to distance 15 are reported to show a 33.7% average reduction in logical error rate and a 9.5% increase in acceptance rate relative to existing scalable and heuristic methods, alongside improvements in circuit depth and qubit footprint.
These results, if they survive peer review, would represent a meaningful step toward practical fault-tolerant state preparation at the code distances relevant to near-future hardware. The paper makes specific quantitative claims tied to simulation rather than physical experiment, and the scope is currently limited to the CSS code family. As with all arXiv preprints, the findings have not yet undergone formal peer review, and independent validation of the simulations and fault-tolerance proofs will be necessary before the community can assess the full scope of the contribution.