Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

12/13/2018
by   Carlos Galindo, et al.
0

We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field holds for codes over arbitrary finite fields as well. We also give a Gilbert-Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.

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
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
05/15/2023

New entanglement-assisted quantum codes from negacyclic codes

The theory of entanglement-assisted quantum error-correcting codes (EAQE...
research
07/28/2019

Hulls of Linear Codes Revisited with Applications

Hulls of linear codes have been of interest and extensively studied due ...
research
11/21/2022

Optimal quaternary linear codes with one-dimensional Hermitian hull and the related EAQECCs

Linear codes with small hulls over finite fields have been extensively s...
research
05/10/2023

Private Product Computation using Quantum Entanglement

In this work, we show that a pair of entangled qubits can be used to com...
research
11/04/2022

Characterization of optimal binary linear codes with one-dimensional hull

The hull of a linear code over finite fields is the intersection of the ...

Please sign up or login with your details

Forgot password? Click here to reset