Quantum codes from affine variety codes and their subfield-subcodes
Carlos Galindo, Fernando Hernando
TL;DR
This paper introduces a method to construct quantum stabilizer codes using affine variety codes and their subfield-subcodes, resulting in codes with improved parameters that surpass existing bounds.
Contribution
The authors develop a novel approach to generate quantum codes from affine variety codes, achieving parameters that exceed the CSS quantum Gilbert-Varshamov bound.
Findings
Codes with better parameters than previous bounds
Successful application of affine variety codes in quantum error correction
Demonstration of codes surpassing the CSS quantum Gilbert-Varshamov bound
Abstract
We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure, we get codes with good parameters and a code whose parameters exceed the CSS quantum Gilbert-Varshamov bound given by Feng and Ma.
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 · Coding theory and cryptography · Quantum-Dot Cellular Automata