Adaptive Window Decoding based on Spatiotemporal Complementary Gap

• URL: http://arxiv.org/abs/2605.14637v1
• Date: Thu, 14 May 2026 09:51:22 GMT
• Title: Adaptive Window Decoding based on Spatiotemporal Complementary Gap
• Abstract summary: We propose an adaptive decoding scheme in which window decoding is first performed with a small buffer size.<n>We show that the proposed scheme reduces the average buffer size by approximately 40% while maintaining the logical error rate.
• Score: 2.257125280672635
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Real-time decoding plays a crucial role in practical fault-tolerant quantum computing. Window decoding, in which the decoding problem is divided into windows, is a promising approach. While reducing the window size is desirable for faster decoding, each window contains a buffer region whose size must typically be at least the code distance to avoid degrading the logical error rate, which limits how much the window can shrink. In this paper, we propose an adaptive decoding scheme in which window decoding is first performed with a small buffer size and a decoding confidence (soft information) is computed; if the confidence is low, the buffer size is enlarged and decoding is redone. This approach reduces the average decoding time, since most shots are decoded with a small buffer. A central challenge in realizing this scheme is that existing forms of soft information are not directly applicable to window decoding, especially with a small buffer. We address this challenge by introducing a new form of soft information, the spatiotemporal complementary gap, specifically designed for this setting. Numerical simulations demonstrate that the proposed scheme reduces the average buffer size by approximately 40% while maintaining the logical error rate.

Related papers

• Faster Than Flash: Exploiting Attention Sparsity for Efficient Long-Context Decoding [51.48425605758328]
  We present Faster Flash Decoding (FFD), a novel hardware-algorithm co-design framework designed to break the memory wall in long-context decoding.<n>FFD integrates the selector and computer into a fully fused kernel, replacing external metadata indices with content-aware scanning.<n>It achieves up to 11.6x kernel-level speedup and scaling to 256K context length, with 2.37x end-to-end throughput improvement.
  arXiv  Detail & Related papers  (2026-08-31T15:13:20Z)
• ADaPT: Adaptive-window Decoding for Practical fault-Tolerance [2.3480266888270003]
  We propose an adaptive window decoding technique based on decoder confidence.<n>This technique reduces the overhead in decoding time thus reducing reaction time without compromising on logical error rates.
  arXiv  Detail & Related papers  (2026-05-01T22:49:42Z)
• Towards Practical Lossless Neural Compression for LiDAR Point Clouds [84.36825469211375]
  extreme sparsity of high-precision geometric details hinders efficient context modeling.<n>Our framework comprises two lightweight modules.<n>Experiments demonstrate competitive compression performance at real-time speed.
  arXiv  Detail & Related papers  (2026-03-26T10:02:07Z)
• Even More Efficient Soft-Output Decoding with Extra-Cluster Growth and Early Stopping [2.370310454459195]
  We introduce two types of novel soft-outputs: the bounded cluster gap and the extra-cluster gap.<n>The latter, the extra-cluster gap, quantifies decoder reliability by performing a small, additional growth of the clusters obtained by the decoder.<n>These techniques offer lower computational complexity and higher hardware compatibility.
  arXiv  Detail & Related papers  (2026-02-03T10:00:40Z)
• Sliding Window Attention for Learned Video Compression [67.57073402826292]
  This work introduces 3D Sliding Window Attention (SWA), a patchless form of local attention.<n>Our method significantly improves rate-distortion performance, achieving Bjorntegaard Delta-rate savings of up to 18.6 %.
  arXiv  Detail & Related papers  (2025-10-04T20:11:43Z)
• Fast and Fluent Diffusion Language Models via Convolutional Decoding and Rejective Fine-tuning [23.58934174168992]
  Autoregressive (AR) language models generate text one token at a time, which limits their inference speed.<n>We propose Convolutional decoding (Conv), a normalization-based method that narrows the decoding window without hard segmentation.<n>We also introduce Rejecting Rule-based Fine-Tuning (R2FT), a post-hoc training scheme that better aligns tokens at positions far from context.
  arXiv  Detail & Related papers  (2025-09-18T17:48:21Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Predictive Window Decoding for Fault-Tolerant Quantum Programs [5.258081366634739]
  Real-time decoding is a key ingredient in future fault-tolerant quantum systems.<n> Windowed decoding schemes require that some decoding tasks be delayed until others have completed.<n>We introduce a speculative window decoding scheme, taking inspiration from branch prediction in classical computer architecture.<n>We find that speculation reduces application runtimes by 40% on average compared to prior parallel window decoders.
  arXiv  Detail & Related papers  (2024-12-06T15:17:18Z)
• Fast Chain-of-Thought: A Glance of Future from Parallel Decoding Leads to Answers Faster [61.83949316226113]
  FastCoT is a model-agnostic framework based on parallel decoding. We show that FastCoT saves inference time by nearly 20% with only a negligible performance drop compared to the regular approach.
  arXiv  Detail & Related papers  (2023-11-14T15:56:18Z)
• Improved Noisy Syndrome Decoding of Quantum LDPC Codes with Sliding Window [0.0]
  We study sliding-window decoding, which corrects errors from previous syndrome measurement rounds while leaving the most recent errors for future correction. Remarkably, we find that this improvement may not cost a larger decoding complexity.
  arXiv  Detail & Related papers  (2023-11-06T17:56:49Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.