Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Information Theory and its Applications

New Instances of Quantum Error-Correcting Codes for Single Deletion Errors

Taro Shibayama

Published Oct 24, 2020• 7 citations
OpenAlex

Abstract

This paper provides new instances of quantum error-correcting codes. According to recent results by Nakayama and Hagiwara, by using two sets of binary sequences that satisfy three conditions, we can construct quantum error-correcting codes for single deletion errors. However, only two instances of two sets that satisfy the three conditions have been found to date. The present study constructs two infinite series of sets that satisfy the three conditions. In other words, this paper constructs new infinite series of quantum error-correcting codes for single deletion errors.

Related papers

Single Quantum Deletion Error-Correcting Codes

Ayumu Nakayama, Manabu Hagiwara

In this paper, we discuss a construction method of quantum deletion error-correcting codes. First of all, we define deletion errors for quantum states, an encoder, a decoder, and two conditions which is expressed by only the combinatorial language. Then, 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 by this paper. Also, we performed experiment of the codes over IBM Quantum Experience.

arXiv:2004.00814•Apr 2, 2020•9 citations

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

Manabu Hagiwara

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.

arXiv:2208.05699•Aug 11, 2022•0 citations

Decoding Algorithm Correcting Single-Insertion Plus Single-Deletion for Non-binary Quantum Codes

Ken-Ichi Nakamura, T. Nozaki

In this paper, we assume an error such that a single insertion occurs and then a single deletion occurs. Under such an error model, this paper provides a decoding algorithm for non-binary quantum codes constructed by Matsumoto and Hagiwara.

arXiv:2409.10924•International Symposium on Information Theory and its Applications•Nov 10, 2024•0 citations

A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length

Manabu Hagiwara, Ayumu Nakayama

This paper provides a new instance of quantum deletion error-correcting codes. This code can correct any single quantum deletion error, while our code is only of length 4. This paper also provides an example of an encoding quantum circuit and decoding quantum circuits. It is also proven that the length of any single deletion error-correcting codes is greater than or equal to 4. In other words, our code is optimal for the code length.

arXiv:2001.08405•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•23 citations

Permutation-Invariant Quantum Codes for Deletion Errors

Taro Shibayama, Manabu Hagiwara

This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes include examples of quantum codes that can correct two or more deletion errors, which have not been studied before. We also give examples of quantum codes that can correct both multiple-qubit errors and multiple-deletion errors. We discuss a generalization of the construction of our codes at the end.

arXiv:2102.03015•IEEE International Symposium on Information Theory (ISIT)•Jul 12, 2021•16 citations

Insertion Correcting Algorithm for Quantum Deletion Correcting Codes Based on Quantum Reed-Solomon Codes

Koki Sasaki, T. Nozaki

Research on quantum insertion or deletion error correcting codes has become active in recent years. In 2023, Hagiwara constructed a binary quantum code that corrects multiple deletion errors and has a more flexible code rate than conventional ones. The contribution of this study is to provide an insertion correcting algorithm for the code constructed by Hagiwara.

International Symposium on Information Theory and its Applications•Nov 10, 2024•0 citations
This paper provides new instances of quantum error-correcting codes. According to recent results by Nakayama and Hagiwara, by using two sets of binary sequences that satisfy three conditions, we can construct quantum error-correcting codes for single deletion errors. However, only two instances of two sets that satisfy the three conditions have been found to date. The present study constructs two infinite series of sets that satisfy the three conditions. In other words, this paper constructs new infinite series of quantum error-correcting codes for single deletion errors.
In this paper, we discuss a construction method of quantum deletion error-correcting codes. First of all, we define deletion errors for quantum states, an encoder, a decoder, and two conditions which is expressed by only the combinatorial language. Then, 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 by this paper. Also, we performed experiment of the codes over IBM Quantum Experience.
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.