Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.02137

One-Shot any Code

Andrew C. Yuan

quant-phmath-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

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

AI Summary

Can arbitrary CSS QLDPC codes acquire single-shot protection without losing bounded check weight and qubit degree? This paper gives a recursive construction mapping an $[[n,k]]$ input to an $[[nm,k]]$ output, preserving $k$ and LDPC bounds up to constants depending on the input sparsity. Under joint local-stochastic data and measurement noise below a constant threshold $p_{\rm RG}>0$, the claimed failure bound over $T$ correction rounds is $O(Tn)(p/p_{\rm RG})^{\Omega(m^\alpha)}$, for a constant $\alpha>0$. The protocol uses one noisy syndrome-extraction round per correction and a final perfect measurement for assessing success. Its RG decoder takes $O(\log m)+\tau_{\rm seed}$ parallel time. If the seed has a single-shot decoder with threshold $p_c$ and suppression $\Omega(n^\beta)$, sufficient overhead gives suppression $\Omega(m^\alpha n^\beta)$, with a seed-decoder-independent threshold. The proof combines recursive code blow-ups with syndrome repair and cleaning. Cleaning contracts syndrome weight by $4/9$ per level; repair preserves a net contraction despite measurement faults. Bounded-degree hierarchical witness graphs control fault entropy and transfer the noise to a strongly suppressed effective seed process. Constant-duration local repair sweeps provide the parallel implementation. Separately, a Gibbs-syndrome local-stochastic bound establishes single-shot correction implies self-correction through decoder stability. The construction does not guarantee three-dimensional geometric locality or constant encoding rate as overhead grows. Practical constants and integration with fast surgery remain unresolved. The formal setup assumes local triviality of the seed; the explicit construction also uses simplifying incidence/connectivity hypotheses, whose removal is deferred to referenced work.

Little sign of AI-generated textOverclaimsStrong assumptionsPossible error

Central claim may not hold: The formal RG decoder has parallel runtime O(log m) + tau_seed, and the paper does not establish that the valid seed-decoding task can always be implemented within the abstract's unconditional O(log m) bound. The threshold proof requires a locally trivial seed and uses that assumption essentially, whereas the abstract covers arbitrary CSS QLDPC inputs without supplying a reduction that establishes this property.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
The simple proof (single-shot implies self-correction) is only 2 pages, and independent of everything else

Related papers

Single-shot state preparation thresholds in quantum LDPC codes: soundness, confinement, and statistical mechanics

Yuanchen Zhao, Yi Yuan, Zhengyi Han +1 more

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.

quant-pharXiv:2609.39965•Oct 1, 2026•0 citations

Single-Shot Decoding of Good Quantum LDPC Codes

Shouzhen Gu, Eugene Tang, Libor Caha +3 more

Abstract Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Zémor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.

arXiv:2306.12470•Communications in Mathematical Physics•Mar 1, 2024•58 citations

Coherent error threshold for quantum LDPC codes

Zhengyi Han, Yuanchen Zhao, Yijia Xu +2 more

A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance $d=Ω(\log n)$, we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.

quant-pharXiv:2609.20537•Sep 18, 2026•1 citation

Mirror codes: High-threshold quantum LDPC codes beyond the CSS regime

Andrey Boris Khesin, Jonathan Z. Lu

The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group $G$ and two subsets of $G$ whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find $[[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]]$, and $[[ 85, 8, 9 ]]$ codes, all of which are not CSS; we also find several weight-7 codes with $kd > n$. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of $0.2\%$, approximately matching that of the $[[ 144, 12, 12 ]]$ BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.

quant-pharXiv:2603.05496•Mar 6, 2026•9 citations

Increasing memory lifetime of quantum low-density parity check codes with sliding-window noisy syndrome decoding

Shilin Huang, Shruti Puri

