Constructions of $\ell$-Adic $t$-Deletion-Correcting Quantum Codes

• URL: http://arxiv.org/abs/2102.04230v2
• Date: Wed, 21 Apr 2021 06:33:54 GMT
• Title: Constructions of $\ell$-Adic $t$-Deletion-Correcting Quantum Codes
• Authors: Ryutaroh Matsumoto and Manabu Hagiwara
• Abstract summary: We propose two systematic constructions of deletion-correcting codes for protecting quantum information. The first one works with qudits of any dimension, but only one is corrected and the constructed codes are deletionally bad. The second one corrects multiple deletions and can constructally good codes.
• Score: 6.09170287691728
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose two systematic constructions of deletion-correcting codes for protecting quantum information. The first one works with qudits of any dimension, but only one deletion is corrected and the constructed codes are asymptotically bad. The second one corrects multiple deletions and can construct asymptotically good codes. The second one also allows conversion of stabilizer-based quantum codes to deletion-correcting codes, and entanglement assistance.

Related papers

• 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)
• Class of codes correcting absorptions and emissions [59.90381090395222]
  We construct a family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order. We derive simplified error correction conditions for a general AE code and show that any permutation-invariant code that corrects $le t$ errors can be mapped to an AE code.
  arXiv  Detail & Related papers  (2024-10-04T16:14:03Z)
• Qudit-based quantum error-correcting codes from irreducible representations of SU(d) [0.0]
  Qudits naturally correspond to multi-level quantum systems, but their reliability is contingent upon quantum error correction capabilities. We present a general procedure for constructing error-correcting qudit codes through the irreducible representations of $mathrmSU(d)$ for any odd integer $d geq 3.$ We use our procedure to construct an infinite class of error-correcting codes encoding a logical qudit into $(d-1)2$ physical qudits.
  arXiv  Detail & Related papers  (2024-10-03T11:35:57Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• 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)
• Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes [3.8073142980733]
  We present a construction method for quantum codes capable of correcting multiple deletion errors. By introducing two new alogorithms, the alternating sandwich mapping and the block error locator, the proposed method reduces deletion error correction to erasure error correction.
  arXiv  Detail & Related papers  (2023-06-23T09:32:09Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Permutation-Invariant Quantum Codes for Deletion Errors [3.8073142980733]
  This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors. Our codes give the first example of quantum codes that can correct two or more deletion errors.
  arXiv  Detail & Related papers  (2021-02-05T06:17:43Z)
• Optimal Universal Quantum Error Correction via Bounded Reference Frames [8.572932528739283]
  Error correcting codes with a universal set of gates are a desideratum for quantum computing. We show that our approximate codes are capable of efficiently correcting different types of erasure errors. Our approach has implications for fault-tolerant quantum computing, reference frame error correction, and the AdS-CFT duality.
  arXiv  Detail & Related papers  (2020-07-17T18:00:03Z)
• Single Quantum Deletion Error-Correcting Codes [3.8073142980733]
  We prove that quantum deletion error-correcting codes can be constructed by two sets that satisfy the conditions. In other words, problems that correct the deletion errors for quantum states are reduced to problems that find the sets satisfying the condition.
  arXiv  Detail & Related papers  (2020-04-02T04:48:40Z)

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.