Union-Find Decoders For Homological Product Codes
- URL: http://arxiv.org/abs/2009.14226v2
- Date: Mon, 8 Mar 2021 18:23:04 GMT
- Title: Union-Find Decoders For Homological Product Codes
- Authors: Nicolas Delfosse and Matthew B. Hastings
- Abstract summary: Homological product codes are a class of codes that can have improved distance while retaining relatively low stabilizer weight.
We show how to build union-find decoders for these codes, using a union-find decoder for one of the codes in the product and a brute force decoder for the other code.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Homological product codes are a class of codes that can have improved
distance while retaining relatively low stabilizer weight. We show how to build
union-find decoders for these codes, using a union-find decoder for one of the
codes in the product and a brute force decoder for the other code. We apply
this construction to the specific case of the product of a surface code with a
small code such as a $[[4,2,2]]$ code, which we call an augmented surface code.
The distance of the augmented surface code is the product of the distance of
the surface code with that of the small code, and the union-find decoder, with
slight modifications, can decode errors up to half the distance. We present
numerical simulations, showing that while the threshold of these augmented
codes is lower than that of the surface code, the low noise performance is
improved.
Related papers
- Collective Bit Flipping-Based Decoding of Quantum LDPC Codes [0.6554326244334866]
We improve both the error correction performance and decoding latency of variable degree-3 (dv-3) QLDPC codes under iterative decoding.
Our decoding scheme is based on applying a modified version of bit flipping (BF) decoding, namely two-bit bit flipping (TBF) decoding.
arXiv Detail & Related papers (2024-06-24T18:51:48Z) - Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
Low-Density Parity-Check codes possess several advantages over other families of codes.
The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
arXiv Detail & Related papers (2024-06-09T12:08:56Z) - Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes.
We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z) - Lift-Connected Surface Codes [0.0]
We use the recently introduced lifted product to construct a family of Quantum Low Density Parity Check Codes (QLDPC codes)
The codes we obtain can be viewed as stacks of surface codes that are interconnected, leading to the name lift-connected surface (LCS) codes.
arXiv Detail & Related papers (2024-01-05T17:22:49Z) - Spatially-Coupled QDLPC Codes [3.6622737533847936]
We describe toric codes as quantum counterparts of classical spatially-coupled (2D-SC) codes.
We introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a class of convolutional LDPC codes.
This paper focuses on QLDPC codes with rate less than 1/10, but we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.
arXiv Detail & Related papers (2023-04-29T00:57:57Z) - Tackling Long Code Search with Splitting, Encoding, and Aggregating [67.02322603435628]
We propose a new baseline SEA (Split, Encode and Aggregate) for long code search.
It splits long code into code blocks, encodes these blocks into embeddings, and aggregates them to obtain a comprehensive long code representation.
With GraphCodeBERT as the encoder, SEA achieves an overall mean reciprocal ranking score of 0.785, which is 10.1% higher than GraphCodeBERT on the CodeSearchNet benchmark.
arXiv Detail & Related papers (2022-08-24T02:27:30Z) - Morphing quantum codes [77.34726150561087]
We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate.
We construct a family of hybrid color-toric codes by morphing the color code.
arXiv Detail & Related papers (2021-12-02T17:43:00Z) - ProductAE: Towards Training Larger Channel Codes based on Neural Product
Codes [9.118706387430885]
It is prohibitively complex to design and train relatively large neural channel codes via deep learning techniques.
In this paper, we construct ProductAEs, a computationally efficient family of deep-learning driven (encoder, decoder) pairs.
We show significant gains, over all ranges of signal-to-noise ratio (SNR), for a code of parameters $(100,225)$ and a moderate-length code of parameters $(196,441)$.
arXiv Detail & Related papers (2021-10-09T06:00:40Z) - KO codes: Inventing Nonlinear Encoding and Decoding for Reliable
Wireless Communication via Deep-learning [76.5589486928387]
Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes.
In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs.
KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
arXiv Detail & Related papers (2021-08-29T21:08:30Z) - Combining hard and soft decoders for hypergraph product codes [0.3326320568999944]
Hypergraph product codes are constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF)
This decoder displays sub-optimal performance in practice and requires very large error correcting codes to be effective.
We present new hybrid decoders that combine the belief propagation (BP) algorithm with the SSF decoder.
arXiv Detail & Related papers (2020-04-23T14:48:05Z) - Efficient color code decoders in $d\geq 2$ dimensions from toric code
decoders [77.34726150561087]
We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds.
We numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise.
arXiv Detail & Related papers (2019-05-17T17:41:50Z)
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.