These results distinguish logical robustness from local-stochastic residual-noise control from local-stochastic residual-noise control and identify decoder consistency as a route to single-shot initialization.
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.
Stabilizer measurements provide a direct route to preparing quantum error-correcting codes and long-range entangled states. In realistic implementations, however, finite measurement strength can coherently deform the encoding map away from the projective limit. Certain nonlocal signatures associated with long-range ord...
Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Rece...
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay et al.· 1 citation
Recent work established that, for independent erasures, storing $K$ logical qubits for $S$ time steps with error at most $\varepsilon$ requires a spacetime cost of $\Omega(S(K+\log(S/\varepsilon)))$. A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be ac...
Kishor Bharti, T. Haug, Derek Khu et al.· 0 citations
Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes also requires an efficient mechanism to implement non-Clifford gates in a fault-tolerant manner. We introduce a space-time-efficient magic sta...
Varun Menon, Rohan Mehta, An-Di Gu et al.· 2 citations
A soft beam search decoder for quantum low-density parity-check codes that uses internal decoder data as a confidence metric, removing the need for extra computation is introduced.
Arda Aydin, Edwin Tham, Nicolas Delfosse et al.· 3 citations
Random unitaries scramble quantum information into highly nonlocal degrees of freedom, thereby providing protection from local noise. However, as demonstrated by Turkeshi and Sierant (Phys. Rev. Lett. 132, 140401, 2024 and arXiv:2603.00235), this protection may fail once local noise grows sufficiently strong. These wor...
Emanuel Dallas, Mario Morford-Oberst, Eric Weine· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.