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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Introduction to Quantum Deletion Error-Correcting Codes

Manabu Hagiwara

Published May 21, 2024• 2 citations
Publisher

Abstract

This paper serves as an introductory overview of quantum deletion error-correction codes, a burgeoning field within quantum coding theory. Covering foundational concepts, existing research, and open questions, it aims to be the first accessible resource on the subject. This paper contains basic definitions of terms so that readers can read it regardless of their background. This paper invites readers to explore this primer and take their initial steps into the realm of quantum deletion error-correcting codes research.

DOI
10.1587/transfun.2024tai0001

Related papers

A physics-free introduction to quantum error correcting codes

Martin, William J.

Research in the field of quantum algorithms and quantum error correction is progressing at an astounding rate. There are many good papers on both subjects, but reading even a few of these may seem a daunting task to the newcomer. The aim of this paper is to give a leisurely introduction to the basic theory of quantum error correcting codes without appealing to even the most basic notions in physics. Thus the article is not a substitute for important papers such as [12] or [7] but rather an advertisement for them. I would be pleased if, in addition, some readers view this as a useful companion article if and when they go on to read more substantial literature on the subject of quantum error correction. I present nothing new here. Rather, I give an elementary account of the important theorems and proofs which appear in these fundamental works using only undergraduate algebra and a bit of classical coding theory. In particular, I give a full proof of the Knill/Laflamme theorem as well as an elementary treatment of stabilizer codes. The goal is to make the literature dealing with this exciting new area more accessible to discrete mathematicians.

Utilitas Mathematica•May 9, 2004•0 citations

Error Correcting Codes

Peter M Kosek

Error correcting codes is an area of mathematics that combines many theoretical concepts with a wide variety of applications.In this expository thesis, we will begin by introducing many of the fundamental ideas in classical error correcting codes.The goal of this is to introduce the reader to the field of coding theory and discuss a few of the wide range of classical codes that have been studied.The second section will discuss the recent findings in error correcting codes, namely their use in quantum error correcting codes.This section uses much more theoretical areas of math, when compared to the classical section, in the construction of quantum error correcting codes.Most of the research discussed in this section has been completed within the past six years.All of the research discoveries presented in this thesis have been previously known.

•Jan 1, 2014•0 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•2 citations

The first quantum error-correcting code for single deletion errors

Ayumu Nakayama, Manabu Hagiwara

A quantum error-correcting code for single deletion errors is provided. To the authors’ best knowledge, this is the first code for deletion errors.

IEICE Communications Express•Jan 1, 2020•24 citations

Quantum error-correcting codes and their geometries

Simeon Ball, Aina Centelles, Felix Huber

This is an expository article aiming to introduce the reader to the underlying mathematics and geometry of quantum error correction. Information stored on quantum particles is subject to noise and interference from the environment. Quantum error-correcting codes allow the negation of these effects in order to successfully restore the original quantum information. We briefly describe the necessary quantum-mechanical background to be able to understand how quantum error correction works. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. We will delve into the geometry of these codes. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters. We also include sections on quantum maximum distance separable codes and the quantum MacWilliams identities.

arXiv:2007.05992•Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions•Feb 9, 2023•24 citations

Quantum Codes: A Comprehensive Survey of Techniques, Challenges, and Future Directions

Istiak Mahmud, Ahmed Abdelhadi

Quantum error correction is fundamental to enabling reliable quantum computation and communication in the presence of noise and decoherence. Over the years, a diverse range of quantum coding strategies has been developed, each offering distinct approaches to mitigate quantum errors and achieve fault tolerance. This paper presents a comprehensive survey of major quantum code families, including stabilizer codes, topological codes, quantum LDPC codes, convolutional codes, turbo codes, Reed-Muller codes, continuous-variable bosonic codes, and subsystem codes. For each class, we discuss their construction principles, operational strategies, advantages, and inherent limitations. In addition to reviewing existing methodologies, we compare different coding techniques through structured tables and highlight the practical challenges that persist, such as resource overhead, decoding complexity, and scalability. Furthermore, we identify future research directions aimed at overcoming these challenges, including hybrid error correction approaches, machine learning-assisted decoders, and fault-tolerant architectures without magic state distillation. By consolidating the landscape of quantum error correction research, this work aims to serve as a foundational reference for researchers and practitioners working toward scalable, robust quantum technologies.

IEEE Access•Jan 1, 2025•5 citations
This paper serves as an introductory overview of quantum deletion error-correction codes, a burgeoning field within quantum coding theory. Covering foundational concepts, existing research, and open questions, it aims to be the first accessible resource on the subject. This paper contains basic definitions of terms so that readers can read it regardless of their background. This paper invites readers to explore this primer and take their initial steps into the realm of quantum deletion error-correcting codes research.
Research in the field of quantum algorithms and quantum error correction is progressing at an astounding rate. There are many good papers on both subjects, but reading even a few of these may seem a daunting task to the newcomer. The aim of this paper is to give a leisurely introduction to the basic theory of quantum error correcting codes without appealing to even the most basic notions in physics. Thus the article is not a substitute for important papers such as [12] or [7] but rather an advertisement for them. I would be pleased if, in addition, some readers view this as a useful companion article if and when they go on to read more substantial literature on the subject of quantum error correction. I present nothing new here. Rather, I give an elementary account of the important theorems and proofs which appear in these fundamental works using only undergraduate algebra and a bit of classical coding theory. In particular, I give a full proof of the Knill/Laflamme theorem as well as an elementary treatment of stabilizer codes. The goal is to make the literature dealing with this exciting new area more accessible to discrete mathematicians.
Error correcting codes is an area of mathematics that combines many theoretical concepts with a wide variety of applications.In this expository thesis, we will begin by introducing many of the fundamental ideas in classical error correcting codes.The goal of this is to introduce the reader to the field of coding theory and discuss a few of the wide range of classical codes that have been studied.The second section will discuss the recent findings in error correcting codes, namely their use in quantum error correcting codes.This section uses much more theoretical areas of math, when compared to the classical section, in the construction of quantum error correcting codes.Most of the research discussed in this section has been completed within the past six years.All of the research discoveries presented in this thesis have been previously known.
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.
This is an expository article aiming to introduce the reader to the underlying mathematics and geometry of quantum error correction. Information stored on quantum particles is subject to noise and interference from the environment. Quantum error-correcting codes allow the negation of these effects in order to successfully restore the original quantum information. We briefly describe the necessary quantum-mechanical background to be able to understand how quantum error correction works. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. We will delve into the geometry of these codes. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters. We also include sections on quantum maximum distance separable codes and the quantum MacWilliams identities.
Quantum error correction is fundamental to enabling reliable quantum computation and communication in the presence of noise and decoherence. Over the years, a diverse range of quantum coding strategies has been developed, each offering distinct approaches to mitigate quantum errors and achieve fault tolerance. This paper presents a comprehensive survey of major quantum code families, including stabilizer codes, topological codes, quantum LDPC codes, convolutional codes, turbo codes, Reed-Muller codes, continuous-variable bosonic codes, and subsystem codes. For each class, we discuss their construction principles, operational strategies, advantages, and inherent limitations. In addition to reviewing existing methodologies, we compare different coding techniques through structured tables and highlight the practical challenges that persist, such as resource overhead, decoding complexity, and scalability. Furthermore, we identify future research directions aimed at overcoming these challenges, including hybrid error correction approaches, machine learning-assisted decoders, and fault-tolerant architectures without magic state distillation. By consolidating the landscape of quantum error correction research, this work aims to serve as a foundational reference for researchers and practitioners working toward scalable, robust quantum technologies.