Fast constructions of quantum codes based on residues Pauli block matrices
From MaRDI portal
Summary: We demonstrate how to fast construct quantum error-correction codes based on quadratic residues Pauli block transforms. The present quantum codes have an advantage of being fast designed from Abelian groups on the basis of Pauli block matrices that can be yielded from quadratic residues with much efficiency.
Recommendations
Cites work
- A generalized reverse jacket transform
- A new reverse jacket transform and its fast algorithm.
- Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
- Enlargement of Calderbank-Shor-Steane quantum codes
- Fast Cocyclic Jacket Transform
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes
- Quantum error correction via codes over GF(4)
- Sparse-Graph Codes for Quantum Error Correction
- Stabilizer quantum codes over the Clifford algebra
Cited in
(2)
This page was built for publication: Fast constructions of quantum codes based on residues Pauli block matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606142)