Single-shot state preparation threshold: rigorous theorem and statistical mechanical mapping
Preparing logical codewords with a single round of noisy syndrome measurements can reduce the time overhead of fault-tolerant quantum computation. It remains unclear which structural properties of the code suffice to guarantee a threshold for single-shot state preparation. Here we prove that linear confinement suffices for a nonzero single-shot state-preparation threshold for CSS quantum low-density parity-check codes, in contrast to the common belief that soundness is necessary. When the distance is at least logarithmic, we prove that below nonzero local stochastic readout and data error thresholds, the logical error probability after a formal ideal final recovery is exponentially small and approaches zero when the code size approaches infinity. Under the stronger assumption of linear soundness, we show that the residual data error of the preparation protocol is local stochastic, directly allowing composition with other fault-tolerant gadgets. To investigate single-shot state-preparation threshold beyond the above assumptions, we further develop a statistical mechanical mapping that expresses the final logical error rate in terms of a classical partition function. We perform Monte Carlo simulations of this model for the three-dimensional toric code. The numerical results suggest that sublinear soundness can also support a single-shot state-preparation threshold.