Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes

TL;DR

This paper introduces a novel method for constructing quantum deletion codes that can correct multiple errors, using new algorithms to simplify correction and improve flexibility without prior error count knowledge.

Contribution

It presents a new construction approach for quantum deletion codes based on quantum Reed-Solomon codes, with algorithms that convert deletion correction into erasure correction.

Findings

Enables correction of multiple deletion errors in quantum codes

Allows flexible code rates without knowing the number of deletions

Reduces deletion correction to erasure correction

Abstract

This manuscript presents 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. Unlike previous quantum deletion error-correcting codes, our approach enables flexible code rates and eliminates the requirement of knowing the number of deletions.