Concatenated quantum codes can attain the quantum Gilbert-Varshamov bound
arXiv:1004.1127 · doi:10.1109/TIT.2014.2313577
Abstract
A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to its block length approaches a positive constant. The asymptotic quantum Gilbert-Varshamov (GV) bound states that there exist -ary quantum codes of sufficiently long block length having fixed rate with distance at least , where is the -ary entropy function. For , only random quantum codes are known to asymptotically attain the quantum GV bound. However, random codes have little structure. In this paper, we generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region.
15 pages, single column, Manuscript is completely rewritten in standard notation, and minor errors are fixed. The figure is updated
References in corpus (4)
Cited by in corpus (7)
- A quantum approach to homomorphic encryption
- Imaging stars with quantum error correction
- Robust quantum metrology with explicit symmetric states
- Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically
- Linear programming bounds for quantum amplitude damping codes
- Linear programming bounds for quantum channels acting on quantum error-correcting codes
- Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes