Quantum Deletion Codes Derived From Quantum Reed-Solomon Codes

06/23/2023
by   Manabu Hagiwara, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2022

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

This manuscript is an extended abstract version of the paper entitled “Q...
research
06/08/2019

Applications of Gaussian Binomials to Coding Theory for Deletion Error Correction

We present new applications on q-binomials, also known as Gaussian binom...
research
01/23/2019

Bit Flipping Moment Balancing Schemes for Insertion, Deletion and Substitution Error Correction

In this paper, two moment balancing schemes, namely a variable index sch...
research
06/19/2019

Tutorial on algebraic deletion correction codes

The deletion channel is known to be a notoriously diffcult channel to de...
research
11/17/2022

An efficient combination of quantum error correction and authentication

When sending quantum information over a channel, we want to ensure that ...
research
02/04/2021

Permutation-invariant quantum coding for quantum deletion channels

Quantum deletions, which are harder to correct than erasure errors, occu...
research
08/28/2020

Trade-offs on number and phase shift resilience in bosonic quantum codes

Minimizing the number of particles used by a quantum code is helpful, be...

Please sign up or login with your details

Forgot password? Click here to reset