Maximal entanglement entanglement-assisted quantum codes constructed from linear codes

2014 ◽  
Vol 14 (1) ◽  
pp. 165-182 ◽  
Author(s):  
Liangdong Lu ◽  
Ruihu Li ◽  
Luobin Guo ◽  
Qiang Fu
2014 ◽  
Vol 73 (2) ◽  
pp. 417-424 ◽  
Author(s):  
Petr Lisoněk ◽  
Vijaykumar Singh

2020 ◽  
Vol 19 (3) ◽  
Author(s):  
Xiusheng Liu ◽  
Peng Hu
Keyword(s):  

2015 ◽  
Vol 13 (01) ◽  
pp. 1550002 ◽  
Author(s):  
Luobin Guo ◽  
Qiang Fu ◽  
Ruihu Li ◽  
Liangdong Lu

Entanglement-assisted quantum error correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, we give elementary recursive constructions of quaternary zero radical codes with dual distance three for all n ≥ 4. Consequently, good maximal entanglement EAQECCs of minimum distance three for such length n are obtained. Almost all of these EAQECCs are optimal or near optimal according to the EA-quantum Hamming bound.


2014 ◽  
Vol 12 (04) ◽  
pp. 1450020 ◽  
Author(s):  
Kenza Guenda ◽  
T. Aaron Gulliver

This paper considers the construction of quantum error correcting codes from linear codes over finite commutative Frobenius rings. We extend the Calderbank–Shor–Steane (CSS) construction to these rings. Further, quantum codes are extended to matrix product codes. Quantum codes over 𝔽pk are also obtained from linear codes over rings using the generalized Gray map.


Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1495
Author(s):  
Yansheng Wu ◽  
Yoonjin Lee

It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical codes with some special properties, and the CSS construction of quantum codes is a well-known construction. First, we employ hierarchical posets with two levels for construction of binary linear codes. Second, we find some necessary and sufficient conditions for these linear codes constructed using posets to be self-orthogonal, and we use these self-orthogonal codes for obtaining binary quantum codes. Finally, we obtain four infinite families of binary quantum codes for which the minimum distances are three or four by CSS construction, which include binary quantum Hamming codes with length n≥7. We also find some (almost) “optimal” quantum codes according to the current database of Grassl. Furthermore, we explicitly determine the weight distributions of these linear codes constructed using posets, and we present two infinite families of some optimal binary linear codes with respect to the Griesmer bound and a class of binary Hamming codes.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 26418-26421 ◽  
Author(s):  
Jian Gao ◽  
Yongkang Wang
Keyword(s):  

2020 ◽  
Vol 24 (3) ◽  
pp. 472-476 ◽  
Author(s):  
Junli Wang ◽  
Ruihu Li ◽  
Jingjie Lv ◽  
Hao Song

2014 ◽  
Vol 12 (03) ◽  
pp. 1450017 ◽  
Author(s):  
Liqi Wang ◽  
Shixin Zhu

Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the constructed asymmetric quantum codes are optimal and different from the codes available in the literature.


Sign in / Sign up

Export Citation Format

Share Document