Quantum Deletion Codes derived from Classical Deletion Codes (Extended Abstract)

• URL: http://arxiv.org/abs/2208.05699v1
• Date: Thu, 11 Aug 2022 08:51:01 GMT
• Title: Quantum Deletion Codes derived from Classical Deletion Codes (Extended Abstract)
• Authors: Manabu Hagiwara
• Abstract summary: 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.
• Score: 3.8073142980733
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This manuscript is an extended abstract version of the paper entitled ``Quantum Deletion Codes derived from Classical Deletion Codes.'' The paper contributes to the fundamental theory for quantum deletion error-correcting codes. The paper proposes a code construction condition for a partition of classical deletion error-correcting codes to derive quantum deletion error-correcting codes. The construction methods in this paper give examples of quantum codes that can correct single-quantum deletion errors and have a code rate arbitrarily close to 1, while the previously known quantum deletion code rates are close to 0 for long length. This manuscript omits the proofs of the statements in the paper.

Related papers

• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• 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)
• 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 Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
  We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model. This yields the first post-quantum succinct argument system from any falsifiable assumption.
  arXiv  Detail & Related papers  (2021-03-15T05:09:17Z)
• 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 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)
• 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.