Quantum Error Source and Channel Coding

• URL: http://arxiv.org/abs/2004.09479v4
• Date: Thu, 27 Aug 2020 11:59:51 GMT
• Title: Quantum Error Source and Channel Coding
• Authors: Dennis Lucarelli
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A classical coding across a block of logical qubits is presented. We characterize subgroups of the product stabilizer group on a block of logical qubits corresponding to dual codes of classical error correcting codes. We prove conditions on the set of correctable error patterns allowing for unambiguous decoding based on a lookup table. For a large family of classical algebraic codes, we show that the qubit overhead required for syndrome extraction from $L$ logical qubits scales as ${\cal O}(\log_2(L+1)),$ asymptotically. The basic construction is adapted to account for two-qubit and measurement errors, while still employing a lookup table based decoder. Moreover, we characterize the set of detectable errors and show how classical algebraic decoders can unambiguously locate logical qubits with errors even in the presence of syndrome noise. We argue that quantum error correction is more aptly viewed as source compression in the sense of Shannon, and that Shannon's source and channel coding theorems provide bounds on the overhead rates of quantum post-selection tasks, such as quantum error correction, at the level of the encoded quantum register.

Related papers

• Approximate quantum error correcting codes from conformal field theory [0.0]
  We consider generic 1+1D CFT codes under extensive local dephasing channels. We show that a CFT code with continuous symmetry saturates a bound on the recovery fidelity for covariant codes.
  arXiv  Detail & Related papers  (2024-06-13T19:40:36Z)
• 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)
• Correcting phenomenological quantum noise via belief propagation [7.469588051458094]
  Quantum stabilizer codes often face the challenge of syndrome errors due to error-prone measurements. In this paper, we consider phenomenological decoding problems, where data qubit errors may occur between two syndrome extractions. We propose a method to construct effective redundant stabilizer checks for single-shot error correction.
  arXiv  Detail & Related papers  (2023-10-19T12:23:05Z)
• 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)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Exact performance of the five-qubit code with coherent errors [0.0]
  We obtain explicit process matrix of the coding maps with a unital error channel for the five-qubit code. We analytically show how the code affects the average gate infidelity and diamond distance of the error channels.
  arXiv  Detail & Related papers  (2022-03-03T13:28:59Z)
• Graph-Theoretic Approach to Quantum Error Correction [0.0]
  We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum errors. We present two instances of optimal encodings: an optimal encoding for fully correlated noise which achieves a higher encoding rate than previously known, and a minimal encoding for single qudits.
  arXiv  Detail & Related papers  (2021-10-16T00:04:24Z)
• 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)
• Short Codes for Quantum Channels with One Prevalent Pauli Error Type [6.548580592686076]
  We investigate the design of stabilizer QECC able to correct a given number eg of generic Pauli errors, plus eZ Pauli errors of a specified type. These codes can be of interest when the quantum channel is asymmetric in that some types of error occur more frequently than others.
  arXiv  Detail & Related papers  (2021-04-09T13:51:51Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)

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.