Permutation-Invariant Quantum Codes for Deletion Errors

• URL: http://arxiv.org/abs/2102.03015v1
• Date: Fri, 5 Feb 2021 06:17:43 GMT
• Title: Permutation-Invariant Quantum Codes for Deletion Errors
• Authors: Taro Shibayama and Manabu Hagiwara
• Abstract summary: 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.
• Score: 3.8073142980733
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes give the first example of quantum codes that can correct two or more deletion errors. Also, our codes give the first example of quantum codes that can correct both multiple-qubit errors and multiple-deletion errors. We also discuss a generalization of the construction of our codes at the end.

Related papers

• 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)
• 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)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Quantum Deletion Codes derived from Classical Deletion Codes (Extended Abstract) [3.8073142980733]
  The paper contributes to the fundamental theory for quantum deletion error-correcting codes. The construction methods in this paper give examples of quantum codes that can correct single-quantum deletion errors.
  arXiv  Detail & Related papers  (2022-08-11T08:51:01Z)
• 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)
• Constructions of $\ell$-Adic $t$-Deletion-Correcting Quantum Codes [6.09170287691728]
  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.
  arXiv  Detail & Related papers  (2021-02-08T14:25:28Z)
• Permutation-invariant quantum coding for quantum deletion channels [6.85316573653194]
  We show that a permutation-invariant quantum code that has a distance of $t+1$ can correct $t$ quantum deletions for any positive integer $t$ in both the qubit and the qudit setting. We focus our attention on a specific family of $N$-qubit permutation-invariant quantum codes, which we call shifted gnu codes, and show that their encoding and decoding algorithms can be performed in $O(N)$ and $O(N2)$.
  arXiv  Detail & Related papers  (2021-02-04T09:12:35Z)
• 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)
• A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length [3.8073142980733]
  This paper provides a new instance of quantum deletion error-correcting codes. It is also proven that the length of any single deletion error-correcting codes is greater than or equal to 4.
  arXiv  Detail & Related papers  (2020-01-23T08:28:38Z)

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.