Trapping Sets of Quantum LDPC Codes
- URL: http://arxiv.org/abs/2012.15297v2
- Date: Thu, 7 Oct 2021 06:30:48 GMT
- Title: Trapping Sets of Quantum LDPC Codes
- Authors: Nithin Raveendran and Bane Vasi\'c
- Abstract summary: We identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used.
We show that the knowledge of QTSs can be used to design better QLDPC codes and decoders.
- Score: 9.482750811734565
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Iterative decoders for finite length quantum low-density parity-check (QLDPC)
codes are attractive because their hardware complexity scales only linearly
with the number of physical qubits. However, they are impacted by short cycles,
detrimental graphical configurations known as trapping sets (TSs) present in a
code graph as well as symmetric degeneracy of errors. These factors
significantly degrade the decoder decoding probability performance and cause
so-called error floor. In this paper, we establish a systematic methodology by
which one can identify and classify quantum trapping sets (QTSs) according to
their topological structure and decoder used. The conventional definition of a
TS from classical error correction is generalized to address the syndrome
decoding scenario for QLDPC codes. We show that the knowledge of QTSs can be
used to design better QLDPC codes and decoders. Frame error rate improvements
of two orders of magnitude in the error floor regime are demonstrated for some
practical finite-length QLDPC codes without requiring any post-processing.
Related papers
- Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs)
The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
arXiv Detail & Related papers (2024-08-09T16:47:49Z) - Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
We introduce Ambiguity Clustering (AC), an algorithm which seeks to divide measurement data into clusters which are decoded independently.
AC is between one and three orders of magnitude faster than BP-OSD with no reduction in logical fidelity.
Our CPU implementation of AC is already fast enough to decode the 144-qubit Gross code in real time for neutral atom and trapped ion systems.
arXiv Detail & Related papers (2024-06-20T17:39:31Z) - Low-density parity-check representation of fault-tolerant quantum circuits [5.064729356056529]
In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction.
This paper presents a toolkit for designing and analysing fault-tolerant quantum circuits.
arXiv Detail & Related papers (2024-03-15T12:56:38Z) - 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) - 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) - Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit.
These codes can be customized to the specific physical errors on the qudit, effectively suppressing them.
We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
arXiv Detail & Related papers (2023-07-20T10:51:23Z) - 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) - Quantum Error Correction via Noise Guessing Decoding [0.0]
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation.
This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
arXiv Detail & Related papers (2022-08-04T16:18:20Z) - Cellular automaton decoders for topological quantum codes with noisy
measurements and beyond [68.8204255655161]
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold.
We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
arXiv Detail & Related papers (2020-04-15T18:00:01Z)
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.