Graph-Theoretic Approach to Quantum Error Correction

• URL: http://arxiv.org/abs/2110.08414v2
• Date: Mon, 14 Mar 2022 23:08:43 GMT
• Title: Graph-Theoretic Approach to Quantum Error Correction
• Authors: Robert Vandermolen, Duncan Wright
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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. In this new framework, we represent the algebraic conditions for error correction in terms of edge avoidance between graphs providing a visual representation of the interplay between errors and error correcting codes. Most importantly, this framework supports the development of quantum codes that correct against a predetermined set of errors, in contrast to current methods. A heuristic algorithm is presented, providing steps to develop codes that correct against an arbitrary noisy channel. We benchmark the correction capability of reflexive stabilizer codes for the case of single qubit errors by comparison to existing stabilizer codes that are widely used. In addition, 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 qudit errors on a four-state system.

Related papers

• Engineering Quantum Error Correction Codes Using Evolutionary Algorithms [0.0]
  Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. We present a novel evolutionary algorithm which searches for an optimal stabiliser code for a given error model. As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.
  arXiv  Detail & Related papers  (2024-09-19T18:00:02Z)
• Breadth-first graph traversal union-find decoder [0.0]
  We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
  arXiv  Detail & Related papers  (2024-07-22T18:54:45Z)
• 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)
• 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)
• 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)
• 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)
• Active Readout Error Mitigation [1.5675763601034223]
  We propose a scheme to actively reduce readout errors on a shot-by-shot basis by encoding single qubits, immediately prior to readout, into multi-qubit states. We analyze the potential of our approach using two types of error-correcting codes and, as a proof of principle, demonstrate an 80% improvement in readout error on the IBMQ Mumbai quantum computer.
  arXiv  Detail & Related papers  (2021-08-27T18:00:00Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• 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)
• 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)

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.