Permutation-Invariant Quantum Codes for Deletion Errors

02/05/2021
by   Taro Shibayama, et al.
0

This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes give the first example of quantum codes that can correct two or more deletion errors. Also, our codes give the first example of quantum codes that can correct both multiple-qubit errors and multiple-deletion errors. We also discuss a generalization of the construction of our codes at the end.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2021

Permutation-invariant quantum coding for quantum deletion channels

Quantum deletions, which are harder to correct than erasure errors, occu...
research
04/05/2016

Designing robust watermark barcodes for multiplex long-read sequencing

A method for designing sequencing barcodes that can withstand a large nu...
research
04/02/2020

Single Quantum Deletion Error-Correcting Codes

In this paper, we discuss a construction method of quantum deletion erro...
research
01/04/2019

Quantum Insertion-Deletion Channels

We introduce a model of quantum insertion-deletion (insdel) channels. In...
research
01/16/2022

Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions

In this work, we study linear error-correcting codes against adversarial...
research
06/19/2019

Tutorial on algebraic deletion correction codes

The deletion channel is known to be a notoriously diffcult channel to de...
research
07/12/2021

Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions

In this work, we study linear error-correcting codes against adversarial...

Please sign up or login with your details

Forgot password? Click here to reset