Papers
Topics
Authors
Recent
Search
2000 character limit reached

One-Shot any Code

Published 1 Oct 2026 in quant-ph and math-ph | (2610.02137v1)

Abstract: We first provide a simple proof showing that any single-shot code is self-correcting. We then show that any [[n,k]][[n,k]] CSS quantum low-density parity-check (QLDPC) code can be transformed into an [[nm,k]][[nm,k]] CSS QLDPC code with single-shot (SS) quantum error correction and an efficient local decoder which runs in O(log⁡m)O(\log m) parallel time. Below a constant threshold $p_{\rm RG}&gt;0$ for joint local stochastic physical and measurement noise, the logical failure probability over TT correction rounds is bounded by \begin{equation*} O(T n)\exp[-Ω(mα)] \end{equation*} for a constant $α&gt;0$; we say that the \textit{threshold} is pRGp_{\rm RG} and \textit{error suppression} is Ω(m<sup>α)Ω(m<sup>α). Moreover, if the input code is equipped with a single-shot decoder with threshold $p_c&gt;0$ and error suppression Ω(n<sup>β)Ω(n<sup>β), then the output code \textit{enhances} the error suppression to Ω(m<sup>α</sup>n<sup>β)Ω(m<sup>α</sup> n<sup>β), while maintaining the decoder-independent threshold pRGp_{\rm RG}, and thus \textit{enhanced} if $p_c &lt; p_{\rm RG}$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.