Explicit method to make shortened stabilizer EAQECC from stabilizer QECC

05/27/2022
by   Daiki Ueno, et al.
0

In the previous research by Grassl, Huber and Winter, they proved a theorem which can make entanglement-assisted quantum error-correcting codes (EAQECC) from general quantum error-correcting codes (QECC). In this paper, we prove that the shortened EAQECC is a stabilizer code if the original EAQECC is a stabilizer code.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2023

Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes

Subfield subcodes of Reed-Solomon codes and their duals, BCH codes, have...
research
08/29/2023

Existence of Pauli-like stabilizers for every quantum error-correcting code

The Pauli stabilizer formalism is perhaps the most thoroughly studied me...
research
11/16/2018

Error correcting codes from sub-exceeding fonction

In this paper, we present error-correcting codes which are the results o...
research
03/29/2020

On the decoding of 1-Fibonacci error correcting codes

The study of new error correcting codes has raised attention in the last...
research
11/15/2021

Quantum soundness of testing tensor codes

A locally testable code is an error-correcting code that admits very eff...
research
10/02/2015

Autonomous Perceptron Neural Network Inspired from Quantum computing

This abstract will be modified after correcting the minor error in Eq.(2...
research
07/02/2020

Entanglement-Assisted Quantum Error Correcting Codes From RS Codes and BCH Codes with Extension Degree 2

Entanglement-assisted quantum error correcting codes (EAQECCs) from Reed...

Please sign up or login with your details

Forgot password? Click here to reset