Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.03714

SpiderCSS: Scalable Fault-Tolerant CSS State Preparation

Boldizsár Poór·Andrey Boris Khesin·Sarah Meng Li·Benjamin Rodatz·John van de Wetering·Richie Yeung
View original source ↗Read source document ↗Export metadata ↓

Abstract

Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalable compilation pipeline that generates highly-optimized, fault-tolerant state preparation circuits for arbitrary Calderbank-Shor-Steane (CSS) codes. Starting from an idealized specification of a CSS state, we use the ZX-calculus and fault-equivalent rewrites to construct a diagram that prepares the given state while preserving the fault tolerance of the initial ideal ZX-diagram. From this diagram, SpiderCSS constructs a fault-tolerant CSS-state preparation circuit using a modular construction that is CNOT-minimal both within each component and also in the way these components are connected together. By only using fault-equivalent rewrites, the final circuit is provably fault-tolerant without needing expensive verification. Monte Carlo simulations across a variety of CSS codes up to distance 15 show that SpiderCSS scales efficiently and constructs circuits with substantially reduced depth and qubit footprint compared to existing scalable and heuristic methods, while simultaneously achieving an average decrease of 33.7% in logical error rate and an increase of 9.5% in acceptance rate.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li, Benjamin Rodatz, John van de Wetering, Richie Yeung. 2026-10-02. SpiderCSS: Scalable Fault-Tolerant CSS State Preparation. https://arxiv.org/abs/2610.03714

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Hamiltonian-Level Certificate for Network-Free Distributed Quantum Simulation:Exact Tensor-Separability Criterion and Approximate Residual Bounds

Circuit cutting allows quantum circuits to be evaluated on smaller devices at the cost of additional sampling and classical reconstruction. For Hamiltonian-simulation circuits, the target unitary $\exp[it\mathbf H]$ connects this decomposition problem to the structure of the generator. We develop a Hamiltonian-level certificate that assesses exact separability and the accuracy of independent module evolution before a gate decomposition is chosen. For a time-independent Hamiltonian and a fixed module partition, the Hilbert--Schmidt projection onto sums of module-local terms isolates a cross-module residual $H_{ns}$. Its vanishing is necessary and sufficient for product evolution at all times; for Pauli-list inputs, this condition is checked in one pass over the combined coefficients. When $H_{ns}\ne0$, the projected evolution has operator-norm error at most $|t| ||H_{ns}||_{op}$. Across a bipartition, an explicit first-order algebraic correction has the same operator-Schmidt rank as $H_{ns}$ and leaves a second-order residual. The same Hamiltonian residual connects this approximation to short-time entanglement, determining the leading state-space and operator-space entangling powers and, through its Schmidt spectrum, the leading Choi tripartite-information terms. Numerical experiments test these relations and demonstrate block-factorised simulation up to $20$ qubits.

quant-ph↗
arXiv2026

Bare-ancilla fault-tolerant syndrome extraction: General extensions of distance-three codes and structural criteria for graph codes

The reliability of quantum computation critically depends on the performance of quantum error-correcting codes (QECCs). Performance of QECCs can be severely degraded by hook errors, which effectively reduce the code distance. We develop a systematic framework for bare-ancilla syndrome extraction in $[[n,k,3]]$ stabilizer codes. It provides a criterion for a specific single ancilla fault model and jointly searches for suitable stabilizer generators and data-ancilla interaction orders to correct hook errors. We call such stabilizer generator sets bare-ancilla codes (BACs). We also present two constructions that enlarge the set of valid BACs while preserving minimum distance, either by keeping the number of logical qubits fixed or by increasing it. Under the correlated-data error model, $3177$ $[[7,1,3]]$ graph codes are found to be BACs out of $3379$ and all $335415$ $[[8,1,3]]$ graph codes are BACs. We tested $500$ $[[7,1,3]]$ and $1000$ $[[8,1,3]]$ graph codes in the presence of anisotropic and depolarizing noise. The number of data-ancilla interactions is an important predictor of the pseudo-threshold of these graph codes. In the analyzed codes, the BAC, which works with the bare ancilla method, usually performs well or better than the flag method, particularly for depolarizing noise. Notably, we report new bare ancilla codes, namely $[[6,1,3]]$ and $[[7,1,3]]$ with improved code rate compared to the bare code used in the work of Muyuan Li \emph{et al.} and Maheshwari \emph{et al.} respectively.

quant-ph↗
arXiv2026

Q-PIPE: A Practical Quantum Phase Encoding Method

Efficient loading of classical data into quantum states remains a central bottleneck of quantum computing. We propose Quantum-Gray Phase Injection for Pixel Encoding (Q-PIPE), which writes continuous data into the eigenphases of a diagonal oracle by phase kickback and converts them coherently into computational-basis states by quantum phase estimation. Sums and differences between data sets are obtained by sequential oracle application, without quantum arithmetic circuits. We apply Q-PIPE to quantum image processing, using edge detection by directional finite differences as a proof of concept. Synthesized with uniformly controlled rotations, the oracle requires O(qN) controlled-NOT gates without ancillas for N pixels and q estimation qubits. This is the same scaling as optimized preparation of the novel enhanced quantum representation, whose output form Q-PIPE reproduces. A half-spectrum normalization removes phase aliasing, and a probability threshold derived from the phase-estimation kernel and scaled with image size controls spectral leakage. In ideal simulation, edge detection is exact for inputs commensurate with the estimation register and has low mean absolute error for continuous data. Under device noise models, multi-controlled-phase synthesis drives the output close to the maximally mixed state. The uniformly controlled synthesis instead reduces the compiled depth by a factor of 53--59 and preserves the edge structure (Pearson correlation r = 0.99 with the classical gradient). The limiting resource on current hardware is therefore the compiled oracle depth, not the encoding principle.

quant-ph↗