Quantum error correction (QEC) with single-shot decoding enables the reduction of errors after every single round of noisy stabilizer measurement, easing the time-overhead requirements for fault tolerance. Notably, several classes of quantum low-density parity check (qLDPC) codes are known which facilitate single-shot decoding, potentially giving them an additional overhead advantage. However, the perceived advantage of single-shot decoding is limited because it can significantly degrade the effective code distance. This degradation may be compensated for by using a much larger code size to achieve the desired target logical error rate, at the cost of increasing the amount of syndrome information to be processed, as well as increasing complexity of logical operations. Alternatively, in this paper we study sliding-window decoding, which corrects errors from previous syndrome measurement rounds while leaving the most recent errors for future correction. We observe that sliding-window decoding significantly improves the logical memory lifetime and hence the effective distance compared to single-shot decoding on hypergraph-product codes and lifted-product codes. Remarkably, we find that this improvement may not cost a larger decoding complexity. Thus, the sliding-window strategy can be more desirable for fast and accurate decoding for fault-tolerant quantum computing with qLDPC codes.

arXiv:2311.03307•Physical Review A•Jul 22, 2024•17 citations

Self-dual Stacked Quantum Low-Density Parity-Check Codes

Ze-Chuan Liu, Chong-Yuan Xu, Yong Xu

Quantum low-density parity-check (qLDPC) codes are promising candidates for fault-tolerant quantum computation due to their high encoding rates and distances. However, implementing logical operations using qLDPC codes presents significant challenges. Previous research has demonstrated that self-dual qLDPC codes facilitate the implementation of transversal Clifford gates. Here we introduce a method for constructing self-dual qLDPC codes by stacking non-self-dual qLDPC codes. Leveraging this methodology, we develop double-chain bicycle codes, double-layer bivariate bicycle (BB) codes, double-layer twisted BB codes, and double-layer reflection codes, many of which exhibit favorable code parameters. Additionally, we conduct numerical calculations to assess the performance of these codes as quantum memory under the circuit-level noise model, revealing that the logical failure rate can be significantly reduced with high pseudo-thresholds.

