🤖 AI Summary
This study addresses the challenge of quantifying and enhancing the joint correction capability of quantum error-correcting codes against insertion and deletion (indel) errors. By introducing, for the first time, the classical coding theory concept of non-overlapping error spheres into the quantum indel setting, the work proposes a “quantum indel distance” to uniformly characterize a code’s tolerance to both insertions and deletions. Leveraging this distance and established quantum error correction principles, the authors prove that any quantum t-deletion-correcting code, under specific conditions, can correct arbitrary combinations of indel errors totaling no more than t, and they establish the theoretical upper bound on such correction capability. This work lays a foundational theoretical framework for the design of efficient quantum codes capable of correcting indel errors.
📝 Abstract
This paper proves that any quantum t-deletion-correcting codes also correct a total of t insertion and deletion errors under a certain condition. Here, this condition is that a set of quantum states is defined as a quantum error-correcting code if the error spheres of its states are disjoint, as classical coding theory. In addition, this paper proposes the quantum indel distance and describes insertion and deletion errors correcting capability of quantum codes by this distance.