Quantum stabilizer codes from Abelian and non-Abelian groups association schemes
arXiv:1407.6228
Abstract
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed by bases for the regular representation from U6n, T4n, V8n and dihedral D2n groups. By using Abelian group association schemes followed by cyclic groups and non-Abelian group association schemes a list of binary stabilizer codes up to 40 qubits is given in tables 4, 5, and 10. Moreover, several binary stabilizer codes of distances 5 and 7 with good quantum parameters is presented. The preference of this method specially for Abelian group association schemes is that one can construct any binary quantum stabilizer code with any distance by using the commutative structure of association schemes
arXiv comment23 pages. arXiv admin note: text overlap with arXiv:0901.1968, arXiv:quant-ph/0304161, arXiv:1207.6512 by other authors
References in corpus (9)
- Fault-tolerant quantum computation by anyons
- Mixed State Entanglement and Quantum Error Correction
- Good Quantum Error-Correcting Codes Exist
- Quantum Error Correction and Orthogonal Geometry
- On the relationship between continuous- and discrete-time quantum walk
- Asymmetric quantum error correcting codes
- Additive Asymmetric Quantum Codes
- Error correction optimisation in the presence of X/Z asymmetry
- Analytic asymptotic performance of topological codes