A family of asymptotically good quantum codes based on code concatenation
Zhuo Li, Li-Juan Xing, and Xin-Mei Wang
TL;DR
This paper introduces a new family of quantum stabilizer codes that are asymptotically good, constructed via code concatenation with CSS-type Reed-Solomon codes and special inner codes, filling a gap in quantum coding theory.
Contribution
It presents the first explicit construction of asymptotically good quantum codes derived from initially bad codes using concatenation methods.
Findings
Constructed an infinite family of asymptotically good quantum codes.
First example of good quantum codes from bad codes.
Fills a theoretical gap in quantum coding theory.
Abstract
We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer code uses CSS-type quantum Reed-Solomon code and the inner code uses a set of special quantum codes. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum codes is derived from bad codes. Its occurrence supplies a gap in quantum coding theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography