arXiv:2610.38847
Local Quantum Fault Tolerance Without Expansion
David Ponarovsky
Abstract
We study fault-tolerant quantum computation using a fixed, local error-correction rule and a geometrically simple code: the cubical $(d,d')$-Toric code with $d',d-d'\geq 2$, including the 4D Toric code. Under sufficiently weak local-stochastic Pauli noise, our construction uses noiseless, bounded-depth classical processing per physical time step. Its correction cycle acts only on the current syndrome, has constant depth, and is repeated unchanged during idle logical computation; it requires neither multiscale decoder states nor scale-dependent communication delays. Our proof treats errors and syndromes as chains in a cubical complex, combining geometric shrinking under the sweep rule with a space--time explanation-tree argument inspired by Toom's theorem. It does not rely on expansion. We establish three results: 1.Explicit higher-dimensional sweep rule. We give a local algorithm for choosing sweep corrections on cubical $(d,d')$-Toric complexes, resolving the local-existence question of Kubica and Preskill. 2. Fault-tolerant computation. We prove a circuit-level threshold theorem for noisy sweep cycles interleaved with logical gates. In particular, the 4D Toric code admits a fixed, constant-depth syndrome-based correction cycle without a multiscale decoder or expansion-based encoding. We do not claim constant total-depth overhead. 3. Ideal decoding under local-stochastic noise. For an initial local-stochastic Pauli error of rate $p$ below threshold, $n^{d+1}$ noiseless sweep cycles recover the encoded state on a side-length-$n$ $(d,d')$-Toric code with probability at least $1-O(\operatorname{poly}(n))p^{Ω(n)}$, extending earlier guarantees for independent errors.
AI Summary
Can a nonexpanding topological code support fault-tolerant computation with a fixed local correction rule using only the current syndrome? This paper studies cubical $(d,d')$-toric codes with $d',d-d'\geq2$, including the 4D toric code. Its repeated sweep cycle has constant depth, uses bounded-depth noiseless classical processing, and requires neither persistent decoder state nor multiscale communication or timing hardware. The paper constructs higher-dimensional local sweep corrections, resolving the local-existence question identified by Kubica and Preskill. It then establishes a circuit-level threshold under local-stochastic Pauli noise, allowing correlated faults. Below a constant rate $p_0$, a width-$w$, depth-$\mu$ circuit has a 4D-toric-code simulation with logical failure probability $O(\operatorname{poly}(w,\mu,n))p^{\Omega(n)}$. The stated simulation depth is $\Theta(\mu(n+\operatorname{polylog}n))$ and width is $\Theta((w+\mu)n^8\operatorname{polylog}n)$. Separately, $n^{d+1}$ noiseless sweep cycles correct an initial local-stochastic Pauli error with failure probability $O(\operatorname{poly}(n))p^{\Omega(n)}$, extending earlier independent-error guarantees. The proof combines chain-complex constructions and deterministic geometric shrinking with Toom-style space–time explanation trees. A barrier argument connects logical failure to an intermediate syndrome component of span $\Omega(n)$; counting explanations bounds the probability of such components without expansion or a per-round local-stochastic invariant. Constant depth applies only to recurring correction, not logical gates or the complete simulation. The construction assumes reliable classical computation, synchronous updates, and native higher-dimensional connectivity; it does not resolve lower-dimensional embedding costs. Logical gates use teleportation and longer classical decoding, while fault-tolerant initialization is imported from existing constructions.
Central claim may not hold: The supplied threshold argument assumes exact boundary syndromes and does not establish how faults in syndrome-extraction circuits, including incorrect reported outcomes, are covered by its local-stochastic fault-layer model. Claim:sweepface incorrectly asserts a single predecessor satisfying incompatible potential inequalities, whereas its proof supplies potentially different predecessors for different potentials.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.