Concatenated Quantum Codes Can Attain the Quantum Gilbert–Varshamov Bound

  title={Concatenated Quantum Codes Can Attain the Quantum Gilbert–Varshamov Bound},
  author={Yingkai Ouyang},
  journal={IEEE Transactions on Information Theory},
  • Yingkai Ouyang
  • Published 2014
  • Physics, Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 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 q -ary quantum codes of sufficiently long block length N having fixed rate R with distance at least NH-1((1-R)/2), where Hq2 is the q2 -ary entropy function. For q<;7 , only random quantum codes are known to asymptotically attain the quantum GV… CONTINUE READING
    9 Citations
    Hermitian dual-containing narrow-sense constacyclic BCH codes and quantum codes
    • 2
    Linear programming bounds for quantum amplitude damping codes
    • Yingkai Ouyang, C. Lai
    • Mathematics, Physics
    • 2020 IEEE International Symposium on Information Theory (ISIT)
    • 2020
    • 1
    • PDF
    Weight Distribution of Classical Codes Influences Robust Quantum Metrology
    • 1
    • PDF
    Serially Concatenated Unity-Rate Codes Improve Quantum Codes Without Coding-Rate Reduction
    • 6
    • PDF
    A quantum approach to homomorphic encryption
    • 43
    • PDF
    Holonomic Quantum Computation in Surface Codes
    • 3


    Quantum stabilizer codes and beyond
    • 6
    • Highly Influential
    • PDF
    The Existence of Concatenated Codes List-Decodable up to the Hamming Bound
    • 9
    • PDF
    Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
    • Hao Chen, S. Ling, C. Xing
    • Mathematics, Computer Science
    • IEEE Trans. Inf. Theory
    • 2001
    • 44
    On optimal quantum codes
    • 174
    • PDF
    Concatenated codes can achieve list-decoding capacity
    • 28
    • PDF
    Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
    • M. Hamada
    • Mathematics, Computer Science
    • IEEE Transactions on Information Theory
    • 2008
    • 47
    • PDF
    A Family of Asymptotically Good Quantum Codes Based on Code Concatenation
    • 16
    • PDF
    Stabilizer Codes and Quantum Error Correction
    • 1,387
    • PDF
    A finite Gilbert-Varshamov bound for pure stabilizer quantum codes
    • K. Feng, Z. Ma
    • Mathematics, Computer Science
    • IEEE Transactions on Information Theory
    • 2004
    • 82
    • PDF