In this paper, we utilize a concatenation scheme to construct new families of quantum error correction codes achieving the quantum Gilbert-Varshamov (GV) bound asymptotically. Weconcatenate alternant codes with any linear code achievingthe classical GV bound to construct Calderbank-Shor-Steane (CSS) codes. We show that the concatenated code can achieve the quantum GV bound asymptotically and can approach the Hashing bound for asymmetric Pauli channels. By combing Steane’s enlargement construction of CSS codes, we derive a family of enlarged stabilizer codes achieving the quantum GV bound for enlarged CSS codes asymptotically. Asapplications, we derive two families of fast encodable and decodable CSS codes with parametersQ1=[[N,Ω(N),Ω(N)]], andQ2=[[N,Ω(N/logN),Ω(N/logN)/Ω(logN)]]. We show thatQ1can be encoded very efficiently by circuits of sizeO(N)and depthO(N). For an input error syndrome,Q1can correct any adversarial error of weight up to half the minimum distance bound inO(N)time.Q1can also be decoded in parallel inO(N)time by usingO(N)classical processors. For an input error syndrome, we proved thatQ2can correct a linear number ofX-errors with high probability and an almost linear number ofZ-errors inO(N)time. Moreover,Q2can be decoded in parallel inO(log(N))time by usingO(N)classical processors.
The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced in this article. Codes of this type take advantage of the asymmetry in quantum errors since phase-shift errors are more probable than qudit-flip errors. Moreover, they use pre-shared entanglement between encoder and decoder to simplify the theory of quantum error correction and increase the communication capacity. Thus, asymmetric EAQECCs can be constructed from any pair of classical linear codes over an arbitrary field. Their parameters are described and a Gilbert-Varshamov bound is presented. Explicit parameters of asymmetric EAQECCs from BCH codes are computed and examples exceeding the introduced Gilbert-Varshamov bound are shown.