LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes

• URL: http://arxiv.org/abs/2605.17796v1
• Date: Mon, 18 May 2026 03:20:14 GMT
• Title: LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes
• Abstract summary: Quantum Tanner codes are a family of quantum error-correcting codes characterized by favorable performance characteristics.<n>This work introduces LEAD (Local Ensemble-Assisted Decoder), a iteration structure-aware decoding framework tailored for quantum Tanner codes.
• Score: 2.9323930362455974
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Tanner codes are a recently developed family of quantum error-correcting codes characterized by favorable asymptotic performance characteristics. Despite their theoretical potential, practical decoding algorithms that effectively leverage their structural properties remain limited. This work introduces LEAD (Local Ensemble-Assisted Decoder), a structure-aware decoding framework tailored for quantum Tanner codes. The proposed scheme leverages the decomposable structure of Cayley complexes to project the global code onto overlapping local subcodes defined by vertex neighborhoods, where error probabilities are estimated in parallel. To ensure global consistency, LEAD utilizes the inherent topological symmetry of the complex and introduces a soft-information regularization mechanism to mitigate local overconfidence during information aggregation. This framework enables highly parallelized, low-complexity decoding that is intrinsically compatible with various local search heuristics. Simulation results demonstrate that LEAD achieves significantly lower logical error rates than standard decoding framework while substantially reducing the average decoding latency and iteration count.

Related papers

• Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening [1.9355898755215148]
  We show that degeneracy is closely related to the classical operation of shortening of a linear block code.<n>We present a parallel decoding scheme for quantum low-density parity-check codes, which we term impulse decoding.<n>We then present another algorithm based on decoding of residual errors, which when combined with impulse decoding achieves further performance improvement under circuit-level noise.
  arXiv  Detail & Related papers  (2026-06-16T17:58:26Z)
• Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation [4.561664406615985]
  We develop methods for synthesizing efficient encoders for arbitrary stabilizer codes.<n>For families with a modular structure, such as tableaud and holographic codes, we show how large encoders can be assembled from optimized local constituent encoders.<n>We obtain improvements of up to 43% in two-qubit gate count and up to 70% in depth.
  arXiv  Detail & Related papers  (2026-05-14T18:00:01Z)
• A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding [12.998419492098462]
  Topological stabilizer codes are particularly appealing due to their geometric locality and practical relevance.<n>We propose QuantumSMoE, a quantum vision transformer based decoder that incorporates code structure through plus shaped embeddings.<n> Experiments on the toric code demonstrate that QuantumSMoE outperforms state-of-the-art machine learning decoders.
  arXiv  Detail & Related papers  (2026-01-18T16:49:59Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Bosonic quantum computing with near-term devices and beyond [0.0]
  This thesis investigates scalable fault-tolerant quantum computation.<n>We develop bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction.
  arXiv  Detail & Related papers  (2025-12-17T04:01:54Z)
• Localized statistics decoding for quantum low-density parity-check codes [3.716393259548592]
  We introduce localized statistics decoding for arbitrary quantum low-density parity-check codes.<n>Our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.
  arXiv  Detail & Related papers  (2024-06-26T18:00:09Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. 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.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• 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)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)

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.