quant-pharXiv:2602.15372•Feb 18, 2026•4 citations
We first provide a simple proof showing that any single-shot code is self-correcting. We then show that any [[n,k]][[n,k]][[n,k]] CSS quantum low-density parity-check (QLDPC) code can be transformed into an [[nm,k]][[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)O(logm) parallel time. Below a constant threshold pRG>0p_{\rm RG}>0pRG​>0 for joint local stochastic physical and measurement noise, the logical failure probability over TTT correction rounds is bounded by \begin{equation*}
O(T n)\exp[-Ω(m^α)] \end{equation*} for a constant α>0α>0α>0; we say that the \textit{threshold} is pRGp_{\rm RG}pRG​ and \textit{error suppression} is Ω(mα)Ω(m^α)Ω(mα). Moreover, if the input code is equipped with a single-shot decoder with threshold pc>0p_c>0pc​>0 and error suppression Ω(nβ)Ω(n^β)Ω(nβ), then the output code \textit{enhances} the error suppression to Ω(mαnβ)Ω(m^α n^β)Ω(mαnβ), while maintaining the decoder-independent threshold pRGp_{\rm RG}pRG​, and thus \textit{enhanced} if pc<pRGp_c < p_{\rm RG}pc​<pRG​.
Can arbitrary CSS QLDPC codes acquire single-shot protection without losing bounded check weight and qubit degree? This paper gives a recursive construction mapping an [[n,k]][[n,k]][[n,k]] input to an [[nm,k]][[nm,k]][[nm,k]] output, preserving kkk and LDPC bounds up to constants depending on the input sparsity.
Under joint local-stochastic data and measurement noise below a constant threshold pRG>0p_{\rm RG}>0pRG​>0, the claimed failure bound over TTT correction rounds is O(Tn)(p/pRG)Ω(mα)O(Tn)(p/p_{\rm RG})^{\Omega(m^\alpha)}O(Tn)(p/pRG​)Ω(mα), for a constant α>0\alpha>0α>0. The protocol uses one noisy syndrome-extraction round per correction and a final perfect measurement for assessing success. Its RG decoder takes O(log⁡m)+τseedO(\log m)+\tau_{\rm seed}O(logm)+τseed​ parallel time. If the seed has a single-shot decoder with threshold pcp_cpc​ and suppression Ω(nβ)\Omega(n^\beta)Ω(nβ), sufficient overhead gives suppression Ω(mαnβ)\Omega(m^\alpha n^\beta)Ω(mαnβ), with a seed-decoder-independent threshold.
The proof combines recursive code blow-ups with syndrome repair and cleaning. Cleaning contracts syndrome weight by 4/94/94/9 per level; repair preserves a net contraction despite measurement faults. Bounded-degree hierarchical witness graphs control fault entropy and transfer the noise to a strongly suppressed effective seed process. Constant-duration local repair sweeps provide the parallel implementation. Separately, a Gibbs-syndrome local-stochastic bound establishes single-shot correction implies self-correction through decoder stability.
The construction does not guarantee three-dimensional geometric locality or constant encoding rate as overhead grows. Practical constants and integration with fast surgery remain unresolved. The formal setup assumes local triviality of the seed; the explicit construction also uses simplifying incidence/connectivity hypotheses, whose removal is deferred to referenced work.
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.
Abstract Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Zémor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.
A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance d=Ω(log⁡n)d=Ω(\log n)d=Ω(logn), we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group GGG and two subsets of GGG whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find [[60,4,10]],[[36,6,6]],[[48,8,6]][[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]][[60,4,10]],[[36,6,6]],[[48,8,6]], and [[85,8,9]][[ 85, 8, 9 ]][[85,8,9]] codes, all of which are not CSS; we also find several weight-7 codes with kd>nkd > nkd>n. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of 0.2%0.2\%0.2%, approximately matching that of the [[144,12,12]][[ 144, 12, 12 ]][[144,12,12]] BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.
Quantum error correction (QEC) with single-shot decoding enables the reduction of errors after every single round of noisy stabilizer measurement, easing the time-overhead requirements for fault tolerance. Notably, several classes of quantum low-density parity check (qLDPC) codes are known which facilitate single-shot decoding, potentially giving them an additional overhead advantage. However, the perceived advantage of single-shot decoding is limited because it can significantly degrade the effective code distance. This degradation may be compensated for by using a much larger code size to achieve the desired target logical error rate, at the cost of increasing the amount of syndrome information to be processed, as well as increasing complexity of logical operations. Alternatively, in this paper we study sliding-window decoding, which corrects errors from previous syndrome measurement rounds while leaving the most recent errors for future correction. We observe that sliding-window decoding significantly improves the logical memory lifetime and hence the effective distance compared to single-shot decoding on hypergraph-product codes and lifted-product codes. Remarkably, we find that this improvement may not cost a larger decoding complexity. Thus, the sliding-window strategy can be more desirable for fast and accurate decoding for fault-tolerant quantum computing with qLDPC codes.
Quantum low-density parity-check (qLDPC) codes are promising candidates for fault-tolerant quantum computation due to their high encoding rates and distances. However, implementing logical operations using qLDPC codes presents significant challenges. Previous research has demonstrated that self-dual qLDPC codes facilitate the implementation of transversal Clifford gates. Here we introduce a method for constructing self-dual qLDPC codes by stacking non-self-dual qLDPC codes. Leveraging this methodology, we develop double-chain bicycle codes, double-layer bivariate bicycle (BB) codes, double-layer twisted BB codes, and double-layer reflection codes, many of which exhibit favorable code parameters. Additionally, we conduct numerical calculations to assess the performance of these codes as quantum memory under the circuit-level noise model, revealing that the logical failure rate can be significantly reduced with high pseudo-thresholds.