New Symmetric and Asymmetric Quantum Codes
Kenza Guenda, T. Aaron Gulliver
TL;DR
This paper introduces new families of quantum symmetric and asymmetric codes, many of which are MDS, with parameters surpassing previously known codes, and includes known codes as special cases.
Contribution
The paper constructs new infinite families of quantum codes with improved parameters, including symmetric and asymmetric types, many of which are MDS.
Findings
Several codes are MDS with optimal parameters.
The new codes outperform previously known quantum codes.
Some known codes are special cases of the new constructions.
Abstract
New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of the codes given here.
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