Improved Logical Error Rate via List Decoding of Quantum Polar Codes

• URL: http://arxiv.org/abs/2304.04743v1
• Date: Mon, 10 Apr 2023 17:56:10 GMT
• Title: Improved Logical Error Rate via List Decoding of Quantum Polar Codes
• Authors: Anqi Gong and Joseph M. Renes
• Abstract summary: We show that the successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error. We apply SCL decoding to a novel version of quantum polar codes based on the polarization weight method. Both SCL-E and SCL-C maintain the complexity O(LN logN) of SCL for code size N and list size L.
• Score: 8.122270502556372
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error, approximating the maximum likelihood decoder (MLD) for small list sizes. Here we adapt the SCL to the task of decoding quantum polar codes and show that it inherits the high performance and low complexity of the classical case, and can approximate the quantum MLD for certain channels. We apply SCL decoding to a novel version of quantum polar codes based on the polarization weight (PW) method, which entirely avoids the need for small amounts of entanglement assistance apparent in previous quantum polar code constructions. When used to find the precise error pattern, the quantum SCL decoder (SCL-E) shows competitive performance with surface codes of similar size and low-density parity check codes of similar size and rate. The SCL decoder may instead be used to approximate the probability of each equivalence class of errors, and then choose the most likely class. We benchmark this class-oriented decoder (SCL-C) against the SCL-E decoder and find a noticeable improvement in the logical error rate. This improvement stems from the fact that the contributions from just the low-weight errors give a reasonable approximation to the error class probabilities. Both SCL-E and SCL-C maintain the complexity O(LN logN) of SCL for code size N and list size L. We also show that the list decoder can be used to gain insight into the weight distribution of the codes and how this impacts the effect of degenerate errors.

Related papers

• Degenerate quantum erasure decoding [7.6119527195998025]
  We show how to achieve near-capacity performance with explicit codes and efficient decoders. We furthermore explore the potential of our decoders to handle other error models, such as mixed erasure and depolarizing errors.
  arXiv  Detail & Related papers  (2024-11-20T18:02:05Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• 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)
• Deep Polar Codes [19.265010348250897]
  We introduce a novel class of pre-transformed polar codes, termed as deep polar codes. We first present a deep polar encoder that harnesses a series of multi-layered polar transformations with varying sizes. Our encoding method offers flexibility in rate-profiling, embracing a wide range of code rates and blocklengths.
  arXiv  Detail & Related papers  (2023-08-06T03:29:18Z)
• 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)
• 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)
• Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach [11.146177972345138]
  This paper first maps a polar code to a heterogeneous graph called the polar-code-construction message-passing graph. Next, a graph-neural-network-based iterative message-passing algorithm is proposed which aims to find a PCCMP graph that corresponds to the polar code. Numerical experiments show that IMP-based polar-code constructions outperform classical constructions under CA-SCL decoding.
  arXiv  Detail & Related papers  (2022-07-03T19:27:43Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Trapping Sets of Quantum LDPC Codes [9.482750811734565]
  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.
  arXiv  Detail & Related papers  (2020-12-30T19:35:17Z)

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.