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

arXiv:2409.10924 · International Symposium on Information Theory and its Applications

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

Ken-Ichi Nakamura, T. Nozaki

Published Nov 10, 2024• 0 citations
arXivHTMLPDF

Abstract

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.
DOI
10.23919/isita60732.2024.10858220

Related papers

Multiple-Insertion-Correcting Non-Binary Quantum Codes and Decoding Algorithm

K. Nakamura, T. Nozaki

This paper investigates non-binary quantum codes correcting multiple insertion errors. This paper provides an insertion-correcting procedure of the deletion-correcting non-binary codes constructed by Matsumoto and Hagiwara. By giving the procedure, we present multiple-insertion-correcting non-binary quantum codes.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jul 29, 2024•0 citations

A Decoding Algorithm for Composite Errors Consisting of Deletions and Insertions in Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes

Koki Sasaki, Ken Nakamura, Takayuki Nozaki

This paper focuses on Hagiwara codes, which are quantum deletion-correcting codes constructed by the quantum Reed-Solomon codes. Although Hagiwara codes can correct composite errors consisting of deletions and insertions, an efficient decoding algorithm to such errors remains an open problem. In this paper, we provide a decoding algorithm to such errors for Hagiwara codes.

arXiv:2605.11510•May 12, 2026•0 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

Equivalence of Quantum Single Insertion and Single Deletion Error-Correctabilities, and Construction of Codes and Decoders

Taro Shibayama, Manabu Hagiwara

This article contributes to an unsolved quantum information problem: the equivalence between insertion error-correctability and deletion error-correctability. The solution in Shibayama and Ouyang’s sense is provided in the single-error under the assumption of the purity of quantum codeword states On the other hand, a class of codes that can correct both single deletion and single insertion is provided.

IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•8 citations

The equivalence of quantum deletion and insertion errors on permutation-invariant codes

Lewis Bulled, Yingkai Ouyang

Quantum synchronisation errors are a class of errors that change the number of qubits in a quantum system. The classical error correction of synchronisation errors has been well-studied, including an insertion-deletion equivalence more than a half-century ago, but little progress has been made towards the quantum counterpart since the birth of quantum error correction. We address the longstanding problem of a quantum insertion-deletion equivalence on permutation-invariant codes, detailing the conditions under which such codes are $t$-insertion error-correctable. We extend these conditions to quantum insertion-deletion errors, formulating a more restrictive set of conditions under which permutation-invariant codes are $(t,s)$-insdel error-correctable. For completeness, we extend our approach to qudit errors on qudit permutation-invariant codes. Our work resolves many of the outstanding questions regarding the quantum error correction of synchronisation errors.

quant-pharXiv:2602.08780•npj Quantum Information•Feb 10, 2026•0 citations

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

Taro Shibayama

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.

International Symposium on Information Theory and its Applications•Oct 24, 2020•7 citations
Quantum synchronisation errors are a class of errors that change the number of qubits in a quantum system. The classical error correction of synchronisation errors has been well-studied, including an insertion-deletion equivalence more than a half-century ago, but little progress has been made towards the quantum counterpart since the birth of quantum error correction. We address the longstanding problem of a quantum insertion-deletion equivalence on permutation-invariant codes, detailing the conditions under which such codes are ttt-insertion error-correctable. We extend these conditions to quantum insertion-deletion errors, formulating a more restrictive set of conditions under which permutation-invariant codes are (t,s)(t,s)(t,s)-insdel error-correctable. For completeness, we extend our approach to qudit errors on qudit permutation-invariant codes. Our work resolves many of the outstanding questions regarding the quantum error correction of synchronisation errors.
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.