Turbo-Annihilation of Hook Errors in Stabilizer Measurement Circuits

• URL: http://arxiv.org/abs/2504.21200v1
• Date: Tue, 29 Apr 2025 22:09:11 GMT
• Title: Turbo-Annihilation of Hook Errors in Stabilizer Measurement Circuits
• Authors: Michele Pacenti, Asit K. Pradhan, Shantom K. Borah, Bane Vasic,
• Abstract summary: We propose a scalable decoding framework for correcting correlated hook errors in stabilizer measurement circuits.<n>Traditional circuit-level decoding attempts to estimate the precise location of faults by constructing an extended Tanner graph.<n>Our approach instead focuses on estimating the effective data errors caused by hook faults, modeling them as memory channels.
• Score: 2.6999000177990924
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We propose a scalable decoding framework for correcting correlated hook errors in stabilizer measurement circuits. Traditional circuit-level decoding attempts to estimate the precise location of faults by constructing an extended Tanner graph that includes every possible source of noise. However, this results in a highly irregular graph with many short cycles, leading to poor performance of message-passing algorithms. To compensate, ordered statistics decoding is typically employed, but its cubic complexity renders it impractical for large codes or repeated stabilizer measurements. Our approach instead focuses on estimating the effective data errors caused by hook faults, modeling them as memory channels. We integrate trellis-based soft-input soft-output equalizers into the Tanner graph of the code, and show that the resulting decoding graph preserves the structural properties of the original Tanner graph such as node degree and girth, enabling efficient message passing. Applied to bivariate bicycle quantum LDPC codes, our decoder outperforms standard belief propagation on the circuit-level graph and closely approaches OSD0 performance, all while maintaining linear complexity and scalability.

Related papers

• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise [0.562479170374811]
  We introduce the belief propagation plus ordered Tanner forest (BP+OTF) algorithm as an almost-linear time decoder for quantum low-density parity-check codes. We show that the BP+OTF decoder achieves logical error suppression within an order of magnitude of state-of-the-art inversion-based decoders.
  arXiv  Detail & Related papers  (2024-09-02T19:50:57Z)
• Fault-tolerant quantum computation using large spin cat-codes [0.8640652806228457]
  We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code. We show how to generate a universal gate set, including the rank-preserving CNOT gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing.
  arXiv  Detail & Related papers  (2024-01-08T22:56:05Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes [6.175503577352742]
  We propose a differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers.
  arXiv  Detail & Related papers  (2023-10-26T19:56:25Z)
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise [6.322831694506286]
  We introduce quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources.<n>We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates.
  arXiv  Detail & Related papers  (2023-10-19T12:23:05Z)
• Data-driven decoding of quantum error correcting codes using graph neural networks [0.0]
  We explore a model-free, data-driven, approach to decoding, using a graph neural network (GNN)<n>We show that the GNN-based decoder can outperform a matching decoder for circuit level noise on the surface code given only simulated data.<n>The results show that a purely data-driven approach to decoding may be a viable future option for practical quantum error correction.
  arXiv  Detail & Related papers  (2023-07-03T17:25:45Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Fundamental Limits of Two-layer Autoencoders, and Achieving Them with Gradient Methods [91.54785981649228]
  This paper focuses on non-linear two-layer autoencoders trained in the challenging proportional regime. Our results characterize the minimizers of the population risk, and show that such minimizers are achieved by gradient methods. For the special case of a sign activation function, our analysis establishes the fundamental limits for the lossy compression of Gaussian sources via (shallow) autoencoders.
  arXiv  Detail & Related papers  (2022-12-27T12:37:34Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)

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.