Decoding general error correcting codes and the role of complementarity

• URL: http://arxiv.org/abs/2210.06661v4
• Date: Tue, 25 Jun 2024 00:51:14 GMT
• Title: Decoding general error correcting codes and the role of complementarity
• Authors: Yoshifumi Nakata, Takaya Matsuura, Masato Koashi,
• Abstract summary: We show that a decoding circuit for Calderbank-Shor-Stean (CSS) codes can be straightforwardly extended to that for a general QECC. We then demonstrate the power of the decoding circuit in a toy model of the black hole information paradox.
• Score: 2.66269503676104
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Among various classes of quantum error correcting codes (QECCs), non-stabilizer codes have rich properties and are of theoretical and practical interest. Decoding non-stabilizer codes is, however, a highly non-trivial task. In this paper, we show that a decoding circuit for Calderbank-Shor-Stean (CSS) codes can be straightforwardly extended to that for a general QECC. In the extension, instead of the classical decoders of the linear classical codes that define the CSS code, we use decoding measurements of a pair of classical-quantum (CQ) codes associated with the QECC to be decoded.The decoding error depends on the errors of the two decoding measurements and the degree of complementarity of the CQ codes.We then demonstrate the power of the decoding circuit in a toy model of the black hole information paradox, in which we improve decoding errors over previous approaches and further show that the black hole dynamics may be an optimal encoder for quantum information but a poor encoder for classical information.

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)
• Coherent information for CSS codes under decoherence [0.0]
  A class called Calderbank-Shor-Steane (CSS) codes includes many important examples such as toric codes, color codes, and fractons. Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state.
  arXiv  Detail & Related papers  (2024-07-02T18:00:02Z)
• 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)
• Flexible polar encoding for information reconciliation in QKD [2.627883025193776]
  Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure. Errors that are generally considered to be due to the adversary's tempering with the quantum channel need to be corrected using classical communication over a public channel. We show that the reliability sequence can be derived and used to design an encoder independent of the choice of decoder.
  arXiv  Detail & Related papers  (2023-11-30T16:01:10Z)
• 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)
• Decoding quantum color codes with MaxSAT [4.29377170477633]
  We propose a novel decoder for quantum color codes using a formulation as a MaxSAT problem based on the LightsOut puzzle. We show that the decoding performance of the proposed decoder achieves state-of-the-art decoding performance on color codes.
  arXiv  Detail & Related papers  (2023-03-24T19:00:02Z)
• 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)
• Adversarial Neural Networks for Error Correcting Codes [76.70040964453638]
  We introduce a general framework to boost the performance and applicability of machine learning (ML) models. We propose to combine ML decoders with a competing discriminator network that tries to distinguish between codewords and noisy words. Our framework is game-theoretic, motivated by generative adversarial networks (GANs)
  arXiv  Detail & Related papers  (2021-12-21T19:14:44Z)
• 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)
• Pseudocodeword-based Decoding of Quantum Color Codes [17.188280334580195]
  We introduce a two-stage decoder based on pseudocodewords for quantum cycle codes. Our decoder has only local or error-weight-dependent operations of low computational complexity and better decoding performance.
  arXiv  Detail & Related papers  (2020-10-21T09:10:04Z)

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.