An Algorithmic Approach to Entanglement-Assisted Quantum Error-Correcting Codes from the Hermitian Curve

We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is c, the number of required maximally entangled quantum states since the Hermitian dual of an AG code is unknown. In this article, we present an efficient algorithmic approach for computing c for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2023

Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes

We introduce a Steane-like enlargement procedure for entanglement-assist...
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
05/15/2023

New entanglement-assisted quantum codes from negacyclic codes

The theory of entanglement-assisted quantum error-correcting codes (EAQE...
research
09/03/2018

Entanglement-assisted quantum codes from Galois LCD codes

Entanglement-assisted quantum error-correcting codes (EAQECCs) make use ...
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...
research
02/01/2022

Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings

In this paper, we provide a framework for constructing entanglement-assi...
research
11/15/2021

Quantum soundness of testing tensor codes

A locally testable code is an error-correcting code that admits very eff...

Please sign up or login with your details

Forgot password? Click here to reset