CSS-Like Constructions of Asymmetric Quantum Codes
From MaRDI portal
Abstract: Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of -ary AQCs is extended by removing the -linearity requirement as well as the limitation on the type of inner product used. The proposed constructions are called CSS-like constructions and utilize pairs of nested subfield linear codes under one of the Euclidean, trace Euclidean, Hermitian, and trace Hermitian inner products. After establishing some theoretical foundations, best-performing CSS-like AQCs are constructed. Combining some constructions of nested pairs of classical codes and linear programming, many optimal and good pure -ary CSS-like codes for up to reasonable lengths are found. In many instances, removing the -linearity and using alternative inner products give us pure AQCs with improved parameters than relying solely on the standard CSS construction.
Recommendations
- On the construction of asymmetric quantum codes
- Asymmetric Quantum Codes: Characterization and Constructions
- Asymmetric quantum codes: constructions, bounds and performance
- Pure asymmetric quantum MDS codes from CSS construction: a complete characterization
- Constructions of asymmetric quantum alternant codes
- On the construction of optimal asymmetric quantum codes
- Some new constructions of optimal asymmetric quantum codes
- Symmetric and asymmetric quantum codes
- New quantum codes from CSS codes
Cited in
(24)- Enumeration of complementary-dual cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- On nested code pairs from the Hermitian curve
- Linear \(\ell\)-intersection pairs of MDS codes and their applications to AEAQECCs
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- Xing-Ling codes, duals of their subcodes, and good asymmetric quantum codes
- Some families of asymmetric quantum codes and quantum convolutional codes from constacyclic codes
- Constructions of new nonbinary quantum codes
- Quantum codes from affine variety codes and their subfield-subcodes
- Constructions of asymmetric quantum alternant codes
- Asymmetric quantum Griesmer codes detecting a single bit-flip error
- Pure asymmetric quantum MDS codes from CSS construction: a complete characterization
- New quantum MDS codes
- A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
- New asymmetric quantum codes over \(F_q\)
- Some families of optimal quantum codes derived from constacyclic codes
- Skew generalized quasi-cyclic codes
- New asymmetric quantum codes over \(\mathbf{F}_{q^2}\)
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- The subfield metric and its application to quantum error correction
- Linear l-intersection pairs of matrix-product codes and their applications
- Symplectically self-orthogonal additive codes and their applications to quantum stabilizer codes
- Some families of asymmetric quantum MDS codes constructed from constacyclic codes
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- A construction of MDS quantum convolutional codes
This page was built for publication: CSS-Like Constructions of Asymmetric Quantum Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346319)
