Optimal Single-Shot Decoding of Quantum Codes

• URL: http://arxiv.org/abs/2310.18138v2
• Date: Tue, 19 Mar 2024 15:53:56 GMT
• Title: Optimal Single-Shot Decoding of Quantum Codes
• Authors: Aldo Cumitini, Stefano Tinelli, Balázs Matuz, Francisco Lázaro, Luca Barletta,
• Abstract summary: We discuss single-shot decoding of quantum Calderbank-Shor-Steane codes with faulty syndrome measurements. By adding redundant rows to the code's parity-check matrix we obtain an additional syndrome error correcting code.
• Score: 4.233908672338595
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss single-shot decoding of quantum Calderbank-Shor-Steane codes with faulty syndrome measurements. We state the problem as a joint source-channel coding problem. By adding redundant rows to the code's parity-check matrix we obtain an additional syndrome error correcting code which addresses faulty syndrome measurements. Thereby, the redundant rows are chosen to obtain good syndrome error correcting capabilities while keeping the stabilizer weights low. Optimal joint decoding rules are derived which, though too complex for general codes, can be evaluated for short quantum codes.

Related papers

• Robust Syndrome Extraction via BCH Encoding [4.123763595394021]
  Quantum data-syndrome (QDS) codes protect against errors both on the data qubits and on the syndrome itself via redundant measurement of stabilizer group elements. One way to define a QDS code is to choose a syndrome measurement code, a block code that encodes the syndrome of the underlying quantum code by defining additional stabilizer measurements. We show that these codes require $O(tlogell)$ extra measurements, where $ell$ is the number of stabilizer generators of the quantum code and $t$ is the number of errors corrected by the BCH code.
  arXiv  Detail & Related papers  (2023-11-27T18:09: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)
• 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)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• 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)
• Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors [10.200716411599831]
  Quantum errors are primarily detected and corrected using the measurement of syndrome information. In this paper, we use this "soft" or analog information without the conventional discretization step. We demonstrate the advantages of extracting the soft information from the syndrome in our improved decoders.
  arXiv  Detail & Related papers  (2022-05-04T22:00:32Z)
• Decoding of Quantum Data-Syndrome Codes via Belief Propagation [3.2689702143620143]
  Quantum data-syndrome codes are designed to protect the data qubits and syndrome bits concurrently. We propose an efficient decoding algorithm for quantum DS codes with sparse check matrices.
  arXiv  Detail & Related papers  (2021-02-03T10:05:36Z)
• Quantum Error Source and Channel Coding [0.0]
  We prove conditions on the set of correctable error patterns allowing for unambiguous decoding based on a lookup table. We argue that quantum error correction is more aptly viewed as source compression in the sense of Shannon.
  arXiv  Detail & Related papers  (2020-04-20T17:55:21Z)
• 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.