Document Type

Poster

Publication Date

Summer 2024

Abstract

Building large-scale quantum computers is a very active area of research. A critical part of this effort is the ability to control quantum errors. Recently, many good quantum error correcting codes (QECC) over various finite fields Fq have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly from classical codes, including cyclic, constacyclic, quasicyclic (QC), quasi-twisted (QT), and polycyclic codes using the CSS construction, Hermitian construction, and Lisonek-Singh methods. We believe direct and more elementary methods should be preferred.

Share

COinS
 

Rights Statement

In Copyright - Non-Commercial Use Permitted