arXiv:2609.39965
Single-shot state preparation thresholds in quantum LDPC codes: soundness, confinement, and statistical mechanics
Yuanchen Zhao, Yi Yuan, Zhengyi Han, Dong E. Liu
Abstract
Single-shot error correction does not by itself establish equally direct and robust logical-state initialization. We study preparation of CSS quantum low-density parity-check code states using one noisy round of the code's checks. We prove that linear confinement over a weight range growing at least logarithmically, together with at least logarithmic distance, suffices for a nonzero threshold under independent local-stochastic readout and data noise in the relevant CSS sector. The threshold is certified by ideal recovery of a decoder-defined logical channel. The key is a correction rule that preserves the logical class under local syndrome changes, allowing the proof to proceed without a local-stochastic bound on the preparation residual. This gives a single-block guarantee for quantum expander codes without dimension jumps or batching. Under the stronger linear-soundness hypothesis, we establish local-stochastic residual noise, enabling composition with compatible fault-tolerant gadgets. For a retained-record formulation, we also derive an exact statistical-mechanical representation of optimal final recovery at fixed preparation decoder. A decoder-dependent logical-sector order parameter characterizes asymptotically successful block decoding. Monte Carlo results for the three-dimensional toric code provide finite-size evidence for a threshold beyond both linear sufficient conditions. These results distinguish logical robustness from local-stochastic residual-noise control and identify decoder consistency as a route to single-shot initialization.
AI Summary
Single-shot error correction does not automatically guarantee initialization from an unencoded state. This paper studies CSS qLDPC state preparation by measuring checks once, with local-stochastic readout noise followed by independent local-stochastic data noise in the relevant CSS sector. The main theorem establishes a nonzero logical-recoverability threshold when the syndrome map has constant linear confinement up to weight $t=\Omega(\log n)$ and distance $d_X=\Omega(\log n)$. Constructed syndrome and data decoders give $P_{\rm fail}\leq(1+d_v)n\,a(p,q)^{\lfloor\min\{t,d_X/2\}\rfloor}$, where $a(p,q)$ vanishes with the noise rates. The proof makes corrections consistent under single-qubit syndrome changes; confinement and distance ensure path independence modulo stabilizers. This applies to quantum expander codes without batching or dimension jumps. Under stronger linear soundness over an extensive range, minimum-weight decoding additionally yields local-stochastic preparation residuals, supporting composition with compatible fault-tolerant gadgets. For retained preparation records, an exact statistical-mechanical mapping expresses logical-sector posteriors as partition functions. A decoder-dependent order parameter approaches one exactly when optimal block-recovery success approaches one. Three-dimensional toric-code simulations at $L=3,4,5$ show crossings near data-error rates $p=0.230,0.227,0.221$ for readout rates $q=0,p/10,p/5$, respectively, providing finite-size evidence beyond the linear hypotheses. The confinement guarantee uses ideal final recovery of a decoder-defined extension to arbitrary logical inputs, not composition with noisy correction. No general efficient construction of the consistent decoder is supplied. The numerical decoder is not proved consistent, and the small-system crossings do not establish an asymptotic threshold.